./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c9c8a757 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e977fbeb632c2e5a16902a6c2250cf608217c650 ............................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 e977fbeb632c2e5a16902a6c2250cf608217c650 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) --- Real Ultimate output --- This is Ultimate 0.1.24-c9c8a75 [2019-11-28 10:03:13,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:03:13,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:03:13,166 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:03:13,166 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:03:13,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:03:13,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:03:13,171 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:03:13,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:03:13,174 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:03:13,175 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:03:13,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:03:13,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:03:13,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:03:13,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:03:13,181 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:03:13,182 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:03:13,183 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:03:13,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:03:13,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:03:13,190 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:03:13,191 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:03:13,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:03:13,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:03:13,196 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:03:13,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:03:13,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:03:13,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:03:13,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:03:13,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:03:13,201 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:03:13,202 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:03:13,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:03:13,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:03:13,205 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:03:13,205 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:03:13,206 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:03:13,207 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:03:13,207 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:03:13,208 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:03:13,209 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:03:13,210 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 10:03:13,231 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:03:13,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:03:13,234 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:03:13,235 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:03:13,235 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:03:13,235 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:03:13,235 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:03:13,236 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:03:13,236 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:03:13,236 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:03:13,237 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:03:13,238 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:03:13,238 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:03:13,239 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:03:13,239 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:03:13,239 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:03:13,240 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:03:13,240 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:03:13,240 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:03:13,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:03:13,241 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:03:13,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:03:13,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:03:13,242 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:03:13,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:03:13,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 10:03:13,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 10:03:13,243 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-28 10:03:13,545 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:03:13,559 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:03:13,562 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:03:13,564 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:03:13,564 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:03:13,565 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 10:03:13,625 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f669b81d8/f9ee2a24e10645a599696a5aa38dab89/FLAGb57e3b942 [2019-11-28 10:03:14,225 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:03:14,225 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 10:03:14,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f669b81d8/f9ee2a24e10645a599696a5aa38dab89/FLAGb57e3b942 [2019-11-28 10:03:14,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f669b81d8/f9ee2a24e10645a599696a5aa38dab89 [2019-11-28 10:03:14,463 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:03:14,465 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:03:14,466 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:14,466 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:03:14,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:03:14,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:14" (1/1) ... [2019-11-28 10:03:14,473 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7109c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:14, skipping insertion in model container [2019-11-28 10:03:14,474 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:14" (1/1) ... [2019-11-28 10:03:14,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:03:14,544 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:15,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:15,064 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-11-28 10:03:15,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b9870eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:15, skipping insertion in model container [2019-11-28 10:03:15,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:15,066 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 10:03:15,070 INFO L168 Benchmark]: Toolchain (without parser) took 603.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:03:15,071 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:03:15,072 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-28 10:03:15,074 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 600.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -183.5 MB). Peak memory consumption was 26.0 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.24-c9c8a75 [2019-11-28 10:03:16,737 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 10:03:16,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 10:03:16,759 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 10:03:16,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 10:03:16,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 10:03:16,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 10:03:16,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 10:03:16,779 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 10:03:16,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 10:03:16,786 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 10:03:16,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 10:03:16,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 10:03:16,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 10:03:16,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 10:03:16,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 10:03:16,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 10:03:16,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 10:03:16,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 10:03:16,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 10:03:16,800 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 10:03:16,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 10:03:16,803 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 10:03:16,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 10:03:16,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 10:03:16,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 10:03:16,807 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 10:03:16,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 10:03:16,808 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 10:03:16,809 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 10:03:16,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 10:03:16,810 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 10:03:16,811 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 10:03:16,812 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 10:03:16,813 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 10:03:16,813 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 10:03:16,814 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 10:03:16,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 10:03:16,815 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 10:03:16,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 10:03:16,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 10:03:16,818 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 10:03:16,835 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 10:03:16,835 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 10:03:16,837 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 10:03:16,840 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 10:03:16,840 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 10:03:16,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 10:03:16,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 10:03:16,841 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 10:03:16,841 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 10:03:16,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 10:03:16,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 10:03:16,842 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 10:03:16,842 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 10:03:16,843 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 10:03:16,843 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 10:03:16,843 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 10:03:16,843 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 10:03:16,844 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 10:03:16,844 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 10:03:16,844 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 10:03:16,845 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 10:03:16,845 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 10:03:16,845 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 10:03:16,845 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 10:03:16,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:03:16,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 10:03:16,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 10:03:16,847 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 10:03:16,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 10:03:16,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 10:03:16,847 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> e977fbeb632c2e5a16902a6c2250cf608217c650 [2019-11-28 10:03:17,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 10:03:17,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 10:03:17,180 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 10:03:17,182 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 10:03:17,183 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 10:03:17,184 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 10:03:17,249 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74849eee2/75b44e64dbe94ed0815fb8d362b88304/FLAG518656dbc [2019-11-28 10:03:17,810 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 10:03:17,811 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_3-2.i [2019-11-28 10:03:17,835 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74849eee2/75b44e64dbe94ed0815fb8d362b88304/FLAG518656dbc [2019-11-28 10:03:18,088 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74849eee2/75b44e64dbe94ed0815fb8d362b88304 [2019-11-28 10:03:18,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 10:03:18,093 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 10:03:18,094 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:18,094 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 10:03:18,098 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 10:03:18,099 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:18,102 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7109c780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18, skipping insertion in model container [2019-11-28 10:03:18,102 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:18,109 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 10:03:18,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:18,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:18,725 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 10:03:18,747 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 10:03:18,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:18,801 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 10:03:18,852 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 10:03:18,950 INFO L208 MainTranslator]: Completed translation [2019-11-28 10:03:18,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18 WrapperNode [2019-11-28 10:03:18,953 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 10:03:18,955 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 10:03:18,955 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 10:03:18,955 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 10:03:18,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:18,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:19,001 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:19,001 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:19,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:19,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:19,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... [2019-11-28 10:03:19,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 10:03:19,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 10:03:19,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 10:03:19,064 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 10:03:19,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 10:03:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 10:03:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 10:03:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 10:03:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 10:03:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 10:03:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 10:03:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 10:03:19,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 10:03:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 10:03:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-28 10:03:19,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-28 10:03:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-28 10:03:19,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-28 10:03:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-28 10:03:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-28 10:03:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-28 10:03:19,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-28 10:03:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-28 10:03:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-28 10:03:19,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-28 10:03:19,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-28 10:03:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-28 10:03:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-28 10:03:19,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-28 10:03:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-28 10:03:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-28 10:03:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-28 10:03:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-28 10:03:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-28 10:03:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-28 10:03:19,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-28 10:03:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-28 10:03:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-28 10:03:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-28 10:03:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-28 10:03:19,151 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-28 10:03:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 10:03:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-28 10:03:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-28 10:03:19,152 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-28 10:03:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 10:03:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 10:03:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 10:03:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 10:03:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 10:03:19,153 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 10:03:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 10:03:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 10:03:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 10:03:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 10:03:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 10:03:19,154 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 10:03:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 10:03:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 10:03:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 10:03:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 10:03:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 10:03:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 10:03:19,155 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 10:03:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 10:03:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 10:03:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 10:03:19,156 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 10:03:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 10:03:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 10:03:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 10:03:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 10:03:19,157 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 10:03:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 10:03:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 10:03:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 10:03:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 10:03:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 10:03:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 10:03:19,158 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 10:03:19,159 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 10:03:19,160 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 10:03:19,161 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 10:03:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 10:03:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 10:03:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 10:03:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 10:03:19,162 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 10:03:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 10:03:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 10:03:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 10:03:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 10:03:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 10:03:19,163 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 10:03:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 10:03:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 10:03:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 10:03:19,164 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 10:03:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 10:03:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 10:03:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 10:03:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 10:03:19,165 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 10:03:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 10:03:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 10:03:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 10:03:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 10:03:19,166 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 10:03:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 10:03:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 10:03:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 10:03:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 10:03:19,167 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 10:03:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 10:03:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 10:03:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 10:03:19,168 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 10:03:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 10:03:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 10:03:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 10:03:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 10:03:19,169 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 10:03:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 10:03:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 10:03:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 10:03:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 10:03:19,170 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 10:03:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 10:03:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 10:03:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-28 10:03:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 10:03:19,171 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-28 10:03:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-28 10:03:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-28 10:03:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-28 10:03:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-28 10:03:19,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 10:03:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-28 10:03:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-28 10:03:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-28 10:03:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 10:03:19,173 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-28 10:03:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-28 10:03:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-28 10:03:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 10:03:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-28 10:03:19,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-28 10:03:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-28 10:03:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-28 10:03:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-28 10:03:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-28 10:03:19,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 10:03:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-28 10:03:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-28 10:03:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-28 10:03:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-28 10:03:19,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-28 10:03:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 10:03:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 10:03:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-28 10:03:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-28 10:03:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-28 10:03:19,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-28 10:03:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-28 10:03:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-28 10:03:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-28 10:03:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-28 10:03:19,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-28 10:03:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-28 10:03:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-28 10:03:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-28 10:03:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-28 10:03:19,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-28 10:03:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-28 10:03:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-28 10:03:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-28 10:03:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-28 10:03:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 10:03:19,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 10:03:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 10:03:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 10:03:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 10:03:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 10:03:19,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-28 10:03:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-28 10:03:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-28 10:03:19,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-28 10:03:19,859 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:03:20,242 WARN L757 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 10:03:20,617 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 10:03:20,617 INFO L297 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-28 10:03:20,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:03:20 BoogieIcfgContainer [2019-11-28 10:03:20,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 10:03:20,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 10:03:20,625 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 10:03:20,628 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 10:03:20,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 10:03:18" (1/3) ... [2019-11-28 10:03:20,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1905b8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:03:20, skipping insertion in model container [2019-11-28 10:03:20,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 10:03:18" (2/3) ... [2019-11-28 10:03:20,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1905b8ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 10:03:20, skipping insertion in model container [2019-11-28 10:03:20,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 10:03:20" (3/3) ... [2019-11-28 10:03:20,634 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_3-2.i [2019-11-28 10:03:20,646 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 10:03:20,660 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-28 10:03:20,675 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-28 10:03:20,707 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 10:03:20,707 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 10:03:20,708 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 10:03:20,708 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 10:03:20,708 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 10:03:20,708 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 10:03:20,709 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 10:03:20,709 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 10:03:20,738 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2019-11-28 10:03:20,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 10:03:20,751 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:20,752 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:20,754 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:20,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999723, now seen corresponding path program 1 times [2019-11-28 10:03:20,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:20,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815624863] [2019-11-28 10:03:20,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:20,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:20,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:21,052 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:21,055 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:21,069 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:21,069 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:21,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:21,105 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:21,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:21,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815624863] [2019-11-28 10:03:21,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:21,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 10:03:21,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875271353] [2019-11-28 10:03:21,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:21,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:21,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:21,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:21,193 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 5 states. [2019-11-28 10:03:21,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:21,502 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2019-11-28 10:03:21,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:21,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 10:03:21,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:21,519 INFO L225 Difference]: With dead ends: 133 [2019-11-28 10:03:21,519 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 10:03:21,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:21,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 10:03:21,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2019-11-28 10:03:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 10:03:21,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2019-11-28 10:03:21,583 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 17 [2019-11-28 10:03:21,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:21,584 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2019-11-28 10:03:21,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2019-11-28 10:03:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 10:03:21,585 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:21,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:21,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 10:03:21,798 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1484999724, now seen corresponding path program 1 times [2019-11-28 10:03:21,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:21,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1605294282] [2019-11-28 10:03:21,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:21,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:03:21,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:21,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:21,992 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:22,005 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:22,006 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:22,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:22,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:22,060 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:22,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:22,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1605294282] [2019-11-28 10:03:22,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:22,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 10:03:22,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711568203] [2019-11-28 10:03:22,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:03:22,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:22,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:03:22,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:03:22,433 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand 10 states. [2019-11-28 10:03:23,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:23,087 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-11-28 10:03:23,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:03:23,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-28 10:03:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:23,095 INFO L225 Difference]: With dead ends: 129 [2019-11-28 10:03:23,095 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 10:03:23,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:03:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 10:03:23,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2019-11-28 10:03:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-28 10:03:23,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2019-11-28 10:03:23,112 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 17 [2019-11-28 10:03:23,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:23,113 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2019-11-28 10:03:23,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:03:23,113 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2019-11-28 10:03:23,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 10:03:23,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:23,114 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:23,338 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 10:03:23,338 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:23,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:23,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1513628874, now seen corresponding path program 1 times [2019-11-28 10:03:23,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:23,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413137819] [2019-11-28 10:03:23,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:23,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:03:23,466 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:23,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:23,503 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:23,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413137819] [2019-11-28 10:03:23,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:23,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:03:23,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056761197] [2019-11-28 10:03:23,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:23,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:23,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:23,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:23,551 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 5 states. [2019-11-28 10:03:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:23,577 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2019-11-28 10:03:23,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:23,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-28 10:03:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:23,579 INFO L225 Difference]: With dead ends: 123 [2019-11-28 10:03:23,580 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 10:03:23,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:23,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 10:03:23,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-28 10:03:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 10:03:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2019-11-28 10:03:23,600 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 17 [2019-11-28 10:03:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:23,601 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2019-11-28 10:03:23,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2019-11-28 10:03:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 10:03:23,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:23,607 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:23,825 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 10:03:23,826 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:23,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1578542280, now seen corresponding path program 1 times [2019-11-28 10:03:23,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:23,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979798279] [2019-11-28 10:03:23,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:23,973 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:23,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:24,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:24,004 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:24,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979798279] [2019-11-28 10:03:24,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:24,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-28 10:03:24,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869613550] [2019-11-28 10:03:24,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 10:03:24,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 10:03:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:24,081 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 5 states. [2019-11-28 10:03:24,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:24,106 INFO L93 Difference]: Finished difference Result 123 states and 130 transitions. [2019-11-28 10:03:24,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 10:03:24,107 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-28 10:03:24,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:24,109 INFO L225 Difference]: With dead ends: 123 [2019-11-28 10:03:24,109 INFO L226 Difference]: Without dead ends: 123 [2019-11-28 10:03:24,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 10:03:24,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-28 10:03:24,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2019-11-28 10:03:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-11-28 10:03:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 128 transitions. [2019-11-28 10:03:24,120 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 128 transitions. Word has length 29 [2019-11-28 10:03:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:24,120 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 128 transitions. [2019-11-28 10:03:24,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 10:03:24,120 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2019-11-28 10:03:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 10:03:24,122 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:24,122 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:24,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 10:03:24,330 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:24,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash 581469927, now seen corresponding path program 1 times [2019-11-28 10:03:24,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:24,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1970305360] [2019-11-28 10:03:24,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:24,484 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 10:03:24,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:24,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:24,550 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:24,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:24,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1970305360] [2019-11-28 10:03:24,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:24,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 7 [2019-11-28 10:03:24,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516101674] [2019-11-28 10:03:24,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 10:03:24,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:24,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 10:03:24,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:03:24,624 INFO L87 Difference]: Start difference. First operand 121 states and 128 transitions. Second operand 7 states. [2019-11-28 10:03:24,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:24,711 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2019-11-28 10:03:24,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 10:03:24,713 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2019-11-28 10:03:24,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:24,715 INFO L225 Difference]: With dead ends: 134 [2019-11-28 10:03:24,715 INFO L226 Difference]: Without dead ends: 134 [2019-11-28 10:03:24,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:03:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-28 10:03:24,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2019-11-28 10:03:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 10:03:24,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2019-11-28 10:03:24,736 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 29 [2019-11-28 10:03:24,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:24,736 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2019-11-28 10:03:24,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 10:03:24,738 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2019-11-28 10:03:24,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 10:03:24,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:24,739 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:24,940 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 10:03:24,941 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:24,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:24,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1899216601, now seen corresponding path program 1 times [2019-11-28 10:03:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:24,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [503195197] [2019-11-28 10:03:24,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:25,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 10:03:25,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:25,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:25,101 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:25,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:25,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [503195197] [2019-11-28 10:03:25,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:25,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 10:03:25,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140309421] [2019-11-28 10:03:25,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 10:03:25,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:25,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 10:03:25,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-28 10:03:25,162 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand 6 states. [2019-11-28 10:03:25,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:25,219 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2019-11-28 10:03:25,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 10:03:25,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-28 10:03:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:25,222 INFO L225 Difference]: With dead ends: 136 [2019-11-28 10:03:25,223 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 10:03:25,223 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-28 10:03:25,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 10:03:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-11-28 10:03:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 10:03:25,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2019-11-28 10:03:25,247 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 32 [2019-11-28 10:03:25,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:25,247 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2019-11-28 10:03:25,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 10:03:25,248 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2019-11-28 10:03:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 10:03:25,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:25,249 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:25,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 10:03:25,470 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:25,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:25,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2034413241, now seen corresponding path program 1 times [2019-11-28 10:03:25,471 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:25,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776682238] [2019-11-28 10:03:25,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:25,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 10:03:25,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:25,638 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:25,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:25,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776682238] [2019-11-28 10:03:25,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:25,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-28 10:03:25,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994411814] [2019-11-28 10:03:25,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:03:25,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:25,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:03:25,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 10:03:25,759 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 10 states. [2019-11-28 10:03:25,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:25,994 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-28 10:03:25,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 10:03:25,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-28 10:03:25,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:25,997 INFO L225 Difference]: With dead ends: 140 [2019-11-28 10:03:25,997 INFO L226 Difference]: Without dead ends: 136 [2019-11-28 10:03:25,998 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-28 10:03:25,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-28 10:03:26,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2019-11-28 10:03:26,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-28 10:03:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2019-11-28 10:03:26,005 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 34 [2019-11-28 10:03:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:26,006 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2019-11-28 10:03:26,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:03:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2019-11-28 10:03:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 10:03:26,008 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:26,008 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, 1, 1, 1, 1] [2019-11-28 10:03:26,227 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 10:03:26,228 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:26,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:26,228 INFO L82 PathProgramCache]: Analyzing trace with hash 76391075, now seen corresponding path program 1 times [2019-11-28 10:03:26,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:26,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [538970344] [2019-11-28 10:03:26,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:26,378 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 10:03:26,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:26,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 10:03:26,400 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:26,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 10:03:26,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [538970344] [2019-11-28 10:03:26,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:26,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 10:03:26,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767116182] [2019-11-28 10:03:26,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 10:03:26,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:26,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 10:03:26,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 10:03:26,599 INFO L87 Difference]: Start difference. First operand 136 states and 144 transitions. Second operand 3 states. [2019-11-28 10:03:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:26,777 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2019-11-28 10:03:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 10:03:26,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-28 10:03:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:26,779 INFO L225 Difference]: With dead ends: 147 [2019-11-28 10:03:26,779 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 10:03:26,780 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 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-11-28 10:03:26,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 10:03:26,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2019-11-28 10:03:26,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-11-28 10:03:26,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2019-11-28 10:03:26,787 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 32 [2019-11-28 10:03:26,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:26,787 INFO L462 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2019-11-28 10:03:26,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 10:03:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2019-11-28 10:03:26,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 10:03:26,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:26,789 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:27,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 10:03:27,005 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:27,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:27,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272825, now seen corresponding path program 2 times [2019-11-28 10:03:27,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:27,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100671554] [2019-11-28 10:03:27,008 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:27,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 10:03:27,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:03:27,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 10:03:27,162 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:27,178 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:27,178 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:27,183 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:27,184 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:27,184 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:27,379 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 10:03:27,379 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:27,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-28 10:03:27,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100671554] [2019-11-28 10:03:27,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:27,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 10:03:27,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539498531] [2019-11-28 10:03:27,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:03:27,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:03:27,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:03:27,470 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand 12 states. [2019-11-28 10:03:28,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:28,473 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2019-11-28 10:03:28,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:03:28,474 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-11-28 10:03:28,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:28,477 INFO L225 Difference]: With dead ends: 146 [2019-11-28 10:03:28,477 INFO L226 Difference]: Without dead ends: 146 [2019-11-28 10:03:28,477 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:03:28,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-11-28 10:03:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 122. [2019-11-28 10:03:28,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-28 10:03:28,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2019-11-28 10:03:28,486 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 38 [2019-11-28 10:03:28,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:28,487 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2019-11-28 10:03:28,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:03:28,487 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2019-11-28 10:03:28,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-28 10:03:28,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:28,489 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:28,711 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 10:03:28,712 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:28,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:28,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1051272824, now seen corresponding path program 1 times [2019-11-28 10:03:28,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:28,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266694031] [2019-11-28 10:03:28,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:28,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 10:03:28,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:28,960 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:28,960 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:29,313 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:29,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266694031] [2019-11-28 10:03:29,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:29,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-28 10:03:29,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388303567] [2019-11-28 10:03:29,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-28 10:03:29,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:29,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-28 10:03:29,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-28 10:03:29,315 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand 18 states. [2019-11-28 10:03:30,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:30,267 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-11-28 10:03:30,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 10:03:30,269 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-28 10:03:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:30,273 INFO L225 Difference]: With dead ends: 134 [2019-11-28 10:03:30,273 INFO L226 Difference]: Without dead ends: 130 [2019-11-28 10:03:30,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-28 10:03:30,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-28 10:03:30,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2019-11-28 10:03:30,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 10:03:30,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 136 transitions. [2019-11-28 10:03:30,281 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 136 transitions. Word has length 38 [2019-11-28 10:03:30,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:30,283 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 136 transitions. [2019-11-28 10:03:30,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-28 10:03:30,284 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2019-11-28 10:03:30,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-28 10:03:30,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:30,286 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:30,489 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 10:03:30,490 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:30,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:30,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2061530616, now seen corresponding path program 2 times [2019-11-28 10:03:30,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:30,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379427741] [2019-11-28 10:03:30,492 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:30,630 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 10:03:30,630 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:03:30,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 10:03:30,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:30,653 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:30,654 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:30,660 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:30,660 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:30,661 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:30,875 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 10:03:30,875 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-28 10:03:31,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379427741] [2019-11-28 10:03:31,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:31,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 10:03:31,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281341976] [2019-11-28 10:03:31,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 10:03:31,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:31,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 10:03:31,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:03:31,727 INFO L87 Difference]: Start difference. First operand 130 states and 136 transitions. Second operand 23 states. [2019-11-28 10:03:34,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:34,216 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-11-28 10:03:34,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:03:34,216 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-28 10:03:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:34,218 INFO L225 Difference]: With dead ends: 129 [2019-11-28 10:03:34,218 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 10:03:34,219 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 10:03:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 10:03:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-11-28 10:03:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 10:03:34,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-28 10:03:34,224 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 46 [2019-11-28 10:03:34,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:34,224 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-28 10:03:34,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 10:03:34,225 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-28 10:03:34,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-28 10:03:34,226 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:34,226 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:34,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 10:03:34,432 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1631731192, now seen corresponding path program 1 times [2019-11-28 10:03:34,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:34,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860604724] [2019-11-28 10:03:34,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:34,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:34,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 10:03:34,604 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:34,801 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:34,801 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:34,908 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-28 10:03:35,711 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:03:35,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860604724] [2019-11-28 10:03:35,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 10:03:35,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-28 10:03:35,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373459655] [2019-11-28 10:03:35,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-28 10:03:35,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:35,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-28 10:03:35,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-28 10:03:35,714 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 34 states. [2019-11-28 10:03:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:36,472 INFO L93 Difference]: Finished difference Result 135 states and 141 transitions. [2019-11-28 10:03:36,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-28 10:03:36,473 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-28 10:03:36,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:36,474 INFO L225 Difference]: With dead ends: 135 [2019-11-28 10:03:36,474 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 10:03:36,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-28 10:03:36,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 10:03:36,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 10:03:36,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 10:03:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 137 transitions. [2019-11-28 10:03:36,480 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 137 transitions. Word has length 51 [2019-11-28 10:03:36,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:36,481 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 137 transitions. [2019-11-28 10:03:36,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-28 10:03:36,481 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 137 transitions. [2019-11-28 10:03:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:03:36,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:36,482 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:36,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 10:03:36,694 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:36,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:36,695 INFO L82 PathProgramCache]: Analyzing trace with hash -346949160, now seen corresponding path program 2 times [2019-11-28 10:03:36,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:36,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988844108] [2019-11-28 10:03:36,696 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:36,827 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-28 10:03:36,827 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 10:03:36,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 10:03:36,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:36,842 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:36,842 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:36,845 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:36,845 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:36,845 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:36,984 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:37,052 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:37,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988844108] [2019-11-28 10:03:37,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:37,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 11 [2019-11-28 10:03:37,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407825685] [2019-11-28 10:03:37,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 10:03:37,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:37,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 10:03:37,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-28 10:03:37,054 INFO L87 Difference]: Start difference. First operand 131 states and 137 transitions. Second operand 12 states. [2019-11-28 10:03:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:37,866 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2019-11-28 10:03:37,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 10:03:37,866 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-11-28 10:03:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:37,868 INFO L225 Difference]: With dead ends: 153 [2019-11-28 10:03:37,868 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 10:03:37,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-28 10:03:37,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 10:03:37,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 129. [2019-11-28 10:03:37,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 10:03:37,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2019-11-28 10:03:37,875 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 53 [2019-11-28 10:03:37,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:37,876 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2019-11-28 10:03:37,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 10:03:37,876 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2019-11-28 10:03:37,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-28 10:03:37,877 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:37,877 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:38,088 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 10:03:38,089 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, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:38,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:38,090 INFO L82 PathProgramCache]: Analyzing trace with hash -346949159, now seen corresponding path program 1 times [2019-11-28 10:03:38,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:38,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837520751] [2019-11-28 10:03:38,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-28 10:03:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:38,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 10:03:38,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:38,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:38,302 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:38,308 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:38,309 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:38,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:38,576 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:38,577 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:39,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837520751] [2019-11-28 10:03:39,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:39,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-28 10:03:39,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295872627] [2019-11-28 10:03:39,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-28 10:03:39,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:39,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-28 10:03:39,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-28 10:03:39,395 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand 23 states. [2019-11-28 10:03:41,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:41,465 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2019-11-28 10:03:41,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 10:03:41,466 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-28 10:03:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:41,467 INFO L225 Difference]: With dead ends: 127 [2019-11-28 10:03:41,467 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 10:03:41,468 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-28 10:03:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 10:03:41,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-28 10:03:41,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 10:03:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2019-11-28 10:03:41,473 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 53 [2019-11-28 10:03:41,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:41,474 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2019-11-28 10:03:41,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-28 10:03:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2019-11-28 10:03:41,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-28 10:03:41,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:41,478 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:41,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 10:03:41,680 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:41,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:41,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1487182461, now seen corresponding path program 1 times [2019-11-28 10:03:41,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:41,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284459323] [2019-11-28 10:03:41,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-28 10:03:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:41,863 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 10:03:41,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:41,892 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:41,892 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:42,014 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:42,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284459323] [2019-11-28 10:03:42,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:42,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-28 10:03:42,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348373868] [2019-11-28 10:03:42,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 10:03:42,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:42,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 10:03:42,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-28 10:03:42,016 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 8 states. [2019-11-28 10:03:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:42,063 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-11-28 10:03:42,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 10:03:42,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-11-28 10:03:42,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:42,066 INFO L225 Difference]: With dead ends: 129 [2019-11-28 10:03:42,066 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 10:03:42,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-28 10:03:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 10:03:42,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-28 10:03:42,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 10:03:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2019-11-28 10:03:42,071 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 58 [2019-11-28 10:03:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:42,071 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2019-11-28 10:03:42,072 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 10:03:42,072 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2019-11-28 10:03:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-28 10:03:42,073 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:42,073 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:42,278 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 10:03:42,278 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:42,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash -537222574, now seen corresponding path program 1 times [2019-11-28 10:03:42,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:42,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838637553] [2019-11-28 10:03:42,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-28 10:03:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:42,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 10:03:42,514 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:42,578 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:42,754 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:03:42,807 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:42,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838637553] [2019-11-28 10:03:42,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:42,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-28 10:03:42,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574760044] [2019-11-28 10:03:42,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 10:03:42,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:42,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 10:03:42,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:03:42,809 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand 11 states. [2019-11-28 10:03:42,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:42,901 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2019-11-28 10:03:42,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 10:03:42,902 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-28 10:03:42,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:42,903 INFO L225 Difference]: With dead ends: 131 [2019-11-28 10:03:42,903 INFO L226 Difference]: Without dead ends: 127 [2019-11-28 10:03:42,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-28 10:03:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-28 10:03:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-11-28 10:03:42,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-28 10:03:42,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 131 transitions. [2019-11-28 10:03:42,908 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 131 transitions. Word has length 63 [2019-11-28 10:03:42,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:42,909 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 131 transitions. [2019-11-28 10:03:42,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 10:03:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 131 transitions. [2019-11-28 10:03:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 10:03:42,910 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:42,910 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:43,113 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 10:03:43,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:43,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:43,114 INFO L82 PathProgramCache]: Analyzing trace with hash -964060479, now seen corresponding path program 1 times [2019-11-28 10:03:43,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:43,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1644545415] [2019-11-28 10:03:43,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-28 10:03:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:43,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 10:03:43,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:43,357 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:43,357 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:43,358 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:43,359 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:43,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:43,622 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:43,623 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:43,846 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:43,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1644545415] [2019-11-28 10:03:43,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:43,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16, 15] imperfect sequences [] total 16 [2019-11-28 10:03:43,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557836486] [2019-11-28 10:03:43,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-28 10:03:43,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:43,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-28 10:03:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-11-28 10:03:43,850 INFO L87 Difference]: Start difference. First operand 127 states and 131 transitions. Second operand 17 states. [2019-11-28 10:03:45,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:45,135 INFO L93 Difference]: Finished difference Result 178 states and 198 transitions. [2019-11-28 10:03:45,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 10:03:45,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 74 [2019-11-28 10:03:45,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:45,137 INFO L225 Difference]: With dead ends: 178 [2019-11-28 10:03:45,137 INFO L226 Difference]: Without dead ends: 178 [2019-11-28 10:03:45,138 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 127 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2019-11-28 10:03:45,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-28 10:03:45,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 154. [2019-11-28 10:03:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-28 10:03:45,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 166 transitions. [2019-11-28 10:03:45,146 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 166 transitions. Word has length 74 [2019-11-28 10:03:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:45,147 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 166 transitions. [2019-11-28 10:03:45,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-28 10:03:45,147 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 166 transitions. [2019-11-28 10:03:45,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-28 10:03:45,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:45,149 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:45,362 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 10:03:45,362 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:45,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:45,363 INFO L82 PathProgramCache]: Analyzing trace with hash -964060478, now seen corresponding path program 1 times [2019-11-28 10:03:45,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:45,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064109719] [2019-11-28 10:03:45,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-28 10:03:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:45,588 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-28 10:03:45,590 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:45,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:45,614 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:45,620 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:45,620 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:45,620 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:46,119 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:46,119 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:48,070 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:48,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064109719] [2019-11-28 10:03:48,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:48,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 16] imperfect sequences [] total 32 [2019-11-28 10:03:48,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773117561] [2019-11-28 10:03:48,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-28 10:03:48,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-28 10:03:48,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=965, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 10:03:48,073 INFO L87 Difference]: Start difference. First operand 154 states and 166 transitions. Second operand 33 states. [2019-11-28 10:03:51,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:51,527 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2019-11-28 10:03:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-28 10:03:51,528 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 74 [2019-11-28 10:03:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:51,529 INFO L225 Difference]: With dead ends: 152 [2019-11-28 10:03:51,530 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 10:03:51,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 112 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2019-11-28 10:03:51,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 10:03:51,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-28 10:03:51,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 10:03:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 162 transitions. [2019-11-28 10:03:51,542 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 162 transitions. Word has length 74 [2019-11-28 10:03:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:51,543 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 162 transitions. [2019-11-28 10:03:51,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-28 10:03:51,543 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2019-11-28 10:03:51,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-28 10:03:51,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:51,546 INFO L410 BasicCegarLoop]: trace histogram [16, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:51,758 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 10:03:51,758 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:51,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:51,759 INFO L82 PathProgramCache]: Analyzing trace with hash -770520951, now seen corresponding path program 1 times [2019-11-28 10:03:51,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:51,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363485145] [2019-11-28 10:03:51,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-28 10:03:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:51,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-28 10:03:51,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:52,080 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:52,081 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-11-28 10:03:52,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363485145] [2019-11-28 10:03:52,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 10:03:52,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 11 [2019-11-28 10:03:52,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825429406] [2019-11-28 10:03:52,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 10:03:52,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 10:03:52,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 10:03:52,357 INFO L87 Difference]: Start difference. First operand 152 states and 162 transitions. Second operand 10 states. [2019-11-28 10:03:52,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:52,449 INFO L93 Difference]: Finished difference Result 153 states and 159 transitions. [2019-11-28 10:03:52,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 10:03:52,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2019-11-28 10:03:52,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:52,451 INFO L225 Difference]: With dead ends: 153 [2019-11-28 10:03:52,451 INFO L226 Difference]: Without dead ends: 149 [2019-11-28 10:03:52,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-11-28 10:03:52,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-28 10:03:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2019-11-28 10:03:52,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-28 10:03:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 155 transitions. [2019-11-28 10:03:52,457 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 155 transitions. Word has length 77 [2019-11-28 10:03:52,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:52,458 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 155 transitions. [2019-11-28 10:03:52,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 10:03:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 155 transitions. [2019-11-28 10:03:52,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 10:03:52,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:52,459 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:52,671 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 10:03:52,675 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:52,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:52,675 INFO L82 PathProgramCache]: Analyzing trace with hash 810528448, now seen corresponding path program 1 times [2019-11-28 10:03:52,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:52,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382466440] [2019-11-28 10:03:52,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-28 10:03:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:52,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-28 10:03:52,936 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:52,939 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:52,939 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:52,940 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:52,941 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:52,941 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 10:03:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:53,258 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:53,493 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:53,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382466440] [2019-11-28 10:03:53,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:53,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20, 19] imperfect sequences [] total 20 [2019-11-28 10:03:53,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893684754] [2019-11-28 10:03:53,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 10:03:53,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:53,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 10:03:53,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-11-28 10:03:53,495 INFO L87 Difference]: Start difference. First operand 149 states and 155 transitions. Second operand 21 states. [2019-11-28 10:03:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:03:55,193 INFO L93 Difference]: Finished difference Result 180 states and 196 transitions. [2019-11-28 10:03:55,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 10:03:55,194 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 87 [2019-11-28 10:03:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:03:55,195 INFO L225 Difference]: With dead ends: 180 [2019-11-28 10:03:55,196 INFO L226 Difference]: Without dead ends: 180 [2019-11-28 10:03:55,196 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 145 SyntacticMatches, 9 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=664, Unknown=0, NotChecked=0, Total=756 [2019-11-28 10:03:55,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-11-28 10:03:55,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 155. [2019-11-28 10:03:55,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-11-28 10:03:55,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 165 transitions. [2019-11-28 10:03:55,204 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 165 transitions. Word has length 87 [2019-11-28 10:03:55,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:03:55,207 INFO L462 AbstractCegarLoop]: Abstraction has 155 states and 165 transitions. [2019-11-28 10:03:55,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 10:03:55,207 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 165 transitions. [2019-11-28 10:03:55,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-11-28 10:03:55,209 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:03:55,209 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:03:55,422 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-28 10:03:55,423 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:03:55,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:03:55,423 INFO L82 PathProgramCache]: Analyzing trace with hash 810528449, now seen corresponding path program 1 times [2019-11-28 10:03:55,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:03:55,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1812434071] [2019-11-28 10:03:55,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 22 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with mathsat -unsat_core_generation=3 [2019-11-28 10:03:55,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:03:55,680 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-28 10:03:55,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:03:55,689 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 10:03:55,690 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:03:55,698 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:03:55,698 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:03:55,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 10:03:56,270 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:56,270 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:03:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:03:58,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1812434071] [2019-11-28 10:03:58,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:03:58,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 20] imperfect sequences [] total 40 [2019-11-28 10:03:58,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312447880] [2019-11-28 10:03:58,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-28 10:03:58,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:03:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-28 10:03:58,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-11-28 10:03:58,690 INFO L87 Difference]: Start difference. First operand 155 states and 165 transitions. Second operand 41 states. [2019-11-28 10:04:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:03,090 INFO L93 Difference]: Finished difference Result 153 states and 162 transitions. [2019-11-28 10:04:03,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 10:04:03,090 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 87 [2019-11-28 10:04:03,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:03,091 INFO L225 Difference]: With dead ends: 153 [2019-11-28 10:04:03,092 INFO L226 Difference]: Without dead ends: 153 [2019-11-28 10:04:03,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 128 SyntacticMatches, 6 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=170, Invalid=2182, Unknown=0, NotChecked=0, Total=2352 [2019-11-28 10:04:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-28 10:04:03,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2019-11-28 10:04:03,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-28 10:04:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 162 transitions. [2019-11-28 10:04:03,098 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 162 transitions. Word has length 87 [2019-11-28 10:04:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:03,098 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 162 transitions. [2019-11-28 10:04:03,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-28 10:04:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 162 transitions. [2019-11-28 10:04:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-28 10:04:03,100 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:03,100 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:04:03,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 mathsat -unsat_core_generation=3 [2019-11-28 10:04:03,313 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:04:03,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:03,313 INFO L82 PathProgramCache]: Analyzing trace with hash 147123437, now seen corresponding path program 1 times [2019-11-28 10:04:03,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:03,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941243136] [2019-11-28 10:04:03,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 23 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with mathsat -unsat_core_generation=3 [2019-11-28 10:04:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:03,589 INFO L255 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-28 10:04:03,592 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:04:04,295 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:05,090 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-28 10:04:05,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941243136] [2019-11-28 10:04:05,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 10:04:05,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21, 19] imperfect sequences [] total 39 [2019-11-28 10:04:05,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955626464] [2019-11-28 10:04:05,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-28 10:04:05,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 10:04:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-28 10:04:05,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1410, Unknown=0, NotChecked=0, Total=1560 [2019-11-28 10:04:05,092 INFO L87 Difference]: Start difference. First operand 153 states and 162 transitions. Second operand 40 states. [2019-11-28 10:04:07,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 10:04:07,181 INFO L93 Difference]: Finished difference Result 152 states and 161 transitions. [2019-11-28 10:04:07,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-28 10:04:07,183 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 90 [2019-11-28 10:04:07,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 10:04:07,184 INFO L225 Difference]: With dead ends: 152 [2019-11-28 10:04:07,184 INFO L226 Difference]: Without dead ends: 152 [2019-11-28 10:04:07,185 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 136 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 491 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=206, Invalid=1956, Unknown=0, NotChecked=0, Total=2162 [2019-11-28 10:04:07,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-28 10:04:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2019-11-28 10:04:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-28 10:04:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 161 transitions. [2019-11-28 10:04:07,192 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 161 transitions. Word has length 90 [2019-11-28 10:04:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 10:04:07,192 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 161 transitions. [2019-11-28 10:04:07,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-28 10:04:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 161 transitions. [2019-11-28 10:04:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 10:04:07,194 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 10:04:07,194 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 10:04:07,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 mathsat -unsat_core_generation=3 [2019-11-28 10:04:07,407 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-28 10:04:07,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 10:04:07,407 INFO L82 PathProgramCache]: Analyzing trace with hash 2088002500, now seen corresponding path program 1 times [2019-11-28 10:04:07,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 10:04:07,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061371797] [2019-11-28 10:04:07,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 24 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with mathsat -unsat_core_generation=3 [2019-11-28 10:04:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 10:04:07,772 INFO L255 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-28 10:04:07,775 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 10:04:07,795 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-28 10:04:07,796 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:07,805 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:07,805 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:07,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-11-28 10:04:07,863 INFO L343 Elim1Store]: treesize reduction 34, result has 22.7 percent of original size [2019-11-28 10:04:07,864 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2019-11-28 10:04:07,864 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:07,890 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:07,891 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:07,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2019-11-28 10:04:07,994 INFO L343 Elim1Store]: treesize reduction 80, result has 20.8 percent of original size [2019-11-28 10:04:07,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 41 treesize of output 43 [2019-11-28 10:04:07,995 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,017 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:08,018 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-11-28 10:04:08,192 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 21 [2019-11-28 10:04:08,192 INFO L343 Elim1Store]: treesize reduction 141, result has 18.0 percent of original size [2019-11-28 10:04:08,193 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 58 [2019-11-28 10:04:08,193 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,222 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:08,222 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:58, output treesize:54 [2019-11-28 10:04:08,373 INFO L343 Elim1Store]: treesize reduction 172, result has 16.9 percent of original size [2019-11-28 10:04:08,373 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 66 [2019-11-28 10:04:08,374 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,405 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:08,406 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2019-11-28 10:04:08,604 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 28 [2019-11-28 10:04:08,604 INFO L343 Elim1Store]: treesize reduction 246, result has 15.2 percent of original size [2019-11-28 10:04:08,605 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 15 case distinctions, treesize of input 69 treesize of output 80 [2019-11-28 10:04:08,606 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,640 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:08,640 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,640 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:74, output treesize:70 [2019-11-28 10:04:08,877 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 33 [2019-11-28 10:04:08,878 INFO L343 Elim1Store]: treesize reduction 332, result has 13.8 percent of original size [2019-11-28 10:04:08,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 21 case distinctions, treesize of input 80 treesize of output 94 [2019-11-28 10:04:08,879 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,926 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:08,927 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:08,927 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:85, output treesize:81 [2019-11-28 10:04:09,284 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 38 [2019-11-28 10:04:09,285 INFO L343 Elim1Store]: treesize reduction 430, result has 12.6 percent of original size [2019-11-28 10:04:09,285 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 28 case distinctions, treesize of input 91 treesize of output 108 [2019-11-28 10:04:09,286 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:09,341 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:09,342 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:09,342 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:96, output treesize:92 [2019-11-28 10:04:09,775 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 200 DAG size of output: 43 [2019-11-28 10:04:09,776 INFO L343 Elim1Store]: treesize reduction 540, result has 11.6 percent of original size [2019-11-28 10:04:09,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 102 treesize of output 122 [2019-11-28 10:04:09,777 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:09,877 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:09,878 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:09,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:103 [2019-11-28 10:04:10,499 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 48 [2019-11-28 10:04:10,500 INFO L343 Elim1Store]: treesize reduction 662, result has 10.8 percent of original size [2019-11-28 10:04:10,500 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 45 case distinctions, treesize of input 113 treesize of output 136 [2019-11-28 10:04:10,502 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:10,572 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:10,573 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:10,573 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:118, output treesize:114 [2019-11-28 10:04:11,202 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 288 DAG size of output: 53 [2019-11-28 10:04:11,203 INFO L343 Elim1Store]: treesize reduction 796, result has 10.1 percent of original size [2019-11-28 10:04:11,203 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 55 case distinctions, treesize of input 124 treesize of output 150 [2019-11-28 10:04:11,204 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:11,282 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:11,283 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:11,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:129, output treesize:125 [2019-11-28 10:04:12,083 WARN L192 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 338 DAG size of output: 58 [2019-11-28 10:04:12,084 INFO L343 Elim1Store]: treesize reduction 942, result has 9.4 percent of original size [2019-11-28 10:04:12,085 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 66 case distinctions, treesize of input 135 treesize of output 164 [2019-11-28 10:04:12,087 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:12,198 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2019-11-28 10:04:12,199 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:12,199 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:12,199 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-11-28 10:04:13,171 WARN L192 SmtUtils]: Spent 725.00 ms on a formula simplification. DAG size of input: 392 DAG size of output: 63 [2019-11-28 10:04:13,172 INFO L343 Elim1Store]: treesize reduction 1100, result has 8.9 percent of original size [2019-11-28 10:04:13,172 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 0 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 78 case distinctions, treesize of input 146 treesize of output 178 [2019-11-28 10:04:13,173 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:13,270 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:13,270 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:13,270 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:151, output treesize:147 [2019-11-28 10:04:13,546 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 10:04:14,480 WARN L192 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 450 DAG size of output: 68 [2019-11-28 10:04:14,481 INFO L343 Elim1Store]: treesize reduction 1270, result has 8.4 percent of original size [2019-11-28 10:04:14,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 0 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 91 case distinctions, treesize of input 157 treesize of output 192 [2019-11-28 10:04:14,483 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:14,594 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 10:04:14,595 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:14,595 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:14,596 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:162, output treesize:158 [2019-11-28 10:04:14,873 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-11-28 10:04:15,958 WARN L192 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 512 DAG size of output: 73 [2019-11-28 10:04:15,960 INFO L343 Elim1Store]: treesize reduction 1452, result has 7.9 percent of original size [2019-11-28 10:04:15,960 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 14 select indices, 14 select index equivalence classes, 0 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 105 case distinctions, treesize of input 168 treesize of output 206 [2019-11-28 10:04:15,961 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:16,086 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 10:04:16,086 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:16,087 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:16,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:173, output treesize:169 [2019-11-28 10:04:16,400 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 10:04:17,653 WARN L192 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 578 DAG size of output: 78 [2019-11-28 10:04:17,654 INFO L343 Elim1Store]: treesize reduction 1646, result has 7.5 percent of original size [2019-11-28 10:04:17,655 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 15 select indices, 15 select index equivalence classes, 0 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 120 case distinctions, treesize of input 179 treesize of output 220 [2019-11-28 10:04:17,656 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:17,814 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 10:04:17,816 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:17,816 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:17,817 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:179, output treesize:175 [2019-11-28 10:04:18,220 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-28 10:04:21,351 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:04:21,395 INFO L588 ElimStorePlain]: treesize reduction 88, result has 32.3 percent of original size [2019-11-28 10:04:21,395 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:04:21,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:42 [2019-11-28 10:04:23,417 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_internal_#in~kobj.base|) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-28 10:04:25,428 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_DerPreprocessor_4 (_ BitVec 32)) (v_DerPreprocessor_2 (_ BitVec 32)) (v_DerPreprocessor_3 (_ BitVec 32)) (v_DerPreprocessor_1 (_ BitVec 32))) (= (store |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base| (let ((.cse0 (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |c_old(#memory_$Pointer$.offset)| |c_ldv_kobject_init_#in~kobj.base|) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_1) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_2) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_3) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_4) .cse0 .cse0) (bvadd |c_ldv_kobject_init_#in~kobj.offset| (_ bv8 32)) .cse0))) |c_#memory_$Pointer$.offset|)) is different from true [2019-11-28 10:04:25,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,476 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,500 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,524 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,530 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,539 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,546 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,554 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,555 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,556 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,558 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,565 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,567 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,569 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,570 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,571 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,582 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,584 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,587 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,588 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,589 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,591 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,593 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,600 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,603 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,604 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,606 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,608 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,609 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,610 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,611 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,612 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,614 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,615 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,618 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,621 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,625 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:25,627 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:25,627 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 16 select indices, 16 select index equivalence classes, 120 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 120 case distinctions, treesize of input 185 treesize of output 195 [2019-11-28 10:04:25,628 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:25,712 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:25,712 INFO L508 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:25,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:188, output treesize:114 [2019-11-28 10:04:29,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,267 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,269 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,270 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,285 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,294 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,296 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,297 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,299 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,300 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,301 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,303 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,304 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 10:04:29,309 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:29,309 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 120 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 135 treesize of output 123 [2019-11-28 10:04:29,310 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:29,345 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:29,345 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:29,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:92 [2019-11-28 10:04:31,187 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:31,187 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 66 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 66 case distinctions, treesize of input 94 treesize of output 42 [2019-11-28 10:04:31,188 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:04:31,190 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:04:31,190 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 10:04:31,190 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:94, output treesize:3 [2019-11-28 10:04:31,637 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 10:04:31,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 10:04:33,530 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:04:33,545 INFO L588 ElimStorePlain]: treesize reduction 83, result has 24.5 percent of original size [2019-11-28 10:04:33,545 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:04:33,545 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:59, output treesize:27 [2019-11-28 10:04:34,159 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:04:34,218 INFO L588 ElimStorePlain]: treesize reduction 82, result has 34.4 percent of original size [2019-11-28 10:04:34,218 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:04:34,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:43 [2019-11-28 10:06:48,124 WARN L192 SmtUtils]: Spent 2.17 m on a formula simplification that was a NOOP. DAG size: 152 [2019-11-28 10:06:48,446 WARN L192 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-28 10:06:49,932 WARN L192 SmtUtils]: Spent 1.49 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 10:06:51,278 WARN L192 SmtUtils]: Spent 1.35 s on a formula simplification that was a NOOP. DAG size: 63 [2019-11-28 10:06:51,905 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 10:06:52,100 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:06:52,312 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 10:06:52,491 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:06:52,592 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-28 10:07:10,647 WARN L192 SmtUtils]: Spent 18.05 s on a formula simplification that was a NOOP. DAG size: 108 [2019-11-28 10:07:15,254 WARN L192 SmtUtils]: Spent 4.61 s on a formula simplification that was a NOOP. DAG size: 74 [2019-11-28 10:07:20,600 WARN L192 SmtUtils]: Spent 5.35 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 10:07:25,684 WARN L192 SmtUtils]: Spent 5.08 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-28 10:07:26,794 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 10:07:26,957 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:07:27,193 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-28 10:07:27,361 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:07:27,461 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:07:27,472 INFO L588 ElimStorePlain]: treesize reduction 91, result has 31.1 percent of original size [2019-11-28 10:07:27,472 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:07:27,472 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:75, output treesize:41 [2019-11-28 10:07:28,542 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-28 10:07:28,716 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-28 10:07:28,824 INFO L508 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:07:28,900 INFO L588 ElimStorePlain]: treesize reduction 90, result has 37.9 percent of original size [2019-11-28 10:07:28,900 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 10:07:28,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:88, output treesize:55 [2019-11-28 10:07:29,470 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 10:07:29,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-11-28 10:07:29,495 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 10:07:29,525 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 10:07:29,726 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 mathsat -unsat_core_generation=3 [2019-11-28 10:07:29,727 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:505) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-28 10:07:29,735 INFO L168 Benchmark]: Toolchain (without parser) took 251643.08 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 562.6 MB). Free memory was 957.7 MB in the beginning and 1.2 GB in the end (delta: -247.1 MB). Peak memory consumption was 315.5 MB. Max. memory is 11.5 GB. [2019-11-28 10:07:29,736 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:07:29,736 INFO L168 Benchmark]: CACSL2BoogieTranslator took 860.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-28 10:07:29,736 INFO L168 Benchmark]: Boogie Preprocessor took 106.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 10:07:29,737 INFO L168 Benchmark]: RCFGBuilder took 1556.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. [2019-11-28 10:07:29,737 INFO L168 Benchmark]: TraceAbstraction took 249109.82 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.8 MB). Free memory was 990.2 MB in the beginning and 1.2 GB in the end (delta: -214.5 MB). Peak memory consumption was 202.3 MB. Max. memory is 11.5 GB. [2019-11-28 10:07:29,739 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.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 860.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.8 MB). Free memory was 957.7 MB in the beginning and 1.1 GB in the end (delta: -143.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1556.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 249109.82 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.8 MB). Free memory was 990.2 MB in the beginning and 1.2 GB in the end (delta: -214.5 MB). Peak memory consumption was 202.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: alternation not yet supported: (forall ((|v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2| (_ BitVec 32)) (|v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4| (_ BitVec 32))) (exists ((v_DerPreprocessor_18 (_ BitVec 32)) (v_DerPreprocessor_17 (_ BitVec 32)) (v_DerPreprocessor_19 (_ BitVec 32)) (v_DerPreprocessor_20 (_ BitVec 32))) (or (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)) (not (= (_ bv0 32) (select (select (store |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base| (let ((.cse0 (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv4 32)))) (store (store (store (store (store (store (select |old(#memory_$Pointer$.offset)| |ldv_kobject_init_internal_#in~kobj.base|) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv12 32)) v_DerPreprocessor_17) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv13 32)) v_DerPreprocessor_18) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv14 32)) v_DerPreprocessor_19) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv15 32)) v_DerPreprocessor_20) .cse0 .cse0) (bvadd |ldv_kobject_init_internal_#in~kobj.offset| (_ bv8 32)) .cse0))) |v_ldv_kobject_init_#in~kobj.base_BEFORE_CALL_4|) |v_ldv_kobject_init_#in~kobj.offset_BEFORE_CALL_2|)))))): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyNonSddEliminations(ElimStorePlain.java:689) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...