./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13.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_test13.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 50623fcce85e4b85b0accc998d09712632377f90 --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:33:18,870 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 11:33:18,873 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 11:33:18,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 11:33:18,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 11:33:18,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 11:33:18,892 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 11:33:18,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 11:33:18,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 11:33:18,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 11:33:18,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 11:33:18,899 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 11:33:18,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 11:33:18,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 11:33:18,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 11:33:18,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 11:33:18,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 11:33:18,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 11:33:18,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 11:33:18,909 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 11:33:18,911 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 11:33:18,912 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 11:33:18,913 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 11:33:18,914 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 11:33:18,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 11:33:18,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 11:33:18,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 11:33:18,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 11:33:18,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 11:33:18,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 11:33:18,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 11:33:18,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 11:33:18,922 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 11:33:18,923 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 11:33:18,924 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 11:33:18,924 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 11:33:18,925 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 11:33:18,926 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 11:33:18,926 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 11:33:18,928 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 11:33:18,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 11:33:18,931 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:33:18,952 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 11:33:18,952 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 11:33:18,953 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 11:33:18,954 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 11:33:18,954 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 11:33:18,954 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 11:33:18,954 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 11:33:18,955 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 11:33:18,955 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 11:33:18,955 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 11:33:18,955 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 11:33:18,955 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 11:33:18,956 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 11:33:18,956 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 11:33:18,956 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:18,956 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 11:33:18,956 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 11:33:18,957 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 11:33:18,957 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 11:33:18,957 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 11:33:18,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 11:33:18,958 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 11:33:18,958 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 11:33:18,958 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 11:33:18,958 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 11:33:18,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 11:33:18,959 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 -> 50623fcce85e4b85b0accc998d09712632377f90 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:33:19,252 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 11:33:19,274 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 11:33:19,277 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 11:33:19,279 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 11:33:19,280 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 11:33:19,281 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-21 11:33:19,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce3be758/9bb08d34a79c409394987e31486e591c/FLAGb652a3aa3 [2019-11-21 11:33:19,932 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 11:33:19,932 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13.i [2019-11-21 11:33:19,949 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce3be758/9bb08d34a79c409394987e31486e591c/FLAGb652a3aa3 [2019-11-21 11:33:20,259 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dce3be758/9bb08d34a79c409394987e31486e591c [2019-11-21 11:33:20,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 11:33:20,264 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 11:33:20,265 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 11:33:20,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 11:33:20,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 11:33:20,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:33:20" (1/1) ... [2019-11-21 11:33:20,273 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fbfa2b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:20, skipping insertion in model container [2019-11-21 11:33:20,273 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 11:33:20" (1/1) ... [2019-11-21 11:33:20,281 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 11:33:20,350 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:33:20,775 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:33:20,775 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 11:33:20,776 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,796 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:33:20,796 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 11:33:20,797 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,802 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:33:20,803 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 11:33:20,803 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,808 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:33:20,808 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 11:33:20,808 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,853 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:33:20,854 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 11:33:20,854 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,880 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:33:20,881 INFO L969 CHandler]: at location: C: (struct A13 *)ldv_malloc(sizeof(struct A13)) [764] [2019-11-21 11:33:20,881 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,889 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:33:20,890 INFO L969 CHandler]: at location: C: (typeof(*p) *)( (char *)__mptr - ((size_t) &((typeof(*p) *)0)->list) ) [772] [2019-11-21 11:33:20,890 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,898 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:33:20,899 INFO L969 CHandler]: at location: C: (typeof(*(p)) *)( (char *)__mptr - ((size_t) &((typeof(*(p)) *)0)->list) ) [772] [2019-11-21 11:33:20,899 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,902 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:33:20,903 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [772] [2019-11-21 11:33:20,903 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 11:33:20,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:33:20,932 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 11:33:20,961 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 11:33:21,039 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:33:21,048 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 11:33:21,107 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 11:33:21,194 INFO L205 MainTranslator]: Completed translation [2019-11-21 11:33:21,194 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21 WrapperNode [2019-11-21 11:33:21,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 11:33:21,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 11:33:21,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 11:33:21,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 11:33:21,210 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (1/1) ... [2019-11-21 11:33:21,211 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (1/1) ... [2019-11-21 11:33:21,236 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (1/1) ... [2019-11-21 11:33:21,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (1/1) ... [2019-11-21 11:33:21,278 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (1/1) ... [2019-11-21 11:33:21,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (1/1) ... [2019-11-21 11:33:21,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (1/1) ... [2019-11-21 11:33:21,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 11:33:21,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 11:33:21,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 11:33:21,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 11:33:21,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (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:33:21,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 11:33:21,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 11:33:21,398 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 11:33:21,398 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 11:33:21,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 11:33:21,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 11:33:21,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 11:33:21,399 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 11:33:21,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 11:33:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 11:33:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 11:33:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 11:33:21,400 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 11:33:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 11:33:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 11:33:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 11:33:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 11:33:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 11:33:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 11:33:21,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 11:33:21,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 11:33:21,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 11:33:21,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 11:33:21,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 11:33:21,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 11:33:21,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 11:33:21,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 11:33:21,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 11:33:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 11:33:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 11:33:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 11:33:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 11:33:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 11:33:21,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 11:33:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 11:33:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 11:33:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 11:33:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 11:33:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 11:33:21,405 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 11:33:21,406 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 11:33:21,406 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-21 11:33:21,406 INFO L138 BoogieDeclarations]: Found implementation of procedure free_13 [2019-11-21 11:33:21,407 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 11:33:21,407 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 11:33:21,409 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 11:33:21,409 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 11:33:21,409 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 11:33:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 11:33:21,409 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 11:33:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 11:33:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 11:33:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 11:33:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 11:33:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 11:33:21,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 11:33:21,412 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 11:33:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 11:33:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 11:33:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 11:33:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 11:33:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 11:33:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 11:33:21,413 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 11:33:21,414 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 11:33:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 11:33:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 11:33:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 11:33:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 11:33:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 11:33:21,415 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 11:33:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 11:33:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 11:33:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 11:33:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 11:33:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 11:33:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 11:33:21,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 11:33:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 11:33:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 11:33:21,417 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 11:33:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 11:33:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 11:33:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 11:33:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 11:33:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 11:33:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 11:33:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 11:33:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 11:33:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 11:33:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 11:33:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 11:33:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 11:33:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 11:33:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 11:33:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 11:33:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 11:33:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 11:33:21,424 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 11:33:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 11:33:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 11:33:21,425 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 11:33:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 11:33:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 11:33:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 11:33:21,432 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 11:33:21,433 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 11:33:21,433 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 11:33:21,434 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 11:33:21,435 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 11:33:21,436 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 11:33:21,437 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 11:33:21,438 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 11:33:21,439 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 11:33:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 11:33:21,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 11:33:21,441 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 11:33:21,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 11:33:21,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 11:33:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 11:33:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 11:33:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 11:33:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 11:33:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 11:33:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 11:33:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 11:33:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 11:33:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 11:33:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 11:33:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 11:33:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 11:33:21,444 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 11:33:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 11:33:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 11:33:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 11:33:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 11:33:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 11:33:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 11:33:21,445 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 11:33:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 11:33:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-21 11:33:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure free_13 [2019-11-21 11:33:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 11:33:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 11:33:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 11:33:21,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 11:33:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 11:33:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 11:33:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 11:33:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 11:33:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 11:33:21,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 11:33:22,122 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 11:33:22,506 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 11:33:22,962 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 11:33:22,962 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-21 11:33:22,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:33:22 BoogieIcfgContainer [2019-11-21 11:33:22,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 11:33:22,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 11:33:22,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 11:33:22,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 11:33:22,969 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 11:33:20" (1/3) ... [2019-11-21 11:33:22,970 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb99711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:33:22, skipping insertion in model container [2019-11-21 11:33:22,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 11:33:21" (2/3) ... [2019-11-21 11:33:22,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb99711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 11:33:22, skipping insertion in model container [2019-11-21 11:33:22,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 11:33:22" (3/3) ... [2019-11-21 11:33:22,973 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13.i [2019-11-21 11:33:22,982 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 11:33:22,991 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 80 error locations. [2019-11-21 11:33:23,003 INFO L249 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2019-11-21 11:33:23,023 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 11:33:23,024 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 11:33:23,024 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 11:33:23,024 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 11:33:23,024 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 11:33:23,025 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 11:33:23,025 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 11:33:23,025 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 11:33:23,047 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-21 11:33:23,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 11:33:23,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:33:23,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:33:23,059 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:33:23,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:33:23,066 INFO L82 PathProgramCache]: Analyzing trace with hash 797453636, now seen corresponding path program 1 times [2019-11-21 11:33:23,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:33:23,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1054167689] [2019-11-21 11:33:23,077 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:33:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:33:23,473 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 11:33:23,481 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:33:23,746 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 17 [2019-11-21 11:33:23,748 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:33:23,749 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:33:23,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:23,821 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 11:33:23,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:23,828 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:33:23,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:30 [2019-11-21 11:33:23,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:23,882 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:33:23,882 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:23,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:23,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:33:23,887 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:5 [2019-11-21 11:33:23,931 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:33:23,932 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:23,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:23,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:33:23,938 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 11:33:24,043 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:24,044 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 17 treesize of output 39 [2019-11-21 11:33:24,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:24,098 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 11:33:24,099 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:33:24,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-21 11:33:24,218 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:33:24,218 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:33:24,549 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:33:24,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1054167689] [2019-11-21 11:33:24,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:33:24,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-21 11:33:24,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593540076] [2019-11-21 11:33:24,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 11:33:24,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:33:24,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 11:33:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-21 11:33:24,583 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 14 states. [2019-11-21 11:33:25,754 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2019-11-21 11:33:26,861 WARN L192 SmtUtils]: Spent 889.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 27 [2019-11-21 11:33:27,851 WARN L192 SmtUtils]: Spent 917.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-11-21 11:33:33,390 WARN L192 SmtUtils]: Spent 895.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-21 11:33:41,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:33:41,458 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2019-11-21 11:33:41,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 11:33:41,459 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-21 11:33:41,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:33:41,473 INFO L225 Difference]: With dead ends: 208 [2019-11-21 11:33:41,473 INFO L226 Difference]: Without dead ends: 195 [2019-11-21 11:33:41,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-11-21 11:33:41,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-11-21 11:33:41,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 109. [2019-11-21 11:33:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 11:33:41,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-21 11:33:41,531 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 17 [2019-11-21 11:33:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:33:41,532 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-21 11:33:41,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 11:33:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-21 11:33:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 11:33:41,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:33:41,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:33:41,737 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:33:41,738 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:33:41,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:33:41,738 INFO L82 PathProgramCache]: Analyzing trace with hash 797453637, now seen corresponding path program 1 times [2019-11-21 11:33:41,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:33:41,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1353570873] [2019-11-21 11:33:41,740 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:33:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:33:42,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 11:33:42,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:33:42,149 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:33:42,150 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:33:42,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,200 INFO L567 ElimStorePlain]: treesize reduction 10, result has 80.8 percent of original size [2019-11-21 11:33:42,220 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:33:42,220 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:33:42,221 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,269 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:42,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:42,271 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:33:42,275 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:43 [2019-11-21 11:33:42,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:42,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:42,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:42,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2019-11-21 11:33:42,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,350 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2019-11-21 11:33:42,351 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,363 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2019-11-21 11:33:42,363 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,451 INFO L567 ElimStorePlain]: treesize reduction 33, result has 66.0 percent of original size [2019-11-21 11:33:42,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-21 11:33:42,453 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:118, output treesize:64 [2019-11-21 11:33:42,577 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_2, |v_#length_BEFORE_CALL_4|], 1=[v_prenex_1, |v_#valid_BEFORE_CALL_10|]} [2019-11-21 11:33:42,587 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 27 treesize of output 25 [2019-11-21 11:33:42,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:42,634 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 27 treesize of output 25 [2019-11-21 11:33:42,635 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:42,699 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:42,699 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 20 treesize of output 24 [2019-11-21 11:33:42,700 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,741 INFO L567 ElimStorePlain]: treesize reduction 23, result has 30.3 percent of original size [2019-11-21 11:33:42,741 INFO L464 ElimStorePlain]: Eliminatee |v_#valid_BEFORE_CALL_10| vanished before elimination [2019-11-21 11:33:42,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:33:42,742 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:55, output treesize:10 [2019-11-21 11:33:44,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:33:44,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:33:44,840 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 32 treesize of output 34 [2019-11-21 11:33:44,841 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:44,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:33:44,915 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:44,916 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 59 [2019-11-21 11:33:44,917 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:45,017 INFO L567 ElimStorePlain]: treesize reduction 24, result has 72.4 percent of original size [2019-11-21 11:33:45,055 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:45,055 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:33:45,059 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:45,077 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:33:45,077 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 31 treesize of output 35 [2019-11-21 11:33:45,078 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:33:45,124 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-21 11:33:45,125 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:33:45,125 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:65, output treesize:9 [2019-11-21 11:33:45,180 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:33:45,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:33:45,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:45,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:33:45,797 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 11:33:46,327 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-11-21 11:33:47,156 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:33:47,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1353570873] [2019-11-21 11:33:47,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:33:47,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 11:33:47,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860298538] [2019-11-21 11:33:47,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 11:33:47,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:33:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 11:33:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2019-11-21 11:33:47,161 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 15 states. [2019-11-21 11:34:44,125 WARN L192 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 11:34:54,336 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-11-21 11:36:28,385 WARN L192 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2019-11-21 11:36:36,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:36:36,730 INFO L93 Difference]: Finished difference Result 197 states and 208 transitions. [2019-11-21 11:36:36,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 11:36:36,731 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-11-21 11:36:36,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:36:36,734 INFO L225 Difference]: With dead ends: 197 [2019-11-21 11:36:36,734 INFO L226 Difference]: Without dead ends: 197 [2019-11-21 11:36:36,735 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 55.0s TimeCoverageRelationStatistics Valid=196, Invalid=482, Unknown=24, NotChecked=0, Total=702 [2019-11-21 11:36:36,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2019-11-21 11:36:36,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 107. [2019-11-21 11:36:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-21 11:36:36,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-21 11:36:36,750 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 17 [2019-11-21 11:36:36,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:36:36,751 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-21 11:36:36,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 11:36:36,751 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-21 11:36:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:36:36,752 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:36:36,752 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:36:36,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:36:36,963 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:36:36,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:36:36,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1477528223, now seen corresponding path program 1 times [2019-11-21 11:36:36,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:36:36,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [121966030] [2019-11-21 11:36:36,966 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:36:37,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:36:37,249 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 11:36:37,251 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:36:37,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:36:37,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:37,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:37,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:36:37,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2019-11-21 11:36:37,332 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:36:37,332 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:36:37,343 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:37,344 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 16 treesize of output 20 [2019-11-21 11:36:37,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:36:37,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:37,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:37,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:36:37,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-21 11:36:37,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:36:37,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [121966030] [2019-11-21 11:36:37,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:36:37,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-21 11:36:37,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952429237] [2019-11-21 11:36:37,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 11:36:37,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:36:37,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 11:36:37,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:36:37,422 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 11 states. [2019-11-21 11:36:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:36:38,142 INFO L93 Difference]: Finished difference Result 150 states and 162 transitions. [2019-11-21 11:36:38,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 11:36:38,143 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-11-21 11:36:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:36:38,145 INFO L225 Difference]: With dead ends: 150 [2019-11-21 11:36:38,145 INFO L226 Difference]: Without dead ends: 150 [2019-11-21 11:36:38,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2019-11-21 11:36:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-21 11:36:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 106. [2019-11-21 11:36:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-21 11:36:38,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 113 transitions. [2019-11-21 11:36:38,157 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 113 transitions. Word has length 20 [2019-11-21 11:36:38,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:36:38,157 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 113 transitions. [2019-11-21 11:36:38,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 11:36:38,157 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 113 transitions. [2019-11-21 11:36:38,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 11:36:38,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:36:38,158 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:36:38,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:36:38,365 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:36:38,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:36:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1477528224, now seen corresponding path program 1 times [2019-11-21 11:36:38,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:36:38,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [438501852] [2019-11-21 11:36:38,367 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:36:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:36:38,696 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-21 11:36:38,699 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:36:38,729 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:36:38,730 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:36:38,730 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:38,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:38,816 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:36:38,817 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:36:38,818 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:38,884 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.3 percent of original size [2019-11-21 11:36:38,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:38,887 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:36:38,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:50 [2019-11-21 11:36:38,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:38,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:38,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:38,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:38,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:38,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:39,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:39,056 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:39,057 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 55 treesize of output 73 [2019-11-21 11:36:39,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:39,075 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:39,075 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 48 treesize of output 52 [2019-11-21 11:36:39,076 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:39,081 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 11:36:39,081 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:39,221 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-11-21 11:36:39,222 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.9 percent of original size [2019-11-21 11:36:39,235 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:39,235 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 36 treesize of output 40 [2019-11-21 11:36:39,236 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:39,240 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 11:36:39,240 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:39,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:39,255 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:36:39,255 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:157, output treesize:24 [2019-11-21 11:36:41,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:41,457 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:41,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 100 [2019-11-21 11:36:41,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:41,506 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:41,507 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 58 treesize of output 76 [2019-11-21 11:36:41,509 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:41,542 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:41,542 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 51 treesize of output 69 [2019-11-21 11:36:41,543 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:41,724 WARN L192 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-11-21 11:36:41,725 INFO L567 ElimStorePlain]: treesize reduction 55, result has 61.3 percent of original size [2019-11-21 11:36:41,759 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:41,759 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 44 treesize of output 57 [2019-11-21 11:36:41,761 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:41,783 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:41,783 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 42 treesize of output 55 [2019-11-21 11:36:41,784 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:41,928 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2019-11-21 11:36:41,929 INFO L567 ElimStorePlain]: treesize reduction 20, result has 81.3 percent of original size [2019-11-21 11:36:41,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-21 11:36:41,931 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:170, output treesize:61 [2019-11-21 11:36:42,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:36:42,096 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:42,123 INFO L567 ElimStorePlain]: treesize reduction 5, result has 83.3 percent of original size [2019-11-21 11:36:42,127 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:36:42,128 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:36:42,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:36:42,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:36:42,140 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:9 [2019-11-21 11:36:42,246 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:36:42,246 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:36:42,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:43,347 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:36:45,849 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 11:36:45,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:36:45,872 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 11:36:48,265 WARN L192 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-21 11:36:48,296 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 11:36:52,051 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:36:52,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [438501852] [2019-11-21 11:36:52,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:36:52,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2019-11-21 11:36:52,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343498096] [2019-11-21 11:36:52,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 11:36:52,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:36:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 11:36:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=326, Unknown=2, NotChecked=0, Total=380 [2019-11-21 11:36:52,053 INFO L87 Difference]: Start difference. First operand 106 states and 113 transitions. Second operand 20 states. [2019-11-21 11:37:34,632 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-21 11:38:03,839 WARN L192 SmtUtils]: Spent 764.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-21 11:38:05,222 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 11:38:33,951 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 11:38:50,435 WARN L192 SmtUtils]: Spent 710.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-21 11:39:21,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:21,099 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2019-11-21 11:39:21,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 11:39:21,102 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-11-21 11:39:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:21,103 INFO L225 Difference]: With dead ends: 152 [2019-11-21 11:39:21,103 INFO L226 Difference]: Without dead ends: 152 [2019-11-21 11:39:21,104 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=250, Invalid=922, Unknown=18, NotChecked=0, Total=1190 [2019-11-21 11:39:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-21 11:39:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 105. [2019-11-21 11:39:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-21 11:39:21,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-21 11:39:21,114 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 20 [2019-11-21 11:39:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:21,115 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-21 11:39:21,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 11:39:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-21 11:39:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:39:21,116 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:21,116 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] [2019-11-21 11:39:21,319 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:21,320 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:21,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1441265296, now seen corresponding path program 1 times [2019-11-21 11:39:21,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:21,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1779139341] [2019-11-21 11:39:21,322 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:39:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:21,601 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 11:39:21,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:21,620 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:39:21,620 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:21,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:21,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:21,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 11:39:21,682 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:39:21,682 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:21,876 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:39:21,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1779139341] [2019-11-21 11:39:21,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:21,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 13 [2019-11-21 11:39:21,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369947147] [2019-11-21 11:39:21,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 11:39:21,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:21,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 11:39:21,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-21 11:39:21,879 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 14 states. [2019-11-21 11:39:22,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:22,732 INFO L93 Difference]: Finished difference Result 121 states and 127 transitions. [2019-11-21 11:39:22,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 11:39:22,733 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-21 11:39:22,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:22,735 INFO L225 Difference]: With dead ends: 121 [2019-11-21 11:39:22,735 INFO L226 Difference]: Without dead ends: 121 [2019-11-21 11:39:22,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-21 11:39:22,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-21 11:39:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2019-11-21 11:39:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-21 11:39:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-21 11:39:22,761 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 21 [2019-11-21 11:39:22,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:22,763 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-21 11:39:22,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 11:39:22,763 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-21 11:39:22,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:39:22,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:22,766 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] [2019-11-21 11:39:22,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:22,967 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:22,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:22,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1441265295, now seen corresponding path program 1 times [2019-11-21 11:39:22,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:22,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [187666771] [2019-11-21 11:39:22,968 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:39:23,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:23,273 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 11:39:23,275 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:23,302 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 11:39:23,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:23,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:23,308 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:23,308 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:39:23,458 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:39:23,459 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:24,333 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:39:24,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [187666771] [2019-11-21 11:39:24,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:24,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-21 11:39:24,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227847224] [2019-11-21 11:39:24,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 11:39:24,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:24,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 11:39:24,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-21 11:39:24,335 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 18 states. [2019-11-21 11:39:25,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:25,990 INFO L93 Difference]: Finished difference Result 119 states and 125 transitions. [2019-11-21 11:39:25,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 11:39:25,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-21 11:39:25,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:25,994 INFO L225 Difference]: With dead ends: 119 [2019-11-21 11:39:25,994 INFO L226 Difference]: Without dead ends: 119 [2019-11-21 11:39:25,995 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-21 11:39:25,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-21 11:39:26,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-11-21 11:39:26,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-21 11:39:26,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2019-11-21 11:39:26,001 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 21 [2019-11-21 11:39:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:26,001 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2019-11-21 11:39:26,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 11:39:26,002 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2019-11-21 11:39:26,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:39:26,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:26,003 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] [2019-11-21 11:39:26,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:26,207 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:26,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:26,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1312182577, now seen corresponding path program 1 times [2019-11-21 11:39:26,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:26,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [85881935] [2019-11-21 11:39:26,208 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:39:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:26,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 11:39:26,507 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:26,536 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:39:26,536 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:26,569 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:39:26,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [85881935] [2019-11-21 11:39:26,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:26,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 11:39:26,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662850879] [2019-11-21 11:39:26,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:39:26,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:26,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:39:26,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:39:26,571 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 5 states. [2019-11-21 11:39:26,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:26,588 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2019-11-21 11:39:26,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:39:26,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-21 11:39:26,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:26,591 INFO L225 Difference]: With dead ends: 102 [2019-11-21 11:39:26,591 INFO L226 Difference]: Without dead ends: 102 [2019-11-21 11:39:26,591 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:39:26,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-11-21 11:39:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2019-11-21 11:39:26,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 11:39:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2019-11-21 11:39:26,599 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 21 [2019-11-21 11:39:26,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:26,600 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2019-11-21 11:39:26,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:39:26,600 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2019-11-21 11:39:26,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:39:26,601 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:26,601 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] [2019-11-21 11:39:26,804 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:26,805 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:26,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:26,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1200287389, now seen corresponding path program 1 times [2019-11-21 11:39:26,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:26,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [951944430] [2019-11-21 11:39:26,806 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:39:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:27,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 11:39:27,064 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:27,084 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:39:27,084 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:27,149 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:39:27,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [951944430] [2019-11-21 11:39:27,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:27,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 11:39:27,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646737710] [2019-11-21 11:39:27,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 11:39:27,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:27,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 11:39:27,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 11:39:27,151 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand 5 states. [2019-11-21 11:39:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:27,168 INFO L93 Difference]: Finished difference Result 100 states and 104 transitions. [2019-11-21 11:39:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 11:39:27,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-21 11:39:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:27,170 INFO L225 Difference]: With dead ends: 100 [2019-11-21 11:39:27,170 INFO L226 Difference]: Without dead ends: 100 [2019-11-21 11:39:27,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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:39:27,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-21 11:39:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-11-21 11:39:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-21 11:39:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2019-11-21 11:39:27,176 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 21 [2019-11-21 11:39:27,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:27,176 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2019-11-21 11:39:27,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 11:39:27,177 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2019-11-21 11:39:27,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:39:27,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:27,178 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] [2019-11-21 11:39:27,381 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:27,382 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:27,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:27,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1071204670, now seen corresponding path program 1 times [2019-11-21 11:39:27,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:27,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [853331120] [2019-11-21 11:39:27,384 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:39:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:27,644 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-21 11:39:27,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:27,699 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:39:27,699 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:39:27,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:27,739 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 11:39:27,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:27,740 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:39:27,741 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-21 11:39:27,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:27,780 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:39:27,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:27,790 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:27,793 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:27,794 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:27,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:27,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:27,802 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 11:39:27,848 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:39:27,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:27,863 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-11-21 11:39:27,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:27,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-21 11:39:27,899 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:39:27,900 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:28,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:28,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:28,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:28,092 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 38 treesize of output 32 [2019-11-21 11:39:28,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:28,101 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 35 treesize of output 29 [2019-11-21 11:39:28,101 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:28,107 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 11:39:28,107 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:28,111 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 11:39:28,111 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:28,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:28,145 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_2| vanished before elimination [2019-11-21 11:39:28,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 11:39:28,145 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:54 [2019-11-21 11:39:28,265 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:39:28,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [853331120] [2019-11-21 11:39:28,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:28,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-21 11:39:28,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521621448] [2019-11-21 11:39:28,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 11:39:28,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:28,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 11:39:28,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:39:28,268 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand 10 states. [2019-11-21 11:39:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:29,217 INFO L93 Difference]: Finished difference Result 137 states and 143 transitions. [2019-11-21 11:39:29,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 11:39:29,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-21 11:39:29,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:29,224 INFO L225 Difference]: With dead ends: 137 [2019-11-21 11:39:29,224 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 11:39:29,224 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2019-11-21 11:39:29,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 11:39:29,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 115. [2019-11-21 11:39:29,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-21 11:39:29,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 126 transitions. [2019-11-21 11:39:29,230 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 126 transitions. Word has length 21 [2019-11-21 11:39:29,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:29,231 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 126 transitions. [2019-11-21 11:39:29,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 11:39:29,231 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 126 transitions. [2019-11-21 11:39:29,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 11:39:29,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:29,232 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] [2019-11-21 11:39:29,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:29,436 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1071204669, now seen corresponding path program 1 times [2019-11-21 11:39:29,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:29,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [235517902] [2019-11-21 11:39:29,438 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:39:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:29,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 35 conjunts are in the unsatisfiable core [2019-11-21 11:39:29,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:29,721 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:39:29,721 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:39:29,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:29,736 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:39:29,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:28 [2019-11-21 11:39:29,776 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:39:29,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:29,797 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:29,797 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:29,813 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:29,814 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:29,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,826 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:32, output treesize:13 [2019-11-21 11:39:29,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:39:29,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:29,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:39:29,876 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:29,884 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:29,884 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-11-21 11:39:29,913 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:39:29,913 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:30,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:39:30,266 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 16 treesize of output 10 [2019-11-21 11:39:30,267 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:39:30,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:30,319 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_4| vanished before elimination [2019-11-21 11:39:30,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-11-21 11:39:30,328 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:30,378 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:30,382 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:30,382 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:92, output treesize:54 [2019-11-21 11:39:30,545 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:39:30,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [235517902] [2019-11-21 11:39:30,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:30,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-21 11:39:30,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312750666] [2019-11-21 11:39:30,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 11:39:30,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 11:39:30,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:39:30,548 INFO L87 Difference]: Start difference. First operand 115 states and 126 transitions. Second operand 12 states. [2019-11-21 11:39:30,819 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-21 11:39:32,474 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 11:39:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:33,804 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2019-11-21 11:39:33,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 11:39:33,805 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-21 11:39:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:33,806 INFO L225 Difference]: With dead ends: 145 [2019-11-21 11:39:33,806 INFO L226 Difference]: Without dead ends: 145 [2019-11-21 11:39:33,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2019-11-21 11:39:33,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-21 11:39:33,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 127. [2019-11-21 11:39:33,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-11-21 11:39:33,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 144 transitions. [2019-11-21 11:39:33,812 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 144 transitions. Word has length 21 [2019-11-21 11:39:33,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:33,813 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 144 transitions. [2019-11-21 11:39:33,813 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 11:39:33,813 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 144 transitions. [2019-11-21 11:39:33,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 11:39:33,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:33,814 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:39:34,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:34,018 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, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:34,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:34,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478541, now seen corresponding path program 1 times [2019-11-21 11:39:34,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:34,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [10638418] [2019-11-21 11:39:34,019 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:39:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:34,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 11:39:34,325 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:34,335 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:34,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:34,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:34,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:34,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:7, output treesize:1 [2019-11-21 11:39:34,358 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:39:34,359 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:34,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:39:34,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [10638418] [2019-11-21 11:39:34,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:34,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 11:39:34,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255504673] [2019-11-21 11:39:34,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 11:39:34,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:34,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 11:39:34,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 11:39:34,399 INFO L87 Difference]: Start difference. First operand 127 states and 144 transitions. Second operand 6 states. [2019-11-21 11:39:38,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:38,867 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2019-11-21 11:39:38,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 11:39:38,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-21 11:39:38,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:38,870 INFO L225 Difference]: With dead ends: 136 [2019-11-21 11:39:38,871 INFO L226 Difference]: Without dead ends: 136 [2019-11-21 11:39:38,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-21 11:39:38,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-11-21 11:39:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 126. [2019-11-21 11:39:38,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-21 11:39:38,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-11-21 11:39:38,877 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 23 [2019-11-21 11:39:38,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:38,877 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-11-21 11:39:38,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 11:39:38,878 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-11-21 11:39:38,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 11:39:38,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:38,880 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:39:39,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:39,087 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:39,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:39,088 INFO L82 PathProgramCache]: Analyzing trace with hash -2076478540, now seen corresponding path program 1 times [2019-11-21 11:39:39,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:39,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [463909208] [2019-11-21 11:39:39,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:39,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-21 11:39:39,410 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:39,465 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-21 11:39:39,466 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:39,477 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:39,481 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-11-21 11:39:39,481 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:39,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:39,488 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:39,489 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-11-21 11:39:39,566 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:39:39,567 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:39,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:39,637 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:39,637 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:39:39,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:39,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:39,639 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:39,654 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 28 treesize of output 26 [2019-11-21 11:39:39,655 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:39,678 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 26 treesize of output 24 [2019-11-21 11:39:39,678 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:39,788 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 11:39:39,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:39,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:39,789 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 11:39:39,790 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 [2019-11-21 11:39:39,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:40,086 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-21 11:39:40,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:40,452 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-21 11:39:40,906 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 11:39:41,147 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 11:39:41,425 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 11:39:41,479 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:39:41,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [463909208] [2019-11-21 11:39:41,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:41,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 11:39:41,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597077002] [2019-11-21 11:39:41,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 11:39:41,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 11:39:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-21 11:39:41,481 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 16 states. [2019-11-21 11:39:43,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:43,331 INFO L93 Difference]: Finished difference Result 135 states and 142 transitions. [2019-11-21 11:39:43,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 11:39:43,332 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-21 11:39:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:43,333 INFO L225 Difference]: With dead ends: 135 [2019-11-21 11:39:43,333 INFO L226 Difference]: Without dead ends: 135 [2019-11-21 11:39:43,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2019-11-21 11:39:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-21 11:39:43,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 125. [2019-11-21 11:39:43,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-11-21 11:39:43,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 142 transitions. [2019-11-21 11:39:43,339 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 142 transitions. Word has length 23 [2019-11-21 11:39:43,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:43,339 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 142 transitions. [2019-11-21 11:39:43,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 11:39:43,340 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 142 transitions. [2019-11-21 11:39:43,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 11:39:43,340 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:43,341 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] [2019-11-21 11:39:43,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:43,551 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:43,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:43,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1455614589, now seen corresponding path program 1 times [2019-11-21 11:39:43,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:43,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1072751180] [2019-11-21 11:39:43,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 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:43,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 11:39:43,848 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:43,902 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:39:43,903 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:39:43,903 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:43,937 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 11:39:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:43,940 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:39:43,940 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-21 11:39:43,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:43,970 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:39:43,970 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:43,978 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:43,982 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:43,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:43,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:43,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:43,989 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 11:39:44,013 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:39:44,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:44,024 INFO L567 ElimStorePlain]: treesize reduction 5, result has 64.3 percent of original size [2019-11-21 11:39:44,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:44,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:5 [2019-11-21 11:39:44,065 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:39:44,065 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:44,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:44,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:44,241 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 38 treesize of output 32 [2019-11-21 11:39:44,241 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:44,251 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 35 treesize of output 29 [2019-11-21 11:39:44,252 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:44,254 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 11:39:44,255 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:44,257 WARN L227 Elim1Store]: Array PQE input equivalent to true [2019-11-21 11:39:44,257 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:44,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:44,278 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.base)_BEFORE_CALL_6| vanished before elimination [2019-11-21 11:39:44,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-21 11:39:44,279 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:137, output treesize:54 [2019-11-21 11:39:44,419 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:39:44,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1072751180] [2019-11-21 11:39:44,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:44,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-21 11:39:44,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998607771] [2019-11-21 11:39:44,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 11:39:44,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:44,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 11:39:44,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-21 11:39:44,421 INFO L87 Difference]: Start difference. First operand 125 states and 142 transitions. Second operand 12 states. [2019-11-21 11:39:45,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:45,748 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2019-11-21 11:39:45,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 11:39:45,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2019-11-21 11:39:45,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:45,751 INFO L225 Difference]: With dead ends: 145 [2019-11-21 11:39:45,752 INFO L226 Difference]: Without dead ends: 145 [2019-11-21 11:39:45,752 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2019-11-21 11:39:45,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-11-21 11:39:45,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2019-11-21 11:39:45,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-21 11:39:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 148 transitions. [2019-11-21 11:39:45,758 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 148 transitions. Word has length 26 [2019-11-21 11:39:45,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:45,758 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 148 transitions. [2019-11-21 11:39:45,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 11:39:45,759 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 148 transitions. [2019-11-21 11:39:45,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-21 11:39:45,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:45,760 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] [2019-11-21 11:39:45,960 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:45,961 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:45,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:45,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1455614590, now seen corresponding path program 1 times [2019-11-21 11:39:45,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:45,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [357642505] [2019-11-21 11:39:45,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:46,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-21 11:39:46,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:46,274 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:46,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:46,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:46,291 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:46,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:46,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:46,299 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:46,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:10 [2019-11-21 11:39:46,319 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:39:46,320 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:46,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:46,339 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:39:46,339 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:46,346 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:46,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:46,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:10 [2019-11-21 11:39:46,378 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:39:46,378 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:46,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:46,544 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:39:46,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [357642505] [2019-11-21 11:39:46,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:46,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2019-11-21 11:39:46,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952185810] [2019-11-21 11:39:46,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 11:39:46,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:46,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 11:39:46,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-21 11:39:46,546 INFO L87 Difference]: Start difference. First operand 131 states and 148 transitions. Second operand 11 states. [2019-11-21 11:39:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:47,222 INFO L93 Difference]: Finished difference Result 123 states and 129 transitions. [2019-11-21 11:39:47,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 11:39:47,223 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2019-11-21 11:39:47,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:47,224 INFO L225 Difference]: With dead ends: 123 [2019-11-21 11:39:47,224 INFO L226 Difference]: Without dead ends: 123 [2019-11-21 11:39:47,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-11-21 11:39:47,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-21 11:39:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-11-21 11:39:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-21 11:39:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2019-11-21 11:39:47,230 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 26 [2019-11-21 11:39:47,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:47,230 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2019-11-21 11:39:47,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 11:39:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2019-11-21 11:39:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 11:39:47,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:47,232 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:39:47,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:47,435 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:47,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:47,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1439813039, now seen corresponding path program 1 times [2019-11-21 11:39:47,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:47,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1669568746] [2019-11-21 11:39:47,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:47,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:47,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 11:39:47,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:47,783 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:39:47,783 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:39:47,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,824 INFO L567 ElimStorePlain]: treesize reduction 10, result has 75.0 percent of original size [2019-11-21 11:39:47,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:47,826 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:39:47,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:30 [2019-11-21 11:39:47,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:47,861 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:39:47,861 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:47,874 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:47,874 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,879 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:47,879 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,879 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 11:39:47,903 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:39:47,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,912 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:47,915 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:47,916 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:47,920 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,920 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:19, output treesize:7 [2019-11-21 11:39:47,980 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:47,981 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:47,984 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:47,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2019-11-21 11:39:48,014 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:39:48,014 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:48,214 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:39:48,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1669568746] [2019-11-21 11:39:48,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:48,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 6] imperfect sequences [] total 12 [2019-11-21 11:39:48,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238797412] [2019-11-21 11:39:48,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 11:39:48,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:48,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 11:39:48,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2019-11-21 11:39:48,216 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand 13 states. [2019-11-21 11:39:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:49,294 INFO L93 Difference]: Finished difference Result 143 states and 145 transitions. [2019-11-21 11:39:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-21 11:39:49,294 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2019-11-21 11:39:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:49,295 INFO L225 Difference]: With dead ends: 143 [2019-11-21 11:39:49,295 INFO L226 Difference]: Without dead ends: 143 [2019-11-21 11:39:49,296 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=288, Unknown=0, NotChecked=0, Total=420 [2019-11-21 11:39:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-11-21 11:39:49,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 129. [2019-11-21 11:39:49,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-21 11:39:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-11-21 11:39:49,303 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 28 [2019-11-21 11:39:49,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:49,304 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-11-21 11:39:49,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 11:39:49,304 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-11-21 11:39:49,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-21 11:39:49,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:49,305 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:39:49,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:49,506 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:49,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:49,507 INFO L82 PathProgramCache]: Analyzing trace with hash -1439813038, now seen corresponding path program 1 times [2019-11-21 11:39:49,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:49,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [589410388] [2019-11-21 11:39:49,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:49,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:49,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 11:39:49,806 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:49,821 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 11:39:49,821 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 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 11:39:49,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:49,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:49,833 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:39:49,833 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:21 [2019-11-21 11:39:49,866 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:39:49,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:49,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:49,880 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:49,880 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:49,886 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:49,887 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:49,887 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2019-11-21 11:39:49,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:49,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:49,920 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:49,921 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:49,921 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:12 [2019-11-21 11:39:50,004 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:50,004 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:50,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:50,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:50,010 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:9 [2019-11-21 11:39:50,065 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:39:50,066 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:50,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:50,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:50,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:50,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:50,982 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 42 treesize of output 40 [2019-11-21 11:39:50,982 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:39:51,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:51,072 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2019-11-21 11:39:51,072 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:51,138 INFO L567 ElimStorePlain]: treesize reduction 41, result has 45.3 percent of original size [2019-11-21 11:39:51,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:51,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:84, output treesize:34 [2019-11-21 11:39:51,283 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:39:51,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [589410388] [2019-11-21 11:39:51,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:51,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 11] imperfect sequences [] total 21 [2019-11-21 11:39:51,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917590313] [2019-11-21 11:39:51,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-21 11:39:51,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:51,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-21 11:39:51,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=342, Unknown=0, NotChecked=0, Total=462 [2019-11-21 11:39:51,285 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 22 states. [2019-11-21 11:39:53,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:53,459 INFO L93 Difference]: Finished difference Result 128 states and 138 transitions. [2019-11-21 11:39:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-21 11:39:53,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 28 [2019-11-21 11:39:53,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:53,461 INFO L225 Difference]: With dead ends: 128 [2019-11-21 11:39:53,461 INFO L226 Difference]: Without dead ends: 109 [2019-11-21 11:39:53,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=260, Invalid=610, Unknown=0, NotChecked=0, Total=870 [2019-11-21 11:39:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-21 11:39:53,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-21 11:39:53,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-21 11:39:53,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2019-11-21 11:39:53,465 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 28 [2019-11-21 11:39:53,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:53,466 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2019-11-21 11:39:53,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-21 11:39:53,466 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2019-11-21 11:39:53,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 11:39:53,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:53,467 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:39:53,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:53,671 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:53,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:53,672 INFO L82 PathProgramCache]: Analyzing trace with hash -540919935, now seen corresponding path program 1 times [2019-11-21 11:39:53,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:53,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1547667045] [2019-11-21 11:39:53,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:54,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-21 11:39:54,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:54,028 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:54,028 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:54,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:54,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:54,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-21 11:39:54,037 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:39:54,038 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:54,041 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:54,042 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:54,042 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 11:39:54,247 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:39:54,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:54,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:54,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:54,259 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:16 [2019-11-21 11:39:54,391 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-21 11:39:54,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:54,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:54,396 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:54,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:11 [2019-11-21 11:39:54,436 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:39:54,436 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:39:55,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2019-11-21 11:39:55,190 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:39:55,201 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2019-11-21 11:39:55,202 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:55,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:55,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-21 11:39:55,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:70, output treesize:94 [2019-11-21 11:39:55,438 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2019-11-21 11:39:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:39:55,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:39:55,442 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2019-11-21 11:39:55,556 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2019-11-21 11:39:55,556 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:39:55,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:55,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:55,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:42 [2019-11-21 11:39:56,094 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2019-11-21 11:39:56,210 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:39:56,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1547667045] [2019-11-21 11:39:56,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:39:56,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 24 [2019-11-21 11:39:56,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591201920] [2019-11-21 11:39:56,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-21 11:39:56,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:39:56,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-21 11:39:56,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2019-11-21 11:39:56,212 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand 25 states. [2019-11-21 11:39:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:39:58,414 INFO L93 Difference]: Finished difference Result 119 states and 121 transitions. [2019-11-21 11:39:58,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 11:39:58,415 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 35 [2019-11-21 11:39:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:39:58,416 INFO L225 Difference]: With dead ends: 119 [2019-11-21 11:39:58,416 INFO L226 Difference]: Without dead ends: 119 [2019-11-21 11:39:58,417 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=230, Invalid=1252, Unknown=0, NotChecked=0, Total=1482 [2019-11-21 11:39:58,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-21 11:39:58,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 108. [2019-11-21 11:39:58,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-21 11:39:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 118 transitions. [2019-11-21 11:39:58,422 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 118 transitions. Word has length 35 [2019-11-21 11:39:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:39:58,422 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 118 transitions. [2019-11-21 11:39:58,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-21 11:39:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 118 transitions. [2019-11-21 11:39:58,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-21 11:39:58,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:39:58,423 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:39:58,627 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:58,627 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:39:58,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:39:58,628 INFO L82 PathProgramCache]: Analyzing trace with hash -540919934, now seen corresponding path program 1 times [2019-11-21 11:39:58,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:39:58,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1280406779] [2019-11-21 11:39:58,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:39:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:39:58,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-21 11:39:58,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:39:59,002 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:39:59,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:59,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,006 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-21 11:39:59,022 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:39:59,022 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,030 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:59,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,031 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-21 11:39:59,189 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:39:59,189 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:59,209 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:39:59,210 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:59,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:39:59,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:23 [2019-11-21 11:39:59,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-21 11:39:59,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:59,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:39:59,409 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,414 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:39:59,414 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:39:59,415 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-21 11:39:59,479 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:39:59,479 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:40:00,596 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 11:40:01,694 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2019-11-21 11:40:01,713 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:01,915 WARN L192 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 11:40:01,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:01,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:01,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:01,925 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:02,085 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 11:40:02,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:02,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:02,103 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:02,104 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:02,253 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-11-21 11:40:02,254 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:02,260 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:02,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:02,263 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:02,387 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:40:02,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:02,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 11:40:02,388 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-21 11:40:02,657 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:40:02,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:02,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:02,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:03,217 WARN L192 SmtUtils]: Spent 331.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 36 [2019-11-21 11:40:03,252 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-11-21 11:40:03,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:03,459 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 11:40:03,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:03,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:03,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:03,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:03,650 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 11:40:03,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:03,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:03,658 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:03,659 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:03,817 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 11:40:03,818 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:03,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:03,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:03,829 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:03,955 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:40:03,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:03,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-21 11:40:03,956 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:157, output treesize:104 [2019-11-21 11:40:04,254 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 11:40:04,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:40:04,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1280406779] [2019-11-21 11:40:04,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:40:04,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15, 12] imperfect sequences [] total 26 [2019-11-21 11:40:04,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580238029] [2019-11-21 11:40:04,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-21 11:40:04,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:40:04,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-21 11:40:04,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2019-11-21 11:40:04,738 INFO L87 Difference]: Start difference. First operand 108 states and 118 transitions. Second operand 27 states. [2019-11-21 11:40:09,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:40:09,721 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2019-11-21 11:40:09,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-21 11:40:09,722 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 35 [2019-11-21 11:40:09,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:40:09,723 INFO L225 Difference]: With dead ends: 105 [2019-11-21 11:40:09,723 INFO L226 Difference]: Without dead ends: 105 [2019-11-21 11:40:09,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=199, Invalid=1441, Unknown=0, NotChecked=0, Total=1640 [2019-11-21 11:40:09,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-21 11:40:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2019-11-21 11:40:09,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 11:40:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2019-11-21 11:40:09,727 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 35 [2019-11-21 11:40:09,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:40:09,728 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2019-11-21 11:40:09,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-21 11:40:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2019-11-21 11:40:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-21 11:40:09,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:40:09,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:40:09,933 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:09,933 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:40:09,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:40:09,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1917126943, now seen corresponding path program 1 times [2019-11-21 11:40:09,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:40:09,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [522686922] [2019-11-21 11:40:09,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:10,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:40:10,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-21 11:40:10,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:40:10,356 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:40:10,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:10,359 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,359 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:3 [2019-11-21 11:40:10,375 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:40:10,376 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:10,386 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-21 11:40:10,550 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:40:10,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:10,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:40:10,572 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:10,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:10,589 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:25 [2019-11-21 11:40:10,738 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2019-11-21 11:40:10,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:10,750 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-21 11:40:10,750 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:10,757 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:40:10,758 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:31, output treesize:9 [2019-11-21 11:40:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:10,889 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:40:12,258 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-21 11:40:13,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:13,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 83 [2019-11-21 11:40:13,462 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:40:13,490 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 102 [2019-11-21 11:40:13,490 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:14,410 WARN L192 SmtUtils]: Spent 918.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-11-21 11:40:14,410 INFO L567 ElimStorePlain]: treesize reduction 32, result has 92.6 percent of original size [2019-11-21 11:40:14,449 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 65 [2019-11-21 11:40:14,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,464 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:14,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:14,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:14,477 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:14,506 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2019-11-21 11:40:14,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:14,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:14,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:14,523 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:14,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:14,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:14,542 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:14,571 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2019-11-21 11:40:14,576 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:14,605 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:14,613 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:14,616 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:15,464 WARN L192 SmtUtils]: Spent 847.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-11-21 11:40:15,465 INFO L567 ElimStorePlain]: treesize reduction 98, result has 70.7 percent of original size [2019-11-21 11:40:15,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-21 11:40:15,465 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:384, output treesize:236 [2019-11-21 11:40:16,210 WARN L192 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-21 11:40:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:16,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-21 11:40:16,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:16,304 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2019-11-21 11:40:18,581 WARN L192 SmtUtils]: Spent 1.63 s on a formula simplification. DAG size of input: 103 DAG size of output: 45 [2019-11-21 11:40:18,629 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 43 [2019-11-21 11:40:18,632 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:19,096 WARN L192 SmtUtils]: Spent 463.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2019-11-21 11:40:19,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:19,133 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 62 [2019-11-21 11:40:19,135 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:19,536 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2019-11-21 11:40:19,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:19,548 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:19,551 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:19,552 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:19,919 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification that was a NOOP. DAG size: 88 [2019-11-21 11:40:19,919 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:19,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:19,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:19,938 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:20,295 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 11:40:20,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:20,308 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:20,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:20,312 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:20,643 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-11-21 11:40:20,643 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:20,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:20,655 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:20,657 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:20,943 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-11-21 11:40:20,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:20,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:20,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:20,956 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:21,209 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-21 11:40:21,209 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:21,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:21,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:21,221 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:21,456 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 11:40:21,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:21,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-2 vars, End of recursive call: and 6 xjuncts. [2019-11-21 11:40:21,457 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:352, output treesize:198 [2019-11-21 11:40:21,889 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2019-11-21 11:40:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 11:40:22,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [522686922] [2019-11-21 11:40:22,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 11:40:22,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17, 15] imperfect sequences [] total 31 [2019-11-21 11:40:22,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628667259] [2019-11-21 11:40:22,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-21 11:40:22,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 11:40:22,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-21 11:40:22,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2019-11-21 11:40:22,455 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand 32 states. [2019-11-21 11:40:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 11:40:29,025 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-11-21 11:40:29,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-21 11:40:29,026 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2019-11-21 11:40:29,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 11:40:29,027 INFO L225 Difference]: With dead ends: 103 [2019-11-21 11:40:29,027 INFO L226 Difference]: Without dead ends: 103 [2019-11-21 11:40:29,028 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2019-11-21 11:40:29,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-11-21 11:40:29,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2019-11-21 11:40:29,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-21 11:40:29,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2019-11-21 11:40:29,031 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 40 [2019-11-21 11:40:29,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 11:40:29,031 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2019-11-21 11:40:29,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-21 11:40:29,032 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2019-11-21 11:40:29,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-21 11:40:29,032 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 11:40:29,033 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 11:40:29,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:29,237 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, free_13Err7REQUIRES_VIOLATION, free_13Err1REQUIRES_VIOLATION, free_13Err0REQUIRES_VIOLATION, free_13Err6ASSERT_VIOLATIONMEMORY_FREE, free_13Err4ASSERT_VIOLATIONMEMORY_FREE, free_13Err5ASSERT_VIOLATIONMEMORY_FREE, free_13Err3REQUIRES_VIOLATION, free_13Err8REQUIRES_VIOLATION, free_13Err2REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 11:40:29,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 11:40:29,237 INFO L82 PathProgramCache]: Analyzing trace with hash 1221359288, now seen corresponding path program 1 times [2019-11-21 11:40:29,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 11:40:29,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [886154183] [2019-11-21 11:40:29,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 11:40:29,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-21 11:40:29,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 11:40:29,776 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 11:40:29,776 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:40:29,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:29,819 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.7 percent of original size [2019-11-21 11:40:29,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:29,821 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:40:29,821 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:33 [2019-11-21 11:40:29,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:29,858 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:40:29,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:29,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:29,878 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-11-21 11:40:29,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:29,892 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:29,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:40:29,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:10 [2019-11-21 11:40:30,167 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:40:30,168 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:30,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:30,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:30,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2019-11-21 11:40:30,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:30,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 20 [2019-11-21 11:40:30,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:30,297 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:30,298 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:30,298 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2019-11-21 11:40:30,381 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_267|], 6=[|v_#memory_$Pointer$.base_315|]} [2019-11-21 11:40:30,388 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-21 11:40:30,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:30,420 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:30,430 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 11:40:30,494 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:30,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 84 [2019-11-21 11:40:30,495 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:30,620 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-11-21 11:40:30,621 INFO L567 ElimStorePlain]: treesize reduction 46, result has 51.6 percent of original size [2019-11-21 11:40:30,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:30,622 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:49 [2019-11-21 11:40:30,999 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-21 11:40:31,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:31,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:31,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-21 11:40:31,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:31,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:31,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-21 11:40:31,178 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:31,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:31,198 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:31,199 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:57 [2019-11-21 11:40:31,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 25 treesize of output 9 [2019-11-21 11:40:31,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:31,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:31,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:31,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:77, output treesize:56 [2019-11-21 11:40:31,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:31,573 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 35 [2019-11-21 11:40:31,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:31,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:31,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 11:40:31,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:57, output treesize:5 [2019-11-21 11:40:31,707 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:40:31,707 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 11:40:32,227 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-21 11:40:32,507 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 11:40:32,675 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 11:40:32,943 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 11:40:33,052 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-21 11:40:33,251 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-21 11:40:33,426 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 11:40:33,698 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-21 11:40:33,886 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-11-21 11:40:34,005 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:34,006 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 56 treesize of output 60 [2019-11-21 11:40:34,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:34,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:34,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:34,030 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:34,063 INFO L567 ElimStorePlain]: treesize reduction 10, result has 67.7 percent of original size [2019-11-21 11:40:34,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:34,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 11:40:34,065 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:21 [2019-11-21 11:40:34,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:34,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:34,551 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-11-21 11:40:34,652 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-21 11:40:34,829 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 11:40:34,999 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 11:40:35,259 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-21 11:40:35,547 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2019-11-21 11:40:35,698 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 11:40:35,788 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:35,788 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 76 treesize of output 80 [2019-11-21 11:40:35,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:35,789 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:35,847 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:35,848 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 79 treesize of output 83 [2019-11-21 11:40:35,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:35,849 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:35,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:35,900 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 78 treesize of output 82 [2019-11-21 11:40:35,901 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:35,902 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:35,971 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:35,972 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 77 treesize of output 81 [2019-11-21 11:40:35,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:35,973 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:36,041 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:36,041 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 78 treesize of output 82 [2019-11-21 11:40:36,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:36,042 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:36,304 WARN L192 SmtUtils]: Spent 261.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-11-21 11:40:36,305 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 11:40:36,317 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 11:40:36,331 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:36,338 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 11:40:36,352 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:36,358 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 11:40:36,370 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:36,377 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 11:40:36,389 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:36,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 11:40:36,403 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-21 11:40:36,739 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-21 11:40:36,740 INFO L567 ElimStorePlain]: treesize reduction 60, result has 69.1 percent of original size [2019-11-21 11:40:36,740 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2019-11-21 11:40:36,740 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:389, output treesize:134 [2019-11-21 11:40:37,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 11:40:37,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:37,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:37,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:37,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:37,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:37,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:37,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 11:40:37,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:37,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 11:40:37,013 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 16 [2019-11-21 11:40:37,022 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 14 [2019-11-21 11:40:37,233 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 11:40:37,234 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:40:37,238 INFO L168 Benchmark]: Toolchain (without parser) took 436974.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 957.7 MB in the beginning and 873.5 MB in the end (delta: 84.1 MB). Peak memory consumption was 276.0 MB. Max. memory is 11.5 GB. [2019-11-21 11:40:37,239 INFO L168 Benchmark]: CDTParser took 0.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 11:40:37,239 INFO L168 Benchmark]: CACSL2BoogieTranslator took 929.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-21 11:40:37,239 INFO L168 Benchmark]: Boogie Preprocessor took 137.08 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-21 11:40:37,240 INFO L168 Benchmark]: RCFGBuilder took 1631.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.8 MB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 11.5 GB. [2019-11-21 11:40:37,240 INFO L168 Benchmark]: TraceAbstraction took 434272.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 970.8 MB in the beginning and 873.5 MB in the end (delta: 97.3 MB). Peak memory consumption was 149.7 MB. Max. memory is 11.5 GB. [2019-11-21 11:40:37,242 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.52 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 929.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -142.4 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 137.08 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1631.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 970.8 MB in the end (delta: 117.3 MB). Peak memory consumption was 117.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 434272.09 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 970.8 MB in the beginning and 873.5 MB in the end (delta: 97.3 MB). Peak memory consumption was 149.7 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...