./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 64bit -------------------------------------------------------------------------------- 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_test6_2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 72845188532fe6d4486465eb4d1c3f34d4b417b7 --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 11:18:31,977 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:18:31,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:18:31,999 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:18:32,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:18:32,002 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:18:32,004 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:18:32,014 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:18:32,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:18:32,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:18:32,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:18:32,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:18:32,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:18:32,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:18:32,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:18:32,033 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:18:32,034 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:18:32,035 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:18:32,038 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:18:32,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:18:32,046 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:18:32,050 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:18:32,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:18:32,054 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:18:32,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:18:32,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:18:32,059 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:18:32,061 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:18:32,061 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:18:32,062 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:18:32,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:18:32,063 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:18:32,064 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:18:32,066 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:18:32,067 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:18:32,068 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:18:32,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:18:32,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:18:32,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:18:32,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:18:32,072 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:18:32,073 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-21 11:18:32,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:18:32,097 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:18:32,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:18:32,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:18:32,100 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:18:32,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:18:32,103 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:18:32,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:18:32,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:18:32,104 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:18:32,104 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:18:32,104 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:18:32,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:18:32,105 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:18:32,105 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:18:32,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:18:32,105 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:18:32,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:18:32,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:18:32,106 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:18:32,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:18:32,106 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:18:32,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:18:32,107 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:18:32,107 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:18:32,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:18:32,108 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 72845188532fe6d4486465eb4d1c3f34d4b417b7 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 11:18:32,405 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:18:32,418 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:18:32,422 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:18:32,423 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:18:32,424 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:18:32,425 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-11-21 11:18:32,504 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d97e555/c11858f358444037974da669fad2cb59/FLAG1f36ab101 [2019-11-21 11:18:33,056 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:18:33,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test6_2.i [2019-11-21 11:18:33,081 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d97e555/c11858f358444037974da669fad2cb59/FLAG1f36ab101 [2019-11-21 11:18:33,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/05d97e555/c11858f358444037974da669fad2cb59 [2019-11-21 11:18:33,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:18:33,346 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:18:33,347 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:18:33,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:18:33,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:18:33,351 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:18:33" (1/1) ... [2019-11-21 11:18:33,354 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32b529ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:33, skipping insertion in model container [2019-11-21 11:18:33,354 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:18:33" (1/1) ... [2019-11-21 11:18:33,361 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:18:33,433 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:18:33,917 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 11:18:33,918 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 11:18:33,918 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:18:33,933 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 11:18:33,934 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 11:18:33,934 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:18:33,936 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 11:18:33,937 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 11:18:33,937 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:18:33,942 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 11:18:33,943 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 11:18:33,943 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:18:33,973 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 11:18:33,974 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 11:18:33,974 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:18:33,993 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 11:18:33,994 INFO L969 CHandler]: at location: C: (int *)ldv_malloc(sizeof(int)) [766] [2019-11-21 11:18:33,994 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:18:34,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:18:34,048 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:18:34,070 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:18:34,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:18:34,131 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:18:34,186 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:18:34,278 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:18:34,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34 WrapperNode [2019-11-21 11:18:34,279 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:18:34,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:18:34,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:18:34,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:18:34,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (1/1) ... [2019-11-21 11:18:34,292 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (1/1) ... [2019-11-21 11:18:34,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (1/1) ... [2019-11-21 11:18:34,319 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (1/1) ... [2019-11-21 11:18:34,355 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (1/1) ... [2019-11-21 11:18:34,362 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (1/1) ... [2019-11-21 11:18:34,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (1/1) ... [2019-11-21 11:18:34,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:18:34,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:18:34,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:18:34,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:18:34,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (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 11:18:34,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:18:34,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:18:34,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 11:18:34,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:18:34,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:18:34,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 11:18:34,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 11:18:34,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 11:18:34,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 11:18:34,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 11:18:34,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 11:18:34,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 11:18:34,455 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 11:18:34,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 11:18:34,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 11:18:34,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 11:18:34,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 11:18:34,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 11:18:34,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 11:18:34,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 11:18:34,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 11:18:34,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 11:18:34,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 11:18:34,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 11:18:34,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 11:18:34,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 11:18:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 11:18:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 11:18:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 11:18:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 11:18:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 11:18:34,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 11:18:34,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 11:18:34,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 11:18:34,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 11:18:34,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 11:18:34,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 11:18:34,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 11:18:34,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 11:18:34,462 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 11:18:34,462 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 11:18:34,462 INFO L138 BoogieDeclarations]: Found implementation of procedure f6 [2019-11-21 11:18:34,462 INFO L138 BoogieDeclarations]: Found implementation of procedure g6 [2019-11-21 11:18:34,463 INFO L138 BoogieDeclarations]: Found implementation of procedure probe3_6 [2019-11-21 11:18:34,463 INFO L138 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2019-11-21 11:18:34,463 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 11:18:34,463 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:18:34,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 11:18:34,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 11:18:34,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 11:18:34,464 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:18:34,464 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:18:34,464 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:18:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:18:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:18:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:18:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:18:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:18:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:18:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:18:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:18:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:18:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:18:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:18:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:18:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:18:34,467 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:18:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:18:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 11:18:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 11:18:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 11:18:34,468 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:18:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:18:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:18:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:18:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:18:34,469 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:18:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:18:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:18:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:18:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:18:34,470 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:18:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:18:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:18:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:18:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:18:34,471 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:18:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:18:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:18:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:18:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:18:34,472 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:18:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:18:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:18:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:18:34,473 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:18:34,474 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:18:34,474 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:18:34,474 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:18:34,474 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:18:34,474 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:18:34,475 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:18:34,475 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:18:34,475 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:18:34,475 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:18:34,475 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:18:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:18:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:18:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:18:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:18:34,476 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:18:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:18:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:18:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:18:34,477 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:18:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:18:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:18:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:18:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:18:34,478 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:18:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:18:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:18:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:18:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:18:34,479 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:18:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:18:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:18:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:18:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:18:34,480 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:18:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:18:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:18:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:18:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:18:34,481 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:18:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:18:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:18:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:18:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:18:34,482 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:18:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:18:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:18:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:18:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:18:34,483 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:18:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:18:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:18:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:18:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:18:34,484 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:18:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:18:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:18:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:18:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:18:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:18:34,485 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:18:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:18:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 11:18:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 11:18:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 11:18:34,486 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 11:18:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 11:18:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 11:18:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 11:18:34,487 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 11:18:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:18:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 11:18:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 11:18:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 11:18:34,488 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:18:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 11:18:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 11:18:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 11:18:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:18:34,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 11:18:34,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 11:18:34,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 11:18:34,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 11:18:34,490 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 11:18:34,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 11:18:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:18:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 11:18:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 11:18:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 11:18:34,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 11:18:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 11:18:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:18:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:18:34,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 11:18:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 11:18:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 11:18:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 11:18:34,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 11:18:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 11:18:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 11:18:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 11:18:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 11:18:34,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 11:18:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 11:18:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 11:18:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 11:18:34,495 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 11:18:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 11:18:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 11:18:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 11:18:34,496 INFO L130 BoogieDeclarations]: Found specification of procedure f6 [2019-11-21 11:18:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure g6 [2019-11-21 11:18:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure probe3_6 [2019-11-21 11:18:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure disconnect_6 [2019-11-21 11:18:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 11:18:34,497 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:18:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:18:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:18:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 11:18:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:18:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 11:18:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 11:18:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 11:18:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 11:18:35,263 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 11:18:35,680 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 11:18:36,102 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:18:36,103 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-21 11:18:36,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:18:36 BoogieIcfgContainer [2019-11-21 11:18:36,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:18:36,106 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:18:36,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:18:36,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:18:36,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:18:33" (1/3) ... [2019-11-21 11:18:36,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f41523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:18:36, skipping insertion in model container [2019-11-21 11:18:36,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:18:34" (2/3) ... [2019-11-21 11:18:36,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24f41523 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:18:36, skipping insertion in model container [2019-11-21 11:18:36,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:18:36" (3/3) ... [2019-11-21 11:18:36,114 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2.i [2019-11-21 11:18:36,124 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:18:36,133 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 86 error locations. [2019-11-21 11:18:36,145 INFO L249 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2019-11-21 11:18:36,167 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:18:36,167 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:18:36,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:18:36,167 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:18:36,168 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:18:36,168 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:18:36,168 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:18:36,168 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:18:36,190 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states. [2019-11-21 11:18:36,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:18:36,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:36,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:36,203 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:36,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:36,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1197645573, now seen corresponding path program 1 times [2019-11-21 11:18:36,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:36,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1946334233] [2019-11-21 11:18:36,223 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 11:18:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:36,542 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:18:36,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:36,612 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 11:18:36,612 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:36,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 11:18:36,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1946334233] [2019-11-21 11:18:36,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:36,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 11:18:36,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709723307] [2019-11-21 11:18:36,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:18:36,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:36,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:18:36,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:18:36,766 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 5 states. [2019-11-21 11:18:36,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:36,909 INFO L93 Difference]: Finished difference Result 94 states and 104 transitions. [2019-11-21 11:18:36,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:18:36,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-21 11:18:36,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:36,931 INFO L225 Difference]: With dead ends: 94 [2019-11-21 11:18:36,931 INFO L226 Difference]: Without dead ends: 91 [2019-11-21 11:18:36,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:18:36,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-21 11:18:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-11-21 11:18:37,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-21 11:18:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-21 11:18:37,027 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 20 [2019-11-21 11:18:37,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:37,028 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-21 11:18:37,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:18:37,029 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-21 11:18:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:18:37,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:37,031 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:37,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:37,236 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:37,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:37,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1001132068, now seen corresponding path program 1 times [2019-11-21 11:18:37,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:37,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1405917599] [2019-11-21 11:18:37,239 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 11:18:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:37,541 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 11:18:37,544 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:37,610 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:37,611 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 11:18:37,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:37,645 INFO L567 ElimStorePlain]: treesize reduction 10, result has 64.3 percent of original size [2019-11-21 11:18:37,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:18:37,646 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2019-11-21 11:18:37,671 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 5 treesize of output 3 [2019-11-21 11:18:37,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:37,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:37,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:18:37,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-21 11:18:37,697 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 11:18:37,697 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:37,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:18:37,887 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 8 treesize of output 6 [2019-11-21 11:18:37,888 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:18:37,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:37,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:18:37,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2019-11-21 11:18:37,998 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 11:18:37,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1405917599] [2019-11-21 11:18:37,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:37,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-21 11:18:37,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129185867] [2019-11-21 11:18:38,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 11:18:38,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:38,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 11:18:38,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:18:38,002 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2019-11-21 11:18:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:38,407 INFO L93 Difference]: Finished difference Result 120 states and 126 transitions. [2019-11-21 11:18:38,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:18:38,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-21 11:18:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:38,413 INFO L225 Difference]: With dead ends: 120 [2019-11-21 11:18:38,413 INFO L226 Difference]: Without dead ends: 120 [2019-11-21 11:18:38,414 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-21 11:18:38,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-21 11:18:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2019-11-21 11:18:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-21 11:18:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2019-11-21 11:18:38,431 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 20 [2019-11-21 11:18:38,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:38,432 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2019-11-21 11:18:38,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 11:18:38,432 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2019-11-21 11:18:38,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:18:38,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:38,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:38,636 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:38,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1001132067, now seen corresponding path program 1 times [2019-11-21 11:18:38,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:38,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1807329917] [2019-11-21 11:18:38,642 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 11:18:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:38,901 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 11:18:38,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:38,957 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:18:38,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 11:18:38,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:38,986 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-21 11:18:38,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:38,988 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 11:18:38,989 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-11-21 11:18:38,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:39,011 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 5 treesize of output 3 [2019-11-21 11:18:39,012 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:39,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:39,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:18:39,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 11:18:39,023 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 11:18:39,024 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:39,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:39,099 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 6 treesize of output 4 [2019-11-21 11:18:39,099 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:39,107 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:39,108 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:18:39,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-21 11:18:39,132 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 11:18:39,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1807329917] [2019-11-21 11:18:39,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:39,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-21 11:18:39,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146212057] [2019-11-21 11:18:39,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:18:39,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:39,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:18:39,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:18:39,139 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand 5 states. [2019-11-21 11:18:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:39,329 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2019-11-21 11:18:39,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:18:39,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-11-21 11:18:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:39,333 INFO L225 Difference]: With dead ends: 129 [2019-11-21 11:18:39,334 INFO L226 Difference]: Without dead ends: 125 [2019-11-21 11:18:39,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:18:39,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-21 11:18:39,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 106. [2019-11-21 11:18:39,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 11:18:39,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2019-11-21 11:18:39,347 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 20 [2019-11-21 11:18:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:39,347 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2019-11-21 11:18:39,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:18:39,347 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2019-11-21 11:18:39,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:18:39,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:39,348 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:39,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:39,552 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:39,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:39,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1183679111, now seen corresponding path program 1 times [2019-11-21 11:18:39,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:39,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1353384088] [2019-11-21 11:18:39,554 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 11:18:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:39,770 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:18:39,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:39,796 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 11:18:39,797 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:39,847 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 11:18:39,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1353384088] [2019-11-21 11:18:39,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:39,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 11:18:39,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112888335] [2019-11-21 11:18:39,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:18:39,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:39,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:18:39,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:18:39,850 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 5 states. [2019-11-21 11:18:39,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:39,896 INFO L93 Difference]: Finished difference Result 104 states and 123 transitions. [2019-11-21 11:18:39,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:18:39,897 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 11:18:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:39,898 INFO L225 Difference]: With dead ends: 104 [2019-11-21 11:18:39,898 INFO L226 Difference]: Without dead ends: 104 [2019-11-21 11:18:39,900 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:18:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-21 11:18:39,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-11-21 11:18:39,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-21 11:18:39,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 123 transitions. [2019-11-21 11:18:39,921 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 123 transitions. Word has length 22 [2019-11-21 11:18:39,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:39,921 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 123 transitions. [2019-11-21 11:18:39,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:18:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 123 transitions. [2019-11-21 11:18:39,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 11:18:39,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:39,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:40,125 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:40,126 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:40,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:40,126 INFO L82 PathProgramCache]: Analyzing trace with hash 15252322, now seen corresponding path program 1 times [2019-11-21 11:18:40,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:40,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [527192478] [2019-11-21 11:18:40,127 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 11:18:40,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:40,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:18:40,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:40,397 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 11:18:40,397 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:40,477 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 11:18:40,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [527192478] [2019-11-21 11:18:40,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:40,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-21 11:18:40,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010575016] [2019-11-21 11:18:40,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:18:40,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:40,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:18:40,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:18:40,479 INFO L87 Difference]: Start difference. First operand 104 states and 123 transitions. Second operand 10 states. [2019-11-21 11:18:40,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:40,540 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2019-11-21 11:18:40,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 11:18:40,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-21 11:18:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:40,544 INFO L225 Difference]: With dead ends: 118 [2019-11-21 11:18:40,544 INFO L226 Difference]: Without dead ends: 114 [2019-11-21 11:18:40,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:18:40,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-21 11:18:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 108. [2019-11-21 11:18:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 11:18:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-11-21 11:18:40,553 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 22 [2019-11-21 11:18:40,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:40,553 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-11-21 11:18:40,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:18:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-11-21 11:18:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 11:18:40,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:40,554 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:40,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:40,758 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:40,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:40,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1960653489, now seen corresponding path program 1 times [2019-11-21 11:18:40,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:40,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1831463768] [2019-11-21 11:18:40,761 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 11:18:41,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:41,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-21 11:18:41,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:41,085 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 11:18:41,086 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:18:41,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1831463768] [2019-11-21 11:18:41,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:41,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 8 [2019-11-21 11:18:41,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993951537] [2019-11-21 11:18:41,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-21 11:18:41,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:41,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-21 11:18:41,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 11:18:41,185 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 9 states. [2019-11-21 11:18:41,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:41,374 INFO L93 Difference]: Finished difference Result 106 states and 122 transitions. [2019-11-21 11:18:41,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:18:41,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-21 11:18:41,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:41,376 INFO L225 Difference]: With dead ends: 106 [2019-11-21 11:18:41,376 INFO L226 Difference]: Without dead ends: 106 [2019-11-21 11:18:41,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-21 11:18:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-21 11:18:41,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2019-11-21 11:18:41,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 11:18:41,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 122 transitions. [2019-11-21 11:18:41,385 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 122 transitions. Word has length 23 [2019-11-21 11:18:41,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:41,385 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 122 transitions. [2019-11-21 11:18:41,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-21 11:18:41,386 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 122 transitions. [2019-11-21 11:18:41,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 11:18:41,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:41,387 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:41,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:41,590 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:41,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 650716283, now seen corresponding path program 1 times [2019-11-21 11:18:41,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:41,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1801226543] [2019-11-21 11:18:41,592 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 11:18:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:41,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:18:41,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:41,884 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 11:18:41,884 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:41,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:41,888 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:18:41,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:18:41,934 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 11:18:41,935 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:41,979 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 11:18:41,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1801226543] [2019-11-21 11:18:41,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:41,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 11:18:41,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002028181] [2019-11-21 11:18:41,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 11:18:41,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:41,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 11:18:41,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:18:41,981 INFO L87 Difference]: Start difference. First operand 106 states and 122 transitions. Second operand 6 states. [2019-11-21 11:18:42,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:42,174 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-11-21 11:18:42,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:18:42,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-21 11:18:42,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:42,178 INFO L225 Difference]: With dead ends: 108 [2019-11-21 11:18:42,178 INFO L226 Difference]: Without dead ends: 108 [2019-11-21 11:18:42,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:18:42,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-21 11:18:42,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-11-21 11:18:42,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 11:18:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2019-11-21 11:18:42,186 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 24 [2019-11-21 11:18:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:42,186 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2019-11-21 11:18:42,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 11:18:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2019-11-21 11:18:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-21 11:18:42,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:42,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:42,388 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:42,390 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash 145157658, now seen corresponding path program 1 times [2019-11-21 11:18:42,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:42,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1391469375] [2019-11-21 11:18:42,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 11:18:42,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:42,658 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:18:42,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:42,704 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 11:18:42,704 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:42,726 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 11:18:42,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1391469375] [2019-11-21 11:18:42,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:42,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-21 11:18:42,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677032241] [2019-11-21 11:18:42,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 11:18:42,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:42,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 11:18:42,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:18:42,728 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 6 states. [2019-11-21 11:18:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:42,784 INFO L93 Difference]: Finished difference Result 85 states and 88 transitions. [2019-11-21 11:18:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 11:18:42,785 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-21 11:18:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:42,786 INFO L225 Difference]: With dead ends: 85 [2019-11-21 11:18:42,786 INFO L226 Difference]: Without dead ends: 83 [2019-11-21 11:18:42,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-21 11:18:42,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-21 11:18:42,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-21 11:18:42,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-21 11:18:42,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2019-11-21 11:18:42,790 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 24 [2019-11-21 11:18:42,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:42,791 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2019-11-21 11:18:42,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 11:18:42,791 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2019-11-21 11:18:42,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 11:18:42,792 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:42,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:42,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:42,996 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:42,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:42,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1292376138, now seen corresponding path program 1 times [2019-11-21 11:18:42,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:42,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [253816016] [2019-11-21 11:18:42,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 11:18:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:43,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-21 11:18:43,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:43,325 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:18:43,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 11:18:43,326 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:43,354 INFO L567 ElimStorePlain]: treesize reduction 10, result has 69.7 percent of original size [2019-11-21 11:18:43,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:43,356 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 11:18:43,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:23 [2019-11-21 11:18:43,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:43,481 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:43,481 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 11:18:43,482 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:43,503 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 11:18:43,504 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 11:18:43,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-21 11:18:43,673 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 11:18:43,674 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:48,076 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 11:18:48,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [253816016] [2019-11-21 11:18:48,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:18:48,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-21 11:18:48,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190282461] [2019-11-21 11:18:48,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 11:18:48,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:18:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 11:18:48,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=146, Unknown=1, NotChecked=0, Total=182 [2019-11-21 11:18:48,086 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand 14 states. [2019-11-21 11:18:48,686 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-21 11:18:49,233 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-21 11:18:49,660 WARN L192 SmtUtils]: Spent 407.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2019-11-21 11:18:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:18:54,269 INFO L93 Difference]: Finished difference Result 81 states and 83 transitions. [2019-11-21 11:18:54,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 11:18:54,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-21 11:18:54,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:18:54,270 INFO L225 Difference]: With dead ends: 81 [2019-11-21 11:18:54,271 INFO L226 Difference]: Without dead ends: 81 [2019-11-21 11:18:54,271 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=98, Invalid=281, Unknown=1, NotChecked=0, Total=380 [2019-11-21 11:18:54,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-21 11:18:54,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2019-11-21 11:18:54,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-21 11:18:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-11-21 11:18:54,275 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 28 [2019-11-21 11:18:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:18:54,275 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-11-21 11:18:54,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 11:18:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-11-21 11:18:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 11:18:54,276 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:18:54,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:18:54,477 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:18:54,478 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:18:54,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:18:54,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1292376139, now seen corresponding path program 1 times [2019-11-21 11:18:54,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:18:54,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1007493091] [2019-11-21 11:18:54,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 11:18:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:18:54,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 11:18:54,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:18:54,808 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:54,808 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 11:18:54,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:54,852 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 11:18:54,910 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:18:54,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 11:18:54,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:54,965 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-11-21 11:18:54,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:54,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:54,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:18:54,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-11-21 11:18:54,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:54,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:54,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:54,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:55,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:55,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:55,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:55,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:55,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:55,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:55,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:55,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:55,197 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2019-11-21 11:18:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:57,360 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:57,361 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 28 treesize of output 32 [2019-11-21 11:18:57,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:57,416 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:57,416 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 48 [2019-11-21 11:18:57,418 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:57,423 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 11:18:57,425 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-11-21 11:18:57,425 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:57,468 INFO L567 ElimStorePlain]: treesize reduction 27, result has 41.3 percent of original size [2019-11-21 11:18:57,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-21 11:18:57,473 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:18:57,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:18:57,486 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 11:18:57,486 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:11 [2019-11-21 11:18:57,640 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 11:18:57,640 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:18:57,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:59,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:18:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:59,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:59,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:59,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:59,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:59,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:18:59,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:19:02,907 WARN L192 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 32 [2019-11-21 11:19:02,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:19:05,454 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 11:19:05,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1007493091] [2019-11-21 11:19:05,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:19:05,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 11:19:05,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390456133] [2019-11-21 11:19:05,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 11:19:05,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:19:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 11:19:05,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=168, Unknown=4, NotChecked=0, Total=210 [2019-11-21 11:19:05,457 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 15 states. [2019-11-21 11:19:16,415 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-21 11:19:24,867 WARN L192 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2019-11-21 11:19:33,239 WARN L192 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-21 11:19:33,429 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 11:20:31,789 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 20 [2019-11-21 11:20:34,205 WARN L192 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-11-21 11:20:37,507 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_probe3_6_~a.base_BEFORE_CALL_12 (_ BitVec 32)) (v_probe3_6_~a.offset_BEFORE_CALL_6 (_ BitVec 32))) (let ((.cse0 (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv8 32)))) (or (exists ((v_prenex_3 (_ BitVec 32)) (v_ldv_malloc_~size_47 (_ BitVec 32))) (and (= (select |c_old(#valid)| v_prenex_3) (_ bv0 1)) (not (bvsle (bvadd v_probe3_6_~a.offset_BEFORE_CALL_6 (_ bv8 32)) (select (store |c_old(#length)| v_prenex_3 v_ldv_malloc_~size_47) v_probe3_6_~a.base_BEFORE_CALL_12))))) (not (bvsle (_ bv0 32) v_probe3_6_~a.offset_BEFORE_CALL_6)) (bvsle .cse0 (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_12)) (not (bvsle v_probe3_6_~a.offset_BEFORE_CALL_6 .cse0))))) (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|))) (or (bvsle (_ bv0 32) |c_~#a6~0.offset|) (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |c_#valid| v_prenex_6) (_ bv0 1))))) (or (forall ((v_prenex_5 (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| v_prenex_5)))) (bvsle |c_~#a6~0.offset| (bvadd |c_~#a6~0.offset| (_ bv8 32)))) (forall ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32)) (v_ldv_malloc_~size_47 (_ BitVec 32))) (or (bvsle (bvadd |c_~#a6~0.offset| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_28| v_ldv_malloc_~size_47) |c_~#a6~0.base|)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1))))) (exists ((v_probe3_6_~a.base_BEFORE_CALL_8 (_ BitVec 32))) (= (bvadd (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_8) (_ bv4294967288 32)) (_ bv0 32))) (exists ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32))) (= (select |c_old(#valid)| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1)))) is different from false [2019-11-21 11:21:14,190 WARN L838 $PredicateComparison]: unable to prove that (and (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|))) (or (bvsle (_ bv0 32) |c_~#a6~0.offset|) (forall ((v_prenex_6 (_ BitVec 32))) (not (= (select |c_#valid| v_prenex_6) (_ bv0 1))))) (or (forall ((v_prenex_5 (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| v_prenex_5)))) (bvsle |c_~#a6~0.offset| (bvadd |c_~#a6~0.offset| (_ bv8 32)))) (forall ((|v_ldv_malloc_#t~malloc12.base_28| (_ BitVec 32)) (v_ldv_malloc_~size_47 (_ BitVec 32))) (or (bvsle (bvadd |c_~#a6~0.offset| (_ bv8 32)) (select (store |c_#length| |v_ldv_malloc_#t~malloc12.base_28| v_ldv_malloc_~size_47) |c_~#a6~0.base|)) (not (= (select |c_#valid| |v_ldv_malloc_#t~malloc12.base_28|) (_ bv0 1))))) (exists ((v_probe3_6_~a.base_BEFORE_CALL_8 (_ BitVec 32))) (= (bvadd (select |c_#length| v_probe3_6_~a.base_BEFORE_CALL_8) (_ bv4294967288 32)) (_ bv0 32)))) is different from false [2019-11-21 11:21:16,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:21:16,197 INFO L93 Difference]: Finished difference Result 82 states and 85 transitions. [2019-11-21 11:21:16,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 11:21:16,213 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-11-21 11:21:16,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:21:16,214 INFO L225 Difference]: With dead ends: 82 [2019-11-21 11:21:16,214 INFO L226 Difference]: Without dead ends: 65 [2019-11-21 11:21:16,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 59.6s TimeCoverageRelationStatistics Valid=169, Invalid=522, Unknown=19, NotChecked=102, Total=812 [2019-11-21 11:21:16,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-21 11:21:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2019-11-21 11:21:16,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 11:21:16,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-11-21 11:21:16,217 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 28 [2019-11-21 11:21:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:21:16,218 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-11-21 11:21:16,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 11:21:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-11-21 11:21:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-21 11:21:16,219 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:21:16,219 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:21:16,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:21:16,421 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, disconnect_6Err4ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err2ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err3ASSERT_VIOLATIONMEMORY_FREE, disconnect_6Err1REQUIRES_VIOLATION, disconnect_6Err0REQUIRES_VIOLATION, probe3_6Err2ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err1REQUIRES_VIOLATION, probe3_6Err0REQUIRES_VIOLATION, probe3_6Err5ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err7ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err6ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err4ASSERT_VIOLATIONMEMORY_FREE, probe3_6Err3ASSERT_VIOLATIONMEMORY_FREE, entry_pointErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:21:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:21:16,422 INFO L82 PathProgramCache]: Analyzing trace with hash -18189035, now seen corresponding path program 1 times [2019-11-21 11:21:16,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:21:16,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1985094320] [2019-11-21 11:21:16,423 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 11:21:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:21:16,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-21 11:21:16,704 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:21:16,808 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:21:16,809 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 11:21:16,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:16,871 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.8 percent of original size [2019-11-21 11:21:16,893 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:16,894 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 25 [2019-11-21 11:21:16,894 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:16,954 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.0 percent of original size [2019-11-21 11:21:16,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:16,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:16,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:21:16,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:40 [2019-11-21 11:21:16,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:16,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:16,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:16,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:16,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:16,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:17,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:17,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:17,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:17,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:17,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:17,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:17,069 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:17,069 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 37 treesize of output 41 [2019-11-21 11:21:17,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:17,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:17,097 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 39 treesize of output 43 [2019-11-21 11:21:17,097 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:17,112 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:17,113 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 30 treesize of output 34 [2019-11-21 11:21:17,113 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:17,117 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 30 treesize of output 28 [2019-11-21 11:21:17,118 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:17,122 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 32 treesize of output 30 [2019-11-21 11:21:17,123 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:17,168 INFO L567 ElimStorePlain]: treesize reduction 122, result has 10.9 percent of original size [2019-11-21 11:21:17,172 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 5 treesize of output 3 [2019-11-21 11:21:17,172 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:17,179 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:17,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:21:17,180 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:169, output treesize:10 [2019-11-21 11:21:19,223 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 5 treesize of output 3 [2019-11-21 11:21:19,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,237 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 11:21:19,237 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,247 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,247 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 11:21:19,248 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:3 [2019-11-21 11:21:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:19,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:19,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,316 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 37 treesize of output 39 [2019-11-21 11:21:19,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,355 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 59 [2019-11-21 11:21:19,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,392 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,393 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 61 [2019-11-21 11:21:19,393 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,410 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,412 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,432 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,432 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 56 [2019-11-21 11:21:19,433 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:21:19,445 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 39 treesize of output 41 [2019-11-21 11:21:19,446 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,601 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-11-21 11:21:19,601 INFO L567 ElimStorePlain]: treesize reduction 135, result has 41.0 percent of original size [2019-11-21 11:21:19,615 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,615 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 27 treesize of output 31 [2019-11-21 11:21:19,616 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,629 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,629 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 35 treesize of output 39 [2019-11-21 11:21:19,630 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,660 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:21:19,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2019-11-21 11:21:19,661 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 11:21:19,698 INFO L567 ElimStorePlain]: treesize reduction 55, result has 24.7 percent of original size [2019-11-21 11:21:19,699 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 11:21:19,699 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 5 variables, input treesize:214, output treesize:9 [2019-11-21 11:21:19,720 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 11:21:19,720 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:21:19,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:21:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:21:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:21:20,413 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 19 [2019-11-21 11:21:20,426 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#length)_BEFORE_CALL_5|], 15=[|v_old(#valid)_BEFORE_CALL_5|]} [2019-11-21 11:21:20,630 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:21:20,631 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 11:21:20,636 INFO L168 Benchmark]: Toolchain (without parser) took 167291.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 337.1 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -141.0 MB). Peak memory consumption was 196.1 MB. Max. memory is 11.5 GB. [2019-11-21 11:21:20,636 INFO L168 Benchmark]: CDTParser took 0.28 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 11:21:20,637 INFO L168 Benchmark]: CACSL2BoogieTranslator took 932.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2019-11-21 11:21:20,638 INFO L168 Benchmark]: Boogie Preprocessor took 102.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-21 11:21:20,638 INFO L168 Benchmark]: RCFGBuilder took 1722.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.0 MB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. [2019-11-21 11:21:20,638 INFO L168 Benchmark]: TraceAbstraction took 164528.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 981.0 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 77.5 MB. Max. memory is 11.5 GB. [2019-11-21 11:21:20,644 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.28 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 932.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -148.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 102.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1722.76 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 981.0 MB in the end (delta: 113.3 MB). Peak memory consumption was 113.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 164528.58 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.8 MB). Free memory was 981.0 MB in the beginning and 1.1 GB in the end (delta: -112.3 MB). Peak memory consumption was 77.5 MB. 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...