./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i --full-output --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 264dba86 Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a86b9fab61553f9a54467f5b62ac500f38719cf --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 13:00:59,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 13:00:59,092 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 13:00:59,110 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 13:00:59,111 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 13:00:59,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 13:00:59,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 13:00:59,126 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 13:00:59,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 13:00:59,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 13:00:59,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 13:00:59,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 13:00:59,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 13:00:59,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 13:00:59,141 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 13:00:59,142 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 13:00:59,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 13:00:59,144 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 13:00:59,147 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 13:00:59,151 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 13:00:59,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 13:00:59,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 13:00:59,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 13:00:59,162 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 13:00:59,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 13:00:59,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 13:00:59,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 13:00:59,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 13:00:59,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 13:00:59,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 13:00:59,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 13:00:59,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 13:00:59,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 13:00:59,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 13:00:59,176 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 13:00:59,176 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 13:00:59,177 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 13:00:59,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 13:00:59,178 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 13:00:59,179 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 13:00:59,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 13:00:59,181 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 13:00:59,209 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 13:00:59,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 13:00:59,219 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 13:00:59,219 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 13:00:59,219 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 13:00:59,219 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 13:00:59,220 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 13:00:59,220 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 13:00:59,220 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 13:00:59,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 13:00:59,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 13:00:59,221 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 13:00:59,221 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 13:00:59,221 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 13:00:59,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 13:00:59,221 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 13:00:59,222 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 13:00:59,222 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 13:00:59,222 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 13:00:59,222 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 13:00:59,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 13:00:59,225 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 13:00:59,225 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 13:00:59,225 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 13:00:59,225 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 13:00:59,226 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 13:00:59,226 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 13:00:59,226 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 13:00:59,226 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 13:00:59,226 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2a86b9fab61553f9a54467f5b62ac500f38719cf Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 13:00:59,521 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 13:00:59,534 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 13:00:59,538 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 13:00:59,539 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 13:00:59,539 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 13:00:59,540 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-21 13:00:59,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f24831e/b5a44dc6a2194375bed00bb45a7b29ce/FLAG274144491 [2019-11-21 13:01:00,193 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 13:01:00,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test22_2-1.i [2019-11-21 13:01:00,212 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f24831e/b5a44dc6a2194375bed00bb45a7b29ce/FLAG274144491 [2019-11-21 13:01:00,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f24831e/b5a44dc6a2194375bed00bb45a7b29ce [2019-11-21 13:01:00,439 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 13:01:00,441 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 13:01:00,442 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 13:01:00,442 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 13:01:00,454 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 13:01:00,455 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:01:00" (1/1) ... [2019-11-21 13:01:00,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12d183b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:00, skipping insertion in model container [2019-11-21 13:01:00,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:01:00" (1/1) ... [2019-11-21 13:01:00,466 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 13:01:00,538 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:01:00,937 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 13:01:00,937 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 13:01:00,938 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:01:00,965 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 13:01:00,965 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 13:01:00,966 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:01:00,971 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 13:01:00,972 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 13:01:00,972 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:01:00,976 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 13:01:00,977 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 13:01:00,977 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:01:01,015 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 13:01:01,016 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 13:01:01,016 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 13:01:01,035 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:01:01,068 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 13:01:01,084 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 13:01:01,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:01:01,162 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 13:01:01,232 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 13:01:01,321 INFO L205 MainTranslator]: Completed translation [2019-11-21 13:01:01,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01 WrapperNode [2019-11-21 13:01:01,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 13:01:01,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 13:01:01,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 13:01:01,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 13:01:01,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (1/1) ... [2019-11-21 13:01:01,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (1/1) ... [2019-11-21 13:01:01,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (1/1) ... [2019-11-21 13:01:01,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (1/1) ... [2019-11-21 13:01:01,397 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (1/1) ... [2019-11-21 13:01:01,404 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (1/1) ... [2019-11-21 13:01:01,411 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (1/1) ... [2019-11-21 13:01:01,422 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 13:01:01,422 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 13:01:01,422 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 13:01:01,422 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 13:01:01,423 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (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 13:01:01,481 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 13:01:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 13:01:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 13:01:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 13:01:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 13:01:01,482 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 13:01:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 13:01:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 13:01:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 13:01:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 13:01:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 13:01:01,483 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 13:01:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 13:01:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 13:01:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 13:01:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 13:01:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 13:01:01,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 13:01:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 13:01:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 13:01:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 13:01:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 13:01:01,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 13:01:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 13:01:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 13:01:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 13:01:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 13:01:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 13:01:01,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 13:01:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 13:01:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 13:01:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 13:01:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 13:01:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 13:01:01,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 13:01:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 13:01:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 13:01:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 13:01:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 13:01:01,488 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 13:01:01,489 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 13:01:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 13:01:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 13:01:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 13:01:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 13:01:01,490 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 13:01:01,490 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 13:01:01,490 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 13:01:01,490 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 13:01:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 13:01:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 13:01:01,491 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 13:01:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 13:01:01,492 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 13:01:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 13:01:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 13:01:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 13:01:01,493 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 13:01:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 13:01:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 13:01:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 13:01:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 13:01:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 13:01:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 13:01:01,494 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 13:01:01,495 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 13:01:01,496 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 13:01:01,497 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 13:01:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 13:01:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 13:01:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 13:01:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 13:01:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 13:01:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 13:01:01,498 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 13:01:01,499 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 13:01:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 13:01:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 13:01:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 13:01:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 13:01:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 13:01:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 13:01:01,500 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 13:01:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 13:01:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 13:01:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 13:01:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 13:01:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 13:01:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 13:01:01,501 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 13:01:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 13:01:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 13:01:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 13:01:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 13:01:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 13:01:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 13:01:01,502 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 13:01:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 13:01:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 13:01:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 13:01:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 13:01:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 13:01:01,503 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 13:01:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 13:01:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 13:01:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 13:01:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 13:01:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 13:01:01,504 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 13:01:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 13:01:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 13:01:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 13:01:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 13:01:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 13:01:01,505 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 13:01:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 13:01:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 13:01:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 13:01:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 13:01:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 13:01:01,506 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 13:01:01,507 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 13:01:01,507 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 13:01:01,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 13:01:01,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 13:01:01,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 13:01:01,507 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 13:01:01,508 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 13:01:01,508 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 13:01:01,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 13:01:01,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 13:01:01,508 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 13:01:01,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 13:01:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 13:01:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 13:01:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 13:01:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 13:01:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 13:01:01,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 13:01:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 13:01:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 13:01:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 13:01:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 13:01:01,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 13:01:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 13:01:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 13:01:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 13:01:01,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 13:01:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 13:01:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 13:01:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 13:01:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 13:01:01,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 13:01:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 13:01:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 13:01:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 13:01:01,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 13:01:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 13:01:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 13:01:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 13:01:01,514 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 13:01:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 13:01:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 13:01:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 13:01:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 13:01:01,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 13:01:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 13:01:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 13:01:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 13:01:01,516 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 13:01:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 13:01:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 13:01:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 13:01:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 13:01:01,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 13:01:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 13:01:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 13:01:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 13:01:01,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 13:01:01,519 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 13:01:02,182 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 13:01:02,565 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 13:01:02,910 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 13:01:02,911 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-21 13:01:02,913 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:01:02 BoogieIcfgContainer [2019-11-21 13:01:02,913 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 13:01:02,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 13:01:02,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 13:01:02,919 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 13:01:02,920 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:01:00" (1/3) ... [2019-11-21 13:01:02,921 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d07e0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:01:02, skipping insertion in model container [2019-11-21 13:01:02,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:01:01" (2/3) ... [2019-11-21 13:01:02,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d07e0f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:01:02, skipping insertion in model container [2019-11-21 13:01:02,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:01:02" (3/3) ... [2019-11-21 13:01:02,924 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test22_2-1.i [2019-11-21 13:01:02,936 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 13:01:02,946 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-21 13:01:02,958 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-21 13:01:02,980 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 13:01:02,980 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 13:01:02,981 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 13:01:02,981 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 13:01:02,981 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 13:01:02,981 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 13:01:02,981 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 13:01:02,982 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 13:01:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states. [2019-11-21 13:01:03,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 13:01:03,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:03,011 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 13:01:03,012 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:03,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:03,019 INFO L82 PathProgramCache]: Analyzing trace with hash 120577495, now seen corresponding path program 1 times [2019-11-21 13:01:03,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:03,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [497674568] [2019-11-21 13:01:03,032 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 13:01:03,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:03,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:01:03,421 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:03,506 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 13:01:03,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:03,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:03,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:03,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:01:03,559 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 13:01:03,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:03,634 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 13:01:03,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [497674568] [2019-11-21 13:01:03,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:03,637 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-21 13:01:03,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034267317] [2019-11-21 13:01:03,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:01:03,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:03,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:01:03,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:01:03,675 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 5 states. [2019-11-21 13:01:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:04,091 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2019-11-21 13:01:04,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:01:04,094 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-21 13:01:04,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:04,128 INFO L225 Difference]: With dead ends: 74 [2019-11-21 13:01:04,131 INFO L226 Difference]: Without dead ends: 71 [2019-11-21 13:01:04,135 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:01:04,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-21 13:01:04,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2019-11-21 13:01:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-21 13:01:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2019-11-21 13:01:04,208 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 17 [2019-11-21 13:01:04,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:04,209 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2019-11-21 13:01:04,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:01:04,210 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2019-11-21 13:01:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 13:01:04,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:04,213 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 13:01:04,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:04,417 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:04,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:04,418 INFO L82 PathProgramCache]: Analyzing trace with hash 120577496, now seen corresponding path program 1 times [2019-11-21 13:01:04,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:04,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [413964100] [2019-11-21 13:01:04,419 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 13:01:04,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:04,698 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-21 13:01:04,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:04,716 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 13:01:04,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:04,723 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:04,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:04,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:01:04,769 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 13:01:04,769 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:05,110 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 13:01:05,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [413964100] [2019-11-21 13:01:05,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:05,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-21 13:01:05,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847252908] [2019-11-21 13:01:05,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 13:01:05,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:05,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 13:01:05,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:01:05,114 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand 10 states. [2019-11-21 13:01:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:05,632 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2019-11-21 13:01:05,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:01:05,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-11-21 13:01:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:05,635 INFO L225 Difference]: With dead ends: 70 [2019-11-21 13:01:05,635 INFO L226 Difference]: Without dead ends: 70 [2019-11-21 13:01:05,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-11-21 13:01:05,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-21 13:01:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-11-21 13:01:05,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-21 13:01:05,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2019-11-21 13:01:05,647 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 17 [2019-11-21 13:01:05,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:05,648 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2019-11-21 13:01:05,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 13:01:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2019-11-21 13:01:05,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 13:01:05,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:05,649 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 13:01:05,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:05,863 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:05,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:05,863 INFO L82 PathProgramCache]: Analyzing trace with hash 149206646, now seen corresponding path program 1 times [2019-11-21 13:01:05,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:05,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [930410772] [2019-11-21 13:01:05,865 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 13:01:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:06,144 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 13:01:06,146 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:06,197 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 13:01:06,200 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:06,250 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 13:01:06,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [930410772] [2019-11-21 13:01:06,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:06,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 13:01:06,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036860293] [2019-11-21 13:01:06,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:01:06,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:06,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:01:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:01:06,254 INFO L87 Difference]: Start difference. First operand 65 states and 71 transitions. Second operand 5 states. [2019-11-21 13:01:06,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:06,281 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2019-11-21 13:01:06,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:01:06,283 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-21 13:01:06,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:06,284 INFO L225 Difference]: With dead ends: 64 [2019-11-21 13:01:06,286 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 13:01:06,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:01:06,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 13:01:06,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-21 13:01:06,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 13:01:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2019-11-21 13:01:06,303 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2019-11-21 13:01:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:06,303 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2019-11-21 13:01:06,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:01:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2019-11-21 13:01:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 13:01:06,305 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:06,306 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:06,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:06,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:06,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:06,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1768010814, now seen corresponding path program 1 times [2019-11-21 13:01:06,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:06,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1562548704] [2019-11-21 13:01:06,513 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 13:01:06,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:06,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:01:06,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:06,768 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 13:01:06,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:06,882 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 13:01:06,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1562548704] [2019-11-21 13:01:06,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:06,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 13:01:06,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338266183] [2019-11-21 13:01:06,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 13:01:06,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:06,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 13:01:06,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:01:06,885 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 5 states. [2019-11-21 13:01:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:06,908 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2019-11-21 13:01:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 13:01:06,910 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-21 13:01:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:06,911 INFO L225 Difference]: With dead ends: 64 [2019-11-21 13:01:06,911 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 13:01:06,911 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 13:01:06,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 13:01:06,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-21 13:01:06,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 13:01:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-21 13:01:06,925 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 22 [2019-11-21 13:01:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:06,926 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-21 13:01:06,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 13:01:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-21 13:01:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-21 13:01:06,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:06,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:07,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:07,138 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:07,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash 730005123, now seen corresponding path program 1 times [2019-11-21 13:01:07,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:07,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [50883264] [2019-11-21 13:01:07,139 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 13:01:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:07,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-21 13:01:07,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:07,390 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 13:01:07,390 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:07,489 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 13:01:07,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [50883264] [2019-11-21 13:01:07,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:07,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-21 13:01:07,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925780209] [2019-11-21 13:01:07,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-21 13:01:07,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-21 13:01:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 13:01:07,493 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 3 states. [2019-11-21 13:01:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:07,592 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-21 13:01:07,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-21 13:01:07,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-21 13:01:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:07,594 INFO L225 Difference]: With dead ends: 68 [2019-11-21 13:01:07,595 INFO L226 Difference]: Without dead ends: 58 [2019-11-21 13:01:07,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-21 13:01:07,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-21 13:01:07,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-21 13:01:07,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-21 13:01:07,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-21 13:01:07,606 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 22 [2019-11-21 13:01:07,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:07,606 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-21 13:01:07,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-21 13:01:07,607 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-21 13:01:07,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-21 13:01:07,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:07,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:07,813 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:07,813 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:07,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:07,814 INFO L82 PathProgramCache]: Analyzing trace with hash -734714589, now seen corresponding path program 1 times [2019-11-21 13:01:07,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:07,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [529917507] [2019-11-21 13:01:07,814 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 13:01:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:08,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-21 13:01:08,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:08,106 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 13:01:08,109 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:08,168 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 13:01:08,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [529917507] [2019-11-21 13:01:08,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:08,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-21 13:01:08,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507475115] [2019-11-21 13:01:08,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 13:01:08,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 13:01:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-21 13:01:08,173 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 6 states. [2019-11-21 13:01:08,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:08,222 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2019-11-21 13:01:08,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-21 13:01:08,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-21 13:01:08,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:08,226 INFO L225 Difference]: With dead ends: 64 [2019-11-21 13:01:08,226 INFO L226 Difference]: Without dead ends: 60 [2019-11-21 13:01:08,227 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-21 13:01:08,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-11-21 13:01:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-11-21 13:01:08,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-21 13:01:08,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2019-11-21 13:01:08,232 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 32 [2019-11-21 13:01:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:08,233 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2019-11-21 13:01:08,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 13:01:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2019-11-21 13:01:08,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-21 13:01:08,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:08,235 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:08,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:08,440 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1771101565, now seen corresponding path program 1 times [2019-11-21 13:01:08,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:08,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [804610494] [2019-11-21 13:01:08,441 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 13:01:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:08,738 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 13:01:08,740 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:08,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:08,768 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:08,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:08,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [804610494] [2019-11-21 13:01:08,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:01:08,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-21 13:01:08,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914587709] [2019-11-21 13:01:08,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-21 13:01:08,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:08,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-21 13:01:08,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-21 13:01:08,910 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand 10 states. [2019-11-21 13:01:09,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:09,143 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-21 13:01:09,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 13:01:09,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2019-11-21 13:01:09,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:09,144 INFO L225 Difference]: With dead ends: 68 [2019-11-21 13:01:09,145 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 13:01:09,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:01:09,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 13:01:09,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2019-11-21 13:01:09,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-21 13:01:09,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2019-11-21 13:01:09,150 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 34 [2019-11-21 13:01:09,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:09,150 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2019-11-21 13:01:09,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-21 13:01:09,150 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2019-11-21 13:01:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-21 13:01:09,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:09,151 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:09,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:09,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1571056317, now seen corresponding path program 2 times [2019-11-21 13:01:09,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:09,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [60002397] [2019-11-21 13:01:09,366 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:09,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-21 13:01:09,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 13:01:09,685 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 13:01:09,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:09,700 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 13:01:09,700 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:09,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:09,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:09,704 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:01:09,875 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-21 13:01:09,875 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:10,006 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-21 13:01:10,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [60002397] [2019-11-21 13:01:10,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:10,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 9] imperfect sequences [] total 12 [2019-11-21 13:01:10,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033016838] [2019-11-21 13:01:10,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 13:01:10,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:10,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 13:01:10,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:01:10,008 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 13 states. [2019-11-21 13:01:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:10,651 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2019-11-21 13:01:10,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 13:01:10,653 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 38 [2019-11-21 13:01:10,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:10,655 INFO L225 Difference]: With dead ends: 63 [2019-11-21 13:01:10,655 INFO L226 Difference]: Without dead ends: 63 [2019-11-21 13:01:10,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-21 13:01:10,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-21 13:01:10,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-21 13:01:10,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-21 13:01:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2019-11-21 13:01:10,660 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 38 [2019-11-21 13:01:10,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:10,661 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2019-11-21 13:01:10,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 13:01:10,661 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2019-11-21 13:01:10,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-21 13:01:10,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:10,663 INFO L410 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:10,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:10,867 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:10,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:10,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1571056316, now seen corresponding path program 1 times [2019-11-21 13:01:10,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:10,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1865743655] [2019-11-21 13:01:10,869 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 13:01:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:11,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 13:01:11,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:11,284 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:11,285 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:11,617 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:11,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1865743655] [2019-11-21 13:01:11,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:01:11,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2019-11-21 13:01:11,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563008531] [2019-11-21 13:01:11,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 13:01:11,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:11,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 13:01:11,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-21 13:01:11,620 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand 18 states. [2019-11-21 13:01:12,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:12,553 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2019-11-21 13:01:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-21 13:01:12,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 38 [2019-11-21 13:01:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:12,560 INFO L225 Difference]: With dead ends: 75 [2019-11-21 13:01:12,562 INFO L226 Difference]: Without dead ends: 71 [2019-11-21 13:01:12,562 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=223, Invalid=377, Unknown=0, NotChecked=0, Total=600 [2019-11-21 13:01:12,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-21 13:01:12,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-21 13:01:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-21 13:01:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2019-11-21 13:01:12,571 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 38 [2019-11-21 13:01:12,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:12,572 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2019-11-21 13:01:12,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 13:01:12,572 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2019-11-21 13:01:12,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-21 13:01:12,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:12,573 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:12,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:12,778 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:12,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:12,778 INFO L82 PathProgramCache]: Analyzing trace with hash 905861828, now seen corresponding path program 2 times [2019-11-21 13:01:12,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:12,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [517014503] [2019-11-21 13:01:12,780 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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 13:01:13,075 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-21 13:01:13,075 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 13:01:13,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 13:01:13,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:13,094 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 13:01:13,094 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:13,101 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:13,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:13,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:01:13,328 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-21 13:01:13,329 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:14,172 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-21 13:01:14,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [517014503] [2019-11-21 13:01:14,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:14,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-21 13:01:14,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279400708] [2019-11-21 13:01:14,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-21 13:01:14,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:14,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-21 13:01:14,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-21 13:01:14,176 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand 23 states. [2019-11-21 13:01:15,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:15,536 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-21 13:01:15,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 13:01:15,537 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 46 [2019-11-21 13:01:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:15,538 INFO L225 Difference]: With dead ends: 70 [2019-11-21 13:01:15,538 INFO L226 Difference]: Without dead ends: 70 [2019-11-21 13:01:15,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-21 13:01:15,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-21 13:01:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-21 13:01:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-21 13:01:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-21 13:01:15,544 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 46 [2019-11-21 13:01:15,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:15,545 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-21 13:01:15,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-21 13:01:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-21 13:01:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-21 13:01:15,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:15,547 INFO L410 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:15,750 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:15,751 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:15,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:15,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1162659866, now seen corresponding path program 1 times [2019-11-21 13:01:15,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:15,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1884644798] [2019-11-21 13:01:15,754 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 13:01:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:16,158 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-21 13:01:16,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:16,402 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:16,514 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-21 13:01:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:17,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1884644798] [2019-11-21 13:01:17,365 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:01:17,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2019-11-21 13:01:17,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566450350] [2019-11-21 13:01:17,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-11-21 13:01:17,366 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-11-21 13:01:17,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2019-11-21 13:01:17,368 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 34 states. [2019-11-21 13:01:18,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:18,145 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2019-11-21 13:01:18,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 13:01:18,147 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 51 [2019-11-21 13:01:18,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:18,148 INFO L225 Difference]: With dead ends: 76 [2019-11-21 13:01:18,148 INFO L226 Difference]: Without dead ends: 72 [2019-11-21 13:01:18,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=250, Invalid=940, Unknown=0, NotChecked=0, Total=1190 [2019-11-21 13:01:18,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-21 13:01:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-21 13:01:18,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-21 13:01:18,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 74 transitions. [2019-11-21 13:01:18,158 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 74 transitions. Word has length 51 [2019-11-21 13:01:18,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:18,160 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 74 transitions. [2019-11-21 13:01:18,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-11-21 13:01:18,160 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 74 transitions. [2019-11-21 13:01:18,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-21 13:01:18,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:18,166 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:18,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:18,370 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:18,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1097236102, now seen corresponding path program 2 times [2019-11-21 13:01:18,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:18,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1539829802] [2019-11-21 13:01:18,371 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 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 13:01:18,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-21 13:01:18,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-21 13:01:18,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 13:01:18,667 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:18,678 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 13:01:18,678 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:18,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:18,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:18,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 13:01:18,837 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:18,838 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:18,969 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:18,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1539829802] [2019-11-21 13:01:18,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:18,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 9] imperfect sequences [] total 12 [2019-11-21 13:01:18,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092990828] [2019-11-21 13:01:18,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-21 13:01:18,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:18,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-21 13:01:18,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:01:18,971 INFO L87 Difference]: Start difference. First operand 72 states and 74 transitions. Second operand 13 states. [2019-11-21 13:01:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:19,548 INFO L93 Difference]: Finished difference Result 70 states and 72 transitions. [2019-11-21 13:01:19,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 13:01:19,549 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2019-11-21 13:01:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:19,550 INFO L225 Difference]: With dead ends: 70 [2019-11-21 13:01:19,550 INFO L226 Difference]: Without dead ends: 70 [2019-11-21 13:01:19,550 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-11-21 13:01:19,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-21 13:01:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-21 13:01:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-21 13:01:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-11-21 13:01:19,555 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 53 [2019-11-21 13:01:19,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:19,555 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-11-21 13:01:19,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-21 13:01:19,555 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-11-21 13:01:19,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-21 13:01:19,556 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:19,557 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:19,760 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:19,761 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:19,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:19,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1097236103, now seen corresponding path program 1 times [2019-11-21 13:01:19,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:19,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2039268611] [2019-11-21 13:01:19,763 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 13:01:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:20,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-21 13:01:20,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:20,239 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 13:01:20,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:20,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:20,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:20,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 13:01:20,491 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:20,492 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:21,302 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:21,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2039268611] [2019-11-21 13:01:21,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:21,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 22 [2019-11-21 13:01:21,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869516805] [2019-11-21 13:01:21,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-21 13:01:21,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:21,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-21 13:01:21,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2019-11-21 13:01:21,305 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 23 states. [2019-11-21 13:01:22,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:22,614 INFO L93 Difference]: Finished difference Result 68 states and 70 transitions. [2019-11-21 13:01:22,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 13:01:22,614 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 53 [2019-11-21 13:01:22,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:22,615 INFO L225 Difference]: With dead ends: 68 [2019-11-21 13:01:22,615 INFO L226 Difference]: Without dead ends: 68 [2019-11-21 13:01:22,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 80 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-11-21 13:01:22,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-21 13:01:22,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-21 13:01:22,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 13:01:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 70 transitions. [2019-11-21 13:01:22,620 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 70 transitions. Word has length 53 [2019-11-21 13:01:22,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:22,621 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 70 transitions. [2019-11-21 13:01:22,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-21 13:01:22,621 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 70 transitions. [2019-11-21 13:01:22,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-21 13:01:22,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:22,622 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:22,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:22,825 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:22,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:22,825 INFO L82 PathProgramCache]: Analyzing trace with hash -935548641, now seen corresponding path program 1 times [2019-11-21 13:01:22,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:22,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1143453573] [2019-11-21 13:01:22,836 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 13:01:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:23,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 13:01:23,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:23,168 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:23,168 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:23,362 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:23,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1143453573] [2019-11-21 13:01:23,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:23,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 8 [2019-11-21 13:01:23,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569665732] [2019-11-21 13:01:23,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 13:01:23,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:23,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 13:01:23,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-21 13:01:23,364 INFO L87 Difference]: Start difference. First operand 68 states and 70 transitions. Second operand 8 states. [2019-11-21 13:01:23,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:23,447 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2019-11-21 13:01:23,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-21 13:01:23,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2019-11-21 13:01:23,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:23,449 INFO L225 Difference]: With dead ends: 70 [2019-11-21 13:01:23,450 INFO L226 Difference]: Without dead ends: 68 [2019-11-21 13:01:23,450 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-21 13:01:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-21 13:01:23,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-21 13:01:23,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 13:01:23,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2019-11-21 13:01:23,458 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 51 [2019-11-21 13:01:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:23,460 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2019-11-21 13:01:23,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 13:01:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2019-11-21 13:01:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-21 13:01:23,466 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:23,466 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:23,669 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:23,670 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:23,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:23,670 INFO L82 PathProgramCache]: Analyzing trace with hash 923461308, now seen corresponding path program 1 times [2019-11-21 13:01:23,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:23,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [676227064] [2019-11-21 13:01:23,671 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 13:01:23,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:23,957 INFO L255 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-21 13:01:23,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:24,022 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:24,023 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:24,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:24,345 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2019-11-21 13:01:24,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [676227064] [2019-11-21 13:01:24,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 13:01:24,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 11 [2019-11-21 13:01:24,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585669075] [2019-11-21 13:01:24,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 13:01:24,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:24,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 13:01:24,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-21 13:01:24,347 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand 11 states. [2019-11-21 13:01:24,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:01:24,454 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2019-11-21 13:01:24,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-21 13:01:24,455 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-11-21 13:01:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:01:24,456 INFO L225 Difference]: With dead ends: 72 [2019-11-21 13:01:24,457 INFO L226 Difference]: Without dead ends: 68 [2019-11-21 13:01:24,457 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-11-21 13:01:24,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-21 13:01:24,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-21 13:01:24,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-21 13:01:24,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-11-21 13:01:24,461 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 56 [2019-11-21 13:01:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:01:24,462 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-11-21 13:01:24,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 13:01:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-11-21 13:01:24,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-21 13:01:24,463 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 13:01:24,464 INFO L410 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 13:01:24,667 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:01:24,668 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr0REQUIRES_VIOLATION, ldv_kref_initErr1REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr6ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr7ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION]=== [2019-11-21 13:01:24,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 13:01:24,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1423933729, now seen corresponding path program 1 times [2019-11-21 13:01:24,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 13:01:24,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2093743597] [2019-11-21 13:01:24,669 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 13:01:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 13:01:25,280 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 51 conjunts are in the unsatisfiable core [2019-11-21 13:01:25,282 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 13:01:25,464 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 15 treesize of output 11 [2019-11-21 13:01:25,464 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:25,474 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,474 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-11-21 13:01:25,540 INFO L343 Elim1Store]: treesize reduction 33, result has 23.3 percent of original size [2019-11-21 13:01:25,541 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2019-11-21 13:01:25,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:25,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-11-21 13:01:25,759 INFO L343 Elim1Store]: treesize reduction 78, result has 21.2 percent of original size [2019-11-21 13:01:25,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2019-11-21 13:01:25,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,788 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:25,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2019-11-21 13:01:25,949 INFO L343 Elim1Store]: treesize reduction 117, result has 19.3 percent of original size [2019-11-21 13:01:25,950 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 50 [2019-11-21 13:01:25,951 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,969 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:25,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:25,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2019-11-21 13:01:26,905 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:26,906 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 13:01:27,284 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 13:01:28,219 WARN L192 SmtUtils]: Spent 373.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 13:01:30,649 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2019-11-21 13:01:30,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:01:31,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 13:01:37,944 WARN L192 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-11-21 13:01:38,009 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 13:01:38,010 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:01:38,011 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:01:38,244 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 58 [2019-11-21 13:01:38,244 INFO L343 Elim1Store]: treesize reduction 585, result has 17.1 percent of original size [2019-11-21 13:01:38,245 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 12 case distinctions, treesize of input 128 treesize of output 129 [2019-11-21 13:01:38,259 INFO L343 Elim1Store]: treesize reduction 72, result has 1.4 percent of original size [2019-11-21 13:01:38,259 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 21 [2019-11-21 13:01:38,260 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:38,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:38,260 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:38,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 13:01:38,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:38,261 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:128, output treesize:1 [2019-11-21 13:01:43,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:01:43,084 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 13:01:43,084 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 13:01:43,841 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 109 [2019-11-21 13:01:43,842 INFO L343 Elim1Store]: treesize reduction 1062, result has 21.4 percent of original size [2019-11-21 13:01:43,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 161 treesize of output 297 [2019-11-21 13:01:43,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,850 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,852 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,866 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,875 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,879 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,881 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,890 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,917 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,921 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,922 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,925 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,926 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,935 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,942 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,945 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,947 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,951 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:43,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,000 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,012 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,169 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,207 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,373 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,439 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,553 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,563 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,787 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 71 [2019-11-21 13:01:44,788 INFO L343 Elim1Store]: treesize reduction 117, result has 56.8 percent of original size [2019-11-21 13:01:44,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 289 treesize of output 343 [2019-11-21 13:01:44,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 13:01:44,807 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 13:01:45,033 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 38 [2019-11-21 13:01:45,034 INFO L567 ElimStorePlain]: treesize reduction 624, result has 11.2 percent of original size [2019-11-21 13:01:45,034 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:45,068 INFO L567 ElimStorePlain]: treesize reduction 47, result has 43.4 percent of original size [2019-11-21 13:01:45,068 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 13:01:45,069 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:165, output treesize:36 [2019-11-21 13:01:46,841 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 13:01:46,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2093743597] [2019-11-21 13:01:46,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-21 13:01:46,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 55 [2019-11-21 13:01:46,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207180354] [2019-11-21 13:01:46,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-11-21 13:01:46,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 13:01:46,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-11-21 13:01:46,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=2763, Unknown=0, NotChecked=0, Total=2970 [2019-11-21 13:01:46,845 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 55 states. [2019-11-21 13:02:19,208 WARN L192 SmtUtils]: Spent 8.36 s on a formula simplification that was a NOOP. DAG size: 78 [2019-11-21 13:02:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 13:02:29,939 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-11-21 13:02:29,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-11-21 13:02:29,941 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 67 [2019-11-21 13:02:29,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 13:02:29,942 INFO L225 Difference]: With dead ends: 60 [2019-11-21 13:02:29,942 INFO L226 Difference]: Without dead ends: 0 [2019-11-21 13:02:29,943 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 38.2s TimeCoverageRelationStatistics Valid=256, Invalid=3404, Unknown=0, NotChecked=0, Total=3660 [2019-11-21 13:02:29,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-21 13:02:29,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-21 13:02:29,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-21 13:02:29,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-21 13:02:29,944 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 67 [2019-11-21 13:02:29,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 13:02:29,944 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-21 13:02:29,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-11-21 13:02:29,944 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-21 13:02:29,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-21 13:02:30,145 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 13:02:30,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 01:02:30 BoogieIcfgContainer [2019-11-21 13:02:30,153 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-21 13:02:30,155 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-21 13:02:30,155 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-21 13:02:30,155 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-21 13:02:30,156 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:01:02" (3/4) ... [2019-11-21 13:02:30,159 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-21 13:02:30,165 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_submit_msg [2019-11-21 13:02:30,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_create [2019-11-21 13:02:30,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_del [2019-11-21 13:02:30,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_positive [2019-11-21 13:02:30,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_del [2019-11-21 13:02:30,166 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-21 13:02:30,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-21 13:02:30,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_free [2019-11-21 13:02:30,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-21 13:02:30,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2019-11-21 13:02:30,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_get [2019-11-21 13:02:30,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_put [2019-11-21 13:02:30,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-21 13:02:30,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init [2019-11-21 13:02:30,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ##fun~$Pointer$~TO~VOID [2019-11-21 13:02:30,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_sub_return [2019-11-21 13:02:30,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add_tail [2019-11-21 13:02:30,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-21 13:02:30,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_nonpositive [2019-11-21 13:02:30,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.meminit [2019-11-21 13:02:30,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure entry_point [2019-11-21 13:02:30,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_alloc [2019-11-21 13:02:30,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_init_internal [2019-11-21 13:02:30,169 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_init [2019-11-21 13:02:30,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2019-11-21 13:02:30,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_destroy_msgs [2019-11-21 13:02:30,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_msg_fill [2019-11-21 13:02:30,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_sub [2019-11-21 13:02:30,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memset [2019-11-21 13:02:30,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_atomic_add_return [2019-11-21 13:02:30,170 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure f [2019-11-21 13:02:30,171 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_release [2019-11-21 13:02:30,171 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure g [2019-11-21 13:02:30,171 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-21 13:02:30,171 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_cleanup [2019-11-21 13:02:30,171 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure #Ultimate.C_memcpy [2019-11-21 13:02:30,171 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure LDV_INIT_LIST_HEAD [2019-11-21 13:02:30,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2019-11-21 13:02:30,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-21 13:02:30,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2019-11-21 13:02:30,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_set_drvdata [2019-11-21 13:02:30,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_zalloc [2019-11-21 13:02:30,172 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kref_put [2019-11-21 13:02:30,173 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_kobject_get [2019-11-21 13:02:30,173 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_dev_get_drvdata [2019-11-21 13:02:30,180 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 35 nodes and edges [2019-11-21 13:02:30,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-21 13:02:30,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-21 13:02:30,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 13:02:30,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-21 13:02:30,232 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-21 13:02:30,232 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-21 13:02:30,234 INFO L168 Benchmark]: Toolchain (without parser) took 89793.63 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 433.6 MB). Free memory was 951.0 MB in the beginning and 895.3 MB in the end (delta: 55.6 MB). Peak memory consumption was 489.2 MB. Max. memory is 11.5 GB. [2019-11-21 13:02:30,234 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:02:30,235 INFO L168 Benchmark]: CACSL2BoogieTranslator took 880.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-21 13:02:30,235 INFO L168 Benchmark]: Boogie Preprocessor took 98.98 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 13:02:30,236 INFO L168 Benchmark]: RCFGBuilder took 1490.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. [2019-11-21 13:02:30,236 INFO L168 Benchmark]: TraceAbstraction took 87238.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 990.2 MB in the beginning and 895.3 MB in the end (delta: 94.9 MB). Peak memory consumption was 376.9 MB. Max. memory is 11.5 GB. [2019-11-21 13:02:30,236 INFO L168 Benchmark]: Witness Printer took 78.10 ms. Allocated memory is still 1.5 GB. Free memory is still 895.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 13:02:30,238 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 880.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -149.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.98 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 1490.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 990.2 MB in the end (delta: 103.3 MB). Peak memory consumption was 103.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 87238.01 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 282.1 MB). Free memory was 990.2 MB in the beginning and 895.3 MB in the end (delta: 94.9 MB). Peak memory consumption was 376.9 MB. Max. memory is 11.5 GB. * Witness Printer took 78.10 ms. Allocated memory is still 1.5 GB. Free memory is still 895.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 683]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 560]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 745]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 589]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 659]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 661]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 555]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 556]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 703]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 700]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 701]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 762]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 541]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 551]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 549]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 550]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 624]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 667]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 669]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 564]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 46 procedures, 324 locations, 71 error locations. Result: SAFE, OverallTime: 87.1s, OverallIterations: 16, TraceHistogramMax: 16, AutomataDifference: 50.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 788 SDtfs, 456 SDslu, 4946 SDs, 0 SdLazy, 3874 SolverSat, 219 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 24.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1248 GetRequests, 985 SyntacticMatches, 17 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 910 ImplicationChecksByTransitivity, 43.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 27.9s InterpolantComputationTime, 614 NumberOfCodeBlocks, 578 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1196 ConstructedInterpolants, 50 QuantifiedInterpolants, 348478 SizeOfPredicates, 58 NumberOfNonLiveVariables, 2549 ConjunctsInSsa, 211 ConjunctsInUnsatCore, 32 InterpolantComputations, 24 PerfectInterpolantSequences, 1340/1870 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...