./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 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_test17_2-1.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 a95368535a8c20a6128f13edcb77bbb1dbe40e6b --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 12:21:17,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:21:17,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:21:17,977 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:21:17,978 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:21:17,979 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:21:17,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:21:17,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:21:17,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:21:17,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:21:17,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:21:17,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:21:17,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:21:17,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:21:17,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:21:17,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:21:17,995 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:21:17,996 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:21:18,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:21:18,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:21:18,008 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:21:18,014 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:21:18,015 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:21:18,016 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:21:18,022 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:21:18,022 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:21:18,022 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:21:18,025 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:21:18,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:21:18,027 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:21:18,029 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:21:18,030 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:21:18,031 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:21:18,032 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:21:18,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:21:18,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:21:18,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:21:18,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:21:18,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:21:18,040 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:21:18,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:21:18,043 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 12:21:18,063 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:21:18,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:21:18,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:21:18,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:21:18,066 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:21:18,067 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:21:18,067 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:21:18,067 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:21:18,068 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:21:18,068 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:21:18,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:21:18,070 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:21:18,070 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:21:18,070 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:21:18,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:21:18,071 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:21:18,071 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:18,071 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:21:18,072 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:21:18,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:21:18,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:21:18,073 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:21:18,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:21:18,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:21:18,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:21:18,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:21:18,074 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:21:18,075 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:21:18,075 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:21:18,075 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 -> a95368535a8c20a6128f13edcb77bbb1dbe40e6b Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 12:21:18,404 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:21:18,417 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:21:18,421 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:21:18,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:21:18,423 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:21:18,424 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2019-11-21 12:21:18,492 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b0e3ded/3d62cecd394e492887b55a205e96c4b0/FLAG2d68404bf [2019-11-21 12:21:19,044 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:21:19,045 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-1.i [2019-11-21 12:21:19,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b0e3ded/3d62cecd394e492887b55a205e96c4b0/FLAG2d68404bf [2019-11-21 12:21:19,272 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/17b0e3ded/3d62cecd394e492887b55a205e96c4b0 [2019-11-21 12:21:19,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:21:19,276 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:21:19,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:21:19,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:21:19,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:21:19,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f148de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:19, skipping insertion in model container [2019-11-21 12:21:19,286 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:21:19" (1/1) ... [2019-11-21 12:21:19,294 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:21:19,359 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:21:19,756 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,756 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 12:21:19,757 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,769 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,770 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 12:21:19,770 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,772 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,773 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 12:21:19,773 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,778 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,779 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 12:21:19,779 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,812 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,812 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 12:21:19,813 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,824 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,825 INFO L969 CHandler]: at location: C: (struct A17 *)ldv_malloc(sizeof(struct A17)) [766] [2019-11-21 12:21:19,825 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,831 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:21:19,832 INFO L969 CHandler]: at location: C: (struct A17 **)ldv_malloc(sizeof(struct A17*)*len) [785] [2019-11-21 12:21:19,832 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:21:19,837 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:21:19,860 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:21:19,883 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:21:19,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:21:20,007 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:21:20,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:21:20,202 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:21:20,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20 WrapperNode [2019-11-21 12:21:20,203 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:21:20,204 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:21:20,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:21:20,204 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:21:20,217 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (1/1) ... [2019-11-21 12:21:20,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (1/1) ... [2019-11-21 12:21:20,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (1/1) ... [2019-11-21 12:21:20,254 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (1/1) ... [2019-11-21 12:21:20,311 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (1/1) ... [2019-11-21 12:21:20,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (1/1) ... [2019-11-21 12:21:20,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (1/1) ... [2019-11-21 12:21:20,336 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:21:20,337 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:21:20,337 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:21:20,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:21:20,339 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (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-21 12:21:20,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:21:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:21:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:21:20,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:21:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:21:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 12:21:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 12:21:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 12:21:20,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 12:21:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 12:21:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 12:21:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 12:21:20,400 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:21:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 12:21:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 12:21:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 12:21:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 12:21:20,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 12:21:20,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 12:21:20,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 12:21:20,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 12:21:20,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 12:21:20,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 12:21:20,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 12:21:20,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 12:21:20,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 12:21:20,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 12:21:20,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 12:21:20,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 12:21:20,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 12:21:20,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 12:21:20,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 12:21:20,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 12:21:20,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 12:21:20,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 12:21:20,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 12:21:20,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 12:21:20,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 12:21:20,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 12:21:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 12:21:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 12:21:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_unsafe_17 [2019-11-21 12:21:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure free_17 [2019-11-21 12:21:20,407 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 12:21:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:21:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 12:21:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 12:21:20,408 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 12:21:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:21:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:21:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:21:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:21:20,409 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:21:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:21:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:21:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:21:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:21:20,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:21:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:21:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:21:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:21:20,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:21:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:21:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:21:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:21:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:21:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 12:21:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 12:21:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 12:21:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:21:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:21:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:21:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:21:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:21:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:21:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:21:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:21:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:21:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:21:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:21:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:21:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:21:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:21:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:21:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:21:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:21:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:21:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:21:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:21:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:21:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:21:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:21:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:21:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:21:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:21:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:21:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:21:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:21:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:21:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:21:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:21:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:21:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:21:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:21:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:21:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:21:20,420 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:21:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:21:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:21:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:21:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:21:20,421 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:21:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:21:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:21:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:21:20,422 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:21:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:21:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:21:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:21:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:21:20,423 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:21:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:21:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:21:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:21:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:21:20,424 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:21:20,425 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:21:20,425 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:21:20,425 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:21:20,425 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:21:20,425 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:21:20,426 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:21:20,426 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:21:20,426 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:21:20,426 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:21:20,426 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:21:20,426 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:21:20,427 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:21:20,427 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:21:20,427 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:21:20,427 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:21:20,427 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:21:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:21:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:21:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:21:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:21:20,428 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:21:20,429 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:21:20,429 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:21:20,429 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:21:20,429 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:21:20,429 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:21:20,429 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:21:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:21:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:21:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 12:21:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:21:20,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 12:21:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 12:21:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 12:21:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 12:21:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 12:21:20,431 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 12:21:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:21:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 12:21:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 12:21:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:21:20,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:21:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 12:21:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 12:21:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 12:21:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:21:20,433 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 12:21:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 12:21:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 12:21:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 12:21:20,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 12:21:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 12:21:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:21:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 12:21:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 12:21:20,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 12:21:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 12:21:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 12:21:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:21:20,436 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:21:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 12:21:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 12:21:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:21:20,437 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 12:21:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 12:21:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 12:21:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 12:21:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 12:21:20,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 12:21:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 12:21:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 12:21:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 12:21:20,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 12:21:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 12:21:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 12:21:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 12:21:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 12:21:20,440 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_unsafe_17 [2019-11-21 12:21:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure free_17 [2019-11-21 12:21:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 12:21:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:21:20,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:21:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:21:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:21:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:21:20,442 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 12:21:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 12:21:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 12:21:20,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 12:21:21,116 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:21:21,528 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:21:22,103 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:21:22,103 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-21 12:21:22,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:21:22 BoogieIcfgContainer [2019-11-21 12:21:22,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:21:22,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:21:22,107 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:21:22,111 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:21:22,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:21:19" (1/3) ... [2019-11-21 12:21:22,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428a31f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:21:22, skipping insertion in model container [2019-11-21 12:21:22,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:21:20" (2/3) ... [2019-11-21 12:21:22,114 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@428a31f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:21:22, skipping insertion in model container [2019-11-21 12:21:22,114 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:21:22" (3/3) ... [2019-11-21 12:21:22,116 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test17_2-1.i [2019-11-21 12:21:22,124 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:21:22,132 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 88 error locations. [2019-11-21 12:21:22,140 INFO L249 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2019-11-21 12:21:22,162 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:21:22,165 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:21:22,165 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:21:22,165 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:21:22,165 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:21:22,165 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:21:22,165 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:21:22,166 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:21:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states. [2019-11-21 12:21:22,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:21:22,204 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:22,205 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:22,206 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:22,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:22,212 INFO L82 PathProgramCache]: Analyzing trace with hash 643410278, now seen corresponding path program 1 times [2019-11-21 12:21:22,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:22,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [397361801] [2019-11-21 12:21:22,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:22,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:21:22,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:22,661 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-21 12:21:22,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:22,677 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:22,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:21:22,679 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:21:22,736 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-21 12:21:22,737 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:22,821 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-21 12:21:22,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [397361801] [2019-11-21 12:21:22,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:21:22,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 12:21:22,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007613993] [2019-11-21 12:21:22,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:21:22,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:22,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:21:22,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:21:22,864 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 5 states. [2019-11-21 12:21:23,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:23,196 INFO L93 Difference]: Finished difference Result 83 states and 94 transitions. [2019-11-21 12:21:23,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:21:23,199 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-21 12:21:23,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:23,216 INFO L225 Difference]: With dead ends: 83 [2019-11-21 12:21:23,216 INFO L226 Difference]: Without dead ends: 80 [2019-11-21 12:21:23,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:21:23,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-21 12:21:23,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 76. [2019-11-21 12:21:23,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-21 12:21:23,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2019-11-21 12:21:23,300 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 16 [2019-11-21 12:21:23,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:23,301 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2019-11-21 12:21:23,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:21:23,301 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2019-11-21 12:21:23,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:21:23,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:23,303 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:23,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:23,514 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 643410279, now seen corresponding path program 1 times [2019-11-21 12:21:23,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:23,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1137498853] [2019-11-21 12:21:23,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:23,830 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 12:21:23,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:23,868 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-21 12:21:23,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:23,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:23,876 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:21:23,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:21:23,951 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-21 12:21:23,951 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:24,852 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-21 12:21:24,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1137498853] [2019-11-21 12:21:24,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:21:24,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-21 12:21:24,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290131194] [2019-11-21 12:21:24,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:21:24,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:24,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:21:24,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:21:24,857 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 14 states. [2019-11-21 12:21:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:26,113 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2019-11-21 12:21:26,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:21:26,114 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-11-21 12:21:26,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:26,117 INFO L225 Difference]: With dead ends: 89 [2019-11-21 12:21:26,117 INFO L226 Difference]: Without dead ends: 89 [2019-11-21 12:21:26,118 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-21 12:21:26,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-21 12:21:26,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2019-11-21 12:21:26,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-21 12:21:26,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2019-11-21 12:21:26,132 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 16 [2019-11-21 12:21:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:26,132 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2019-11-21 12:21:26,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:21:26,132 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2019-11-21 12:21:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-21 12:21:26,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:26,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:26,334 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:26,335 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:26,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1530913959, now seen corresponding path program 1 times [2019-11-21 12:21:26,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:26,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1301468974] [2019-11-21 12:21:26,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:26,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:21:26,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:26,591 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-21 12:21:26,591 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:26,632 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-21 12:21:26,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1301468974] [2019-11-21 12:21:26,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:21:26,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:21:26,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577934188] [2019-11-21 12:21:26,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:21:26,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:26,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:21:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:21:26,635 INFO L87 Difference]: Start difference. First operand 81 states and 93 transitions. Second operand 5 states. [2019-11-21 12:21:26,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:26,683 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2019-11-21 12:21:26,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:21:26,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-21 12:21:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:26,685 INFO L225 Difference]: With dead ends: 80 [2019-11-21 12:21:26,686 INFO L226 Difference]: Without dead ends: 80 [2019-11-21 12:21:26,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:21:26,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-21 12:21:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-21 12:21:26,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-21 12:21:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2019-11-21 12:21:26,695 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 16 [2019-11-21 12:21:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:26,695 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2019-11-21 12:21:26,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:21:26,695 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2019-11-21 12:21:26,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 12:21:26,696 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:26,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:26,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:26,897 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1529128267, now seen corresponding path program 1 times [2019-11-21 12:21:26,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:26,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [867515403] [2019-11-21 12:21:26,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:27,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:21:27,115 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:27,137 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-21 12:21:27,137 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:27,235 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-21 12:21:27,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [867515403] [2019-11-21 12:21:27,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:21:27,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:21:27,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511846971] [2019-11-21 12:21:27,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:21:27,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:27,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:21:27,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:21:27,238 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 5 states. [2019-11-21 12:21:27,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:27,301 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2019-11-21 12:21:27,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:21:27,301 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-21 12:21:27,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:27,303 INFO L225 Difference]: With dead ends: 80 [2019-11-21 12:21:27,303 INFO L226 Difference]: Without dead ends: 80 [2019-11-21 12:21:27,304 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-21 12:21:27,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-21 12:21:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-11-21 12:21:27,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-11-21 12:21:27,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 86 transitions. [2019-11-21 12:21:27,313 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 86 transitions. Word has length 17 [2019-11-21 12:21:27,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:27,313 INFO L462 AbstractCegarLoop]: Abstraction has 78 states and 86 transitions. [2019-11-21 12:21:27,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:21:27,313 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 86 transitions. [2019-11-21 12:21:27,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 12:21:27,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:27,314 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:27,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:27,518 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:27,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:27,519 INFO L82 PathProgramCache]: Analyzing trace with hash 213682068, now seen corresponding path program 1 times [2019-11-21 12:21:27,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:27,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1789496659] [2019-11-21 12:21:27,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:27,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:21:27,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:27,740 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-21 12:21:27,741 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:27,799 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-21 12:21:27,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1789496659] [2019-11-21 12:21:27,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:21:27,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 12:21:27,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798282797] [2019-11-21 12:21:27,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 12:21:27,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:27,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 12:21:27,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 12:21:27,801 INFO L87 Difference]: Start difference. First operand 78 states and 86 transitions. Second operand 3 states. [2019-11-21 12:21:27,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:27,921 INFO L93 Difference]: Finished difference Result 115 states and 128 transitions. [2019-11-21 12:21:27,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 12:21:27,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-21 12:21:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:27,923 INFO L225 Difference]: With dead ends: 115 [2019-11-21 12:21:27,924 INFO L226 Difference]: Without dead ends: 110 [2019-11-21 12:21:27,924 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 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-21 12:21:27,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-21 12:21:27,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 76. [2019-11-21 12:21:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-21 12:21:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 83 transitions. [2019-11-21 12:21:27,933 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 83 transitions. Word has length 17 [2019-11-21 12:21:27,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:27,934 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 83 transitions. [2019-11-21 12:21:27,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 12:21:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 83 transitions. [2019-11-21 12:21:27,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 12:21:27,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:27,935 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:28,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:28,137 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:28,137 INFO L82 PathProgramCache]: Analyzing trace with hash 115925255, now seen corresponding path program 1 times [2019-11-21 12:21:28,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:28,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [98361778] [2019-11-21 12:21:28,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:28,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-21 12:21:28,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:28,441 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-21 12:21:28,442 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:28,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:28,449 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:21:28,449 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:21:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:28,573 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:29,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:21:29,833 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2019-11-21 12:21:30,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:30,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [98361778] [2019-11-21 12:21:30,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:21:30,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-11-21 12:21:30,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239004246] [2019-11-21 12:21:30,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-21 12:21:30,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:30,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-21 12:21:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-11-21 12:21:30,205 INFO L87 Difference]: Start difference. First operand 76 states and 83 transitions. Second operand 19 states. [2019-11-21 12:21:31,658 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-11-21 12:21:32,186 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 12:21:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:32,931 INFO L93 Difference]: Finished difference Result 93 states and 106 transitions. [2019-11-21 12:21:32,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 12:21:32,931 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2019-11-21 12:21:32,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:32,933 INFO L225 Difference]: With dead ends: 93 [2019-11-21 12:21:32,933 INFO L226 Difference]: Without dead ends: 93 [2019-11-21 12:21:32,934 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870 [2019-11-21 12:21:32,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-21 12:21:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2019-11-21 12:21:32,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-21 12:21:32,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2019-11-21 12:21:32,946 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 22 [2019-11-21 12:21:32,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:32,946 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2019-11-21 12:21:32,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-21 12:21:32,946 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2019-11-21 12:21:32,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-21 12:21:32,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:32,948 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:33,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:33,151 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:33,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:33,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1492536893, now seen corresponding path program 1 times [2019-11-21 12:21:33,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:33,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1118147689] [2019-11-21 12:21:33,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:33,443 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 12:21:33,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:33,501 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:33,502 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:33,635 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:33,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1118147689] [2019-11-21 12:21:33,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:21:33,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-11-21 12:21:33,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614634493] [2019-11-21 12:21:33,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:21:33,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:33,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:21:33,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:21:33,637 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand 12 states. [2019-11-21 12:21:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:34,017 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2019-11-21 12:21:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:21:34,018 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2019-11-21 12:21:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:34,019 INFO L225 Difference]: With dead ends: 94 [2019-11-21 12:21:34,019 INFO L226 Difference]: Without dead ends: 94 [2019-11-21 12:21:34,020 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:21:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-21 12:21:34,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-21 12:21:34,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-21 12:21:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2019-11-21 12:21:34,026 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 30 [2019-11-21 12:21:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:34,027 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2019-11-21 12:21:34,027 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:21:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2019-11-21 12:21:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-21 12:21:34,028 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:34,028 INFO L410 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:34,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:34,234 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:34,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:34,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1093707847, now seen corresponding path program 2 times [2019-11-21 12:21:34,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:34,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [115785881] [2019-11-21 12:21:34,236 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:34,572 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-21 12:21:34,572 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 12:21:34,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 12:21:34,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:34,599 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-21 12:21:34,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:34,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:34,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:21:34,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:21:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:34,868 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:37,065 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:37,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [115785881] [2019-11-21 12:21:37,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:21:37,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2019-11-21 12:21:37,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229469291] [2019-11-21 12:21:37,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-21 12:21:37,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:37,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-21 12:21:37,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2019-11-21 12:21:37,068 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand 26 states. [2019-11-21 12:21:40,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:40,138 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2019-11-21 12:21:40,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 12:21:40,144 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2019-11-21 12:21:40,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:40,145 INFO L225 Difference]: With dead ends: 104 [2019-11-21 12:21:40,146 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 12:21:40,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=291, Invalid=1349, Unknown=0, NotChecked=0, Total=1640 [2019-11-21 12:21:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 12:21:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2019-11-21 12:21:40,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 12:21:40,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-21 12:21:40,160 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 34 [2019-11-21 12:21:40,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:40,161 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-21 12:21:40,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-21 12:21:40,161 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-21 12:21:40,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-21 12:21:40,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:40,165 INFO L410 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:40,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:40,366 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:40,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:40,366 INFO L82 PathProgramCache]: Analyzing trace with hash 648183772, now seen corresponding path program 2 times [2019-11-21 12:21:40,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:40,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [361361791] [2019-11-21 12:21:40,367 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:40,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-21 12:21:40,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 12:21:40,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:21:40,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:40,656 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-21 12:21:40,656 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-21 12:21:40,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [361361791] [2019-11-21 12:21:40,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:21:40,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-21 12:21:40,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727623708] [2019-11-21 12:21:40,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:21:40,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:40,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:21:40,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:21:40,707 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 8 states. [2019-11-21 12:21:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:40,835 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2019-11-21 12:21:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:21:40,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 45 [2019-11-21 12:21:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:40,838 INFO L225 Difference]: With dead ends: 139 [2019-11-21 12:21:40,838 INFO L226 Difference]: Without dead ends: 139 [2019-11-21 12:21:40,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:21:40,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2019-11-21 12:21:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 107. [2019-11-21 12:21:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 12:21:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2019-11-21 12:21:40,845 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 45 [2019-11-21 12:21:40,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:40,845 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2019-11-21 12:21:40,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:21:40,845 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2019-11-21 12:21:40,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-21 12:21:40,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:40,847 INFO L410 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:41,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:41,051 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:41,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:41,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1010331769, now seen corresponding path program 3 times [2019-11-21 12:21:41,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:41,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [430208440] [2019-11-21 12:21:41,052 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:41,675 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-21 12:21:41,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 12:21:41,679 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-21 12:21:41,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:42,137 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:44,353 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:21:44,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [430208440] [2019-11-21 12:21:44,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:21:44,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2019-11-21 12:21:44,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34437677] [2019-11-21 12:21:44,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-21 12:21:44,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:44,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-21 12:21:44,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=1146, Unknown=0, NotChecked=0, Total=1406 [2019-11-21 12:21:44,356 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 38 states. [2019-11-21 12:21:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:21:45,561 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2019-11-21 12:21:45,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 12:21:45,561 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 46 [2019-11-21 12:21:45,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:21:45,562 INFO L225 Difference]: With dead ends: 104 [2019-11-21 12:21:45,562 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 12:21:45,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=285, Invalid=1197, Unknown=0, NotChecked=0, Total=1482 [2019-11-21 12:21:45,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 12:21:45,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 12:21:45,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 12:21:45,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-11-21 12:21:45,575 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 46 [2019-11-21 12:21:45,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:21:45,576 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-11-21 12:21:45,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-21 12:21:45,576 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-11-21 12:21:45,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 12:21:45,582 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:21:45,583 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:21:45,783 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:45,784 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:21:45,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:21:45,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1199700182, now seen corresponding path program 1 times [2019-11-21 12:21:45,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:21:45,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [974511126] [2019-11-21 12:21:45,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:21:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:21:46,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 12:21:46,253 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:21:46,258 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-21 12:21:46,259 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:46,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:46,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:21:46,261 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:21:46,354 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:21:46,354 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-21 12:21:46,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:21:46,374 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:21:46,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:21:46,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 12:21:46,407 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-21 12:21:46,408 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:21:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-11-21 12:21:50,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [974511126] [2019-11-21 12:21:50,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-21 12:21:50,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-11-21 12:21:50,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408468509] [2019-11-21 12:21:50,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:21:50,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:21:50,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:21:50,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2019-11-21 12:21:50,793 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 8 states. [2019-11-21 12:22:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:22:07,120 INFO L93 Difference]: Finished difference Result 170 states and 194 transitions. [2019-11-21 12:22:07,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:22:07,121 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 56 [2019-11-21 12:22:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:22:07,123 INFO L225 Difference]: With dead ends: 170 [2019-11-21 12:22:07,123 INFO L226 Difference]: Without dead ends: 170 [2019-11-21 12:22:07,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=83, Invalid=377, Unknown=2, NotChecked=0, Total=462 [2019-11-21 12:22:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-11-21 12:22:07,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 113. [2019-11-21 12:22:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-21 12:22:07,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 129 transitions. [2019-11-21 12:22:07,130 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 129 transitions. Word has length 56 [2019-11-21 12:22:07,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:22:07,130 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 129 transitions. [2019-11-21 12:22:07,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:22:07,131 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 129 transitions. [2019-11-21 12:22:07,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 12:22:07,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:22:07,131 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:22:07,343 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:07,344 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:22:07,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:22:07,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1199700183, now seen corresponding path program 1 times [2019-11-21 12:22:07,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:22:07,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2126194052] [2019-11-21 12:22:07,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:22:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:22:07,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 12:22:07,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:22:08,006 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-21 12:22:08,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:08,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:08,019 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-21 12:22:08,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:08,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:08,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:08,028 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-21 12:22:10,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:22:10,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2019-11-21 12:22:10,302 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,319 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:10,332 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:10,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 12:22:10,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:10,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:10,351 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2019-11-21 12:22:10,395 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-21 12:22:10,396 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:22:10,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:22:12,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:22:12,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:22:12,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:22:12,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:22:12,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:22:12,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:22:12,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:22:20,567 WARN L192 SmtUtils]: Spent 4.67 s on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-11-21 12:22:20,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:22:24,154 WARN L192 SmtUtils]: Spent 2.09 s on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-21 12:22:27,308 INFO L392 ElimStorePlain]: Different costs {1=[|v_#valid_250|], 2=[|v_#length_208|]} [2019-11-21 12:22:27,317 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 12:22:27,318 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:27,328 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:27,330 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:22:27,331 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:27,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:27,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:22:27,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:23, output treesize:5 [2019-11-21 12:22:27,985 INFO L392 ElimStorePlain]: Different costs {1=[|#valid|], 2=[|#length|]} [2019-11-21 12:22:27,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-21 12:22:27,999 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:28,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:28,019 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:22:28,020 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:22:28,037 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:22:28,038 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:22:28,038 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:33, output treesize:16 [2019-11-21 12:22:28,246 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-21 12:22:28,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2126194052] [2019-11-21 12:22:28,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 12:22:28,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2019-11-21 12:22:28,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990705548] [2019-11-21 12:22:28,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 12:22:28,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:22:28,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 12:22:28,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=406, Unknown=4, NotChecked=0, Total=462 [2019-11-21 12:22:28,248 INFO L87 Difference]: Start difference. First operand 113 states and 129 transitions. Second operand 22 states. [2019-11-21 12:22:34,486 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_unsafe_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2 (_ bv4 32))) (.cse1 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2))) (or (bvsle .cse0 (select |c_#length| v_alloc_unsafe_17_~array.base_BEFORE_CALL_4)) (not (bvsle .cse1 .cse0)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvsle (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_52) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4))))) (not (bvsle (_ bv0 32) .cse1)))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (exists ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1)))) is different from false [2019-11-21 12:22:50,961 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ldv_malloc_#t~malloc12.base_45| (_ BitVec 32)) (v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (ldv_malloc_~size (_ BitVec 32)) (v_alloc_unsafe_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2 (_ bv4 32))) (.cse1 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2))) (or (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_45|) (_ bv0 1))) (bvsle .cse0 (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_45| ldv_malloc_~size) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4)) (not (bvsle .cse1 .cse0)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvsle (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_52) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4))))) (not (bvsle (_ bv0 32) .cse1)))))) (= c_ldv_malloc_~size |c_ldv_malloc_#in~size|) (= (_ bv0 32) |c_ldv_malloc_#res.offset|) (= (bvadd (select |c_#valid| |c_ldv_malloc_#res.base|) (_ bv1 1)) (_ bv0 1)) (forall ((v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_unsafe_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse5 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse3 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse5 (_ bv4 32))) (.cse4 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse5))) (or (bvsle .cse3 (select |c_#length| v_alloc_unsafe_17_~array.base_BEFORE_CALL_4)) (not (bvsle .cse4 .cse3)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvsle (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_52) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4))))) (not (bvsle (_ bv0 32) .cse4)))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (select |c_#length| |c_ldv_malloc_#res.base|) |c_ldv_malloc_#in~size|) (exists ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1)))) is different from false [2019-11-21 12:23:09,641 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 25 [2019-11-21 12:23:20,164 WARN L838 $PredicateComparison]: unable to prove that (and (= (bvadd (select |c_#length| c_entry_point_~array~0.base) (_ bv4294967256 32)) (_ bv0 32)) (forall ((v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_unsafe_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2 (_ bv4 32))) (.cse1 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2))) (or (bvsle .cse0 (select |c_#length| v_alloc_unsafe_17_~array.base_BEFORE_CALL_4)) (not (bvsle .cse1 .cse0)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvsle (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_52) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4))))) (not (bvsle (_ bv0 32) .cse1)))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= (bvadd (select |c_#valid| c_entry_point_~array~0.base) (_ bv1 1)) (_ bv0 1)) (= (bvadd c_entry_point_~len~0 (_ bv4294967286 32)) (_ bv0 32)) (exists ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1))) (= (_ bv0 32) c_entry_point_~array~0.offset)) is different from false [2019-11-21 12:24:19,907 WARN L192 SmtUtils]: Spent 26.33 s on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-21 12:24:33,063 WARN L192 SmtUtils]: Spent 8.22 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2019-11-21 12:25:06,970 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_unsafe_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2 (_ bv4 32))) (.cse1 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2))) (or (bvsle .cse0 (select |c_#length| v_alloc_unsafe_17_~array.base_BEFORE_CALL_4)) (not (bvsle .cse1 .cse0)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvsle (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_52) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4))))) (not (bvsle (_ bv0 32) .cse1)))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1))) (= |c_old(#length)| |c_#length|)) is different from false [2019-11-21 12:25:56,622 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-21 12:26:13,297 WARN L192 SmtUtils]: Spent 8.28 s on a formula simplification. DAG size of input: 67 DAG size of output: 38 [2019-11-21 12:26:26,773 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 25 [2019-11-21 12:26:27,237 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 26 [2019-11-21 12:26:54,105 WARN L192 SmtUtils]: Spent 15.55 s on a formula simplification. DAG size of input: 65 DAG size of output: 36 [2019-11-21 12:27:24,904 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse8 (bvmul c_alloc_unsafe_17_~i~0 (_ bv4 32)))) (let ((.cse3 (bvadd c_alloc_unsafe_17_~array.offset .cse8 (_ bv4 32))) (.cse7 (bvadd c_alloc_unsafe_17_~array.offset .cse8))) (let ((.cse5 (bvsle (_ bv0 32) .cse7)) (.cse6 (forall ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32))) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1))))) (.cse4 (bvsle .cse7 .cse3))) (and (forall ((v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_unsafe_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2 (_ bv4 32))) (.cse1 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2))) (or (bvsle .cse0 (select |c_#length| v_alloc_unsafe_17_~array.base_BEFORE_CALL_4)) (not (bvsle .cse1 .cse0)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvsle (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_52) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4))))) (not (bvsle (_ bv0 32) .cse1)))))) (= |c_#valid| |c_old(#valid)|) (bvsle .cse3 (select |c_#length| c_alloc_unsafe_17_~array.base)) (exists ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1))) .cse4 (or .cse5 .cse6) (= (_ bv1 1) (select |c_#valid| |c_alloc_unsafe_17_#in~array.base|)) (forall ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (or (bvsle (bvadd c_alloc_unsafe_17_~array.offset (bvmul c_alloc_unsafe_17_~i~0 (_ bv4 32)) (_ bv4 32)) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_44| v_ldv_malloc_~size_52) c_alloc_unsafe_17_~array.base)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) .cse5 (or .cse6 .cse4) (= (bvadd (select |c_#length| |c_alloc_unsafe_17_#in~array.base|) (_ bv4294967256 32)) (_ bv0 32)) (= |c_old(#length)| |c_#length|) (= (_ bv0 32) |c_alloc_unsafe_17_#in~array.offset|))))) is different from false [2019-11-21 12:27:27,038 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (_ BitVec 32)) (v_alloc_unsafe_17_~array.base_BEFORE_CALL_4 (_ BitVec 32)) (v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ BitVec 32))) (let ((.cse2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)))) (let ((.cse0 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2 (_ bv4 32))) (.cse1 (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 .cse2))) (or (bvsle .cse0 (select |c_#length| v_alloc_unsafe_17_~array.base_BEFORE_CALL_4)) (not (bvsle .cse1 .cse0)) (exists ((v_prenex_11 (_ BitVec 32)) (v_ldv_malloc_~size_52 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_11)) (not (bvsle (bvadd v_alloc_unsafe_17_~array.offset_BEFORE_CALL_2 (bvmul v_alloc_unsafe_17_~i~0_BEFORE_CALL_2 (_ bv4 32)) (_ bv4 32)) (select (store |c_old(#length)| v_prenex_11 v_ldv_malloc_~size_52) v_alloc_unsafe_17_~array.base_BEFORE_CALL_4))))) (not (bvsle (_ bv0 32) .cse1)))))) (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|)) (= (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size) |c_#length|))) (= |c_#valid| |c_old(#valid)|) (exists ((|v_ldv_malloc_#t~malloc12.base_44| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_44|) (_ bv0 1))) (= (bvadd (select |c_#length| |c_alloc_unsafe_17_#in~array.base|) (_ bv4294967256 32)) (_ bv0 32)) (= |c_old(#length)| |c_#length|) (= (_ bv0 32) |c_alloc_unsafe_17_#in~array.offset|) (= (_ bv1 1) (select |c_#valid| |c_alloc_unsafe_17_#in~array.base|))) is different from false [2019-11-21 12:27:34,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:34,775 INFO L93 Difference]: Finished difference Result 284 states and 336 transitions. [2019-11-21 12:27:34,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-21 12:27:34,777 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 56 [2019-11-21 12:27:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:34,780 INFO L225 Difference]: With dead ends: 284 [2019-11-21 12:27:34,780 INFO L226 Difference]: Without dead ends: 284 [2019-11-21 12:27:34,781 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 89 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 174.9s TimeCoverageRelationStatistics Valid=183, Invalid=1069, Unknown=32, NotChecked=438, Total=1722 [2019-11-21 12:27:34,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-11-21 12:27:34,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 144. [2019-11-21 12:27:34,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-21 12:27:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 175 transitions. [2019-11-21 12:27:34,789 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 175 transitions. Word has length 56 [2019-11-21 12:27:34,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:34,791 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 175 transitions. [2019-11-21 12:27:34,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 12:27:34,791 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 175 transitions. [2019-11-21 12:27:34,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-21 12:27:34,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:34,792 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:34,997 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:34,998 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:27:34,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:34,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1860597250, now seen corresponding path program 1 times [2019-11-21 12:27:34,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:35,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1592037908] [2019-11-21 12:27:35,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:35,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:35,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:27:35,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:35,314 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-21 12:27:35,314 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-11-21 12:27:35,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1592037908] [2019-11-21 12:27:35,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:35,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:27:35,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466007080] [2019-11-21 12:27:35,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:27:35,354 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:35,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:27:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:27:35,355 INFO L87 Difference]: Start difference. First operand 144 states and 175 transitions. Second operand 5 states. [2019-11-21 12:27:35,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:35,408 INFO L93 Difference]: Finished difference Result 171 states and 205 transitions. [2019-11-21 12:27:35,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 12:27:35,409 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-11-21 12:27:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:35,412 INFO L225 Difference]: With dead ends: 171 [2019-11-21 12:27:35,412 INFO L226 Difference]: Without dead ends: 171 [2019-11-21 12:27:35,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:27:35,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-11-21 12:27:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2019-11-21 12:27:35,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-21 12:27:35,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 175 transitions. [2019-11-21 12:27:35,420 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 175 transitions. Word has length 58 [2019-11-21 12:27:35,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:35,421 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 175 transitions. [2019-11-21 12:27:35,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:27:35,421 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 175 transitions. [2019-11-21 12:27:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-21 12:27:35,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:35,422 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:35,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:35,626 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:27:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:35,627 INFO L82 PathProgramCache]: Analyzing trace with hash -691559711, now seen corresponding path program 1 times [2019-11-21 12:27:35,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:35,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [881427447] [2019-11-21 12:27:35,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:36,063 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 12:27:36,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:36,076 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-11-21 12:27:36,077 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:36,104 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-11-21 12:27:36,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [881427447] [2019-11-21 12:27:36,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:36,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-21 12:27:36,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875348376] [2019-11-21 12:27:36,106 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:27:36,106 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:36,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:27:36,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:27:36,106 INFO L87 Difference]: Start difference. First operand 146 states and 175 transitions. Second operand 6 states. [2019-11-21 12:27:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:36,179 INFO L93 Difference]: Finished difference Result 151 states and 180 transitions. [2019-11-21 12:27:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:27:36,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-21 12:27:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:36,182 INFO L225 Difference]: With dead ends: 151 [2019-11-21 12:27:36,182 INFO L226 Difference]: Without dead ends: 151 [2019-11-21 12:27:36,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-21 12:27:36,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-21 12:27:36,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2019-11-21 12:27:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-11-21 12:27:36,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 177 transitions. [2019-11-21 12:27:36,189 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 177 transitions. Word has length 58 [2019-11-21 12:27:36,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:36,190 INFO L462 AbstractCegarLoop]: Abstraction has 148 states and 177 transitions. [2019-11-21 12:27:36,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:27:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 177 transitions. [2019-11-21 12:27:36,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-21 12:27:36,191 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:36,191 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 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] [2019-11-21 12:27:36,400 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:36,400 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, alloc_unsafe_17Err3REQUIRES_VIOLATION, alloc_unsafe_17Err6ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err2REQUIRES_VIOLATION, alloc_unsafe_17Err0REQUIRES_VIOLATION, alloc_unsafe_17Err4ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err5ASSERT_VIOLATIONMEMORY_FREE, alloc_unsafe_17Err1REQUIRES_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, free_17Err1REQUIRES_VIOLATION, free_17Err3ASSERT_VIOLATIONMEMORY_FREE, free_17Err0REQUIRES_VIOLATION, free_17Err2ASSERT_VIOLATIONMEMORY_FREE, free_17Err4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr4ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 12:27:36,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:36,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1753615753, now seen corresponding path program 1 times [2019-11-21 12:27:36,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:36,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [399004318] [2019-11-21 12:27:36,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:36,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:36,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 12:27:36,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:36,822 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-21 12:27:36,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:36,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:36,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:36,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:27:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2019-11-21 12:27:36,899 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:37,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:37,196 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) 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.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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-21 12:27:37,202 INFO L168 Benchmark]: Toolchain (without parser) took 377926.03 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 294.6 MB). Free memory was 945.6 MB in the beginning and 1.1 GB in the end (delta: -197.2 MB). Peak memory consumption was 97.5 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:37,202 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:27:37,203 INFO L168 Benchmark]: CACSL2BoogieTranslator took 926.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -94.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:37,203 INFO L168 Benchmark]: Boogie Preprocessor took 133.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:37,204 INFO L168 Benchmark]: RCFGBuilder took 1768.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 915.3 MB in the end (delta: 117.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:37,204 INFO L168 Benchmark]: TraceAbstraction took 375093.50 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 207.1 MB). Free memory was 915.3 MB in the beginning and 1.1 GB in the end (delta: -227.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:27:37,208 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 926.25 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 945.6 MB in the beginning and 1.0 GB in the end (delta: -94.1 MB). Peak memory consumption was 15.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.09 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1768.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 915.3 MB in the end (delta: 117.4 MB). Peak memory consumption was 117.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 375093.50 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 207.1 MB). Free memory was 915.3 MB in the beginning and 1.1 GB in the end (delta: -227.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...