./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test13_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_test13_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 802e06fc98e2f59a627183597248911673af75c3 --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- Skipped default analysis because property is memsafety ### Bit-precise run ### This is Ultimate 0.1.24-264dba8 [2019-11-21 12:25:33,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-21 12:25:33,770 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-21 12:25:33,789 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-21 12:25:33,790 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-21 12:25:33,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-21 12:25:33,794 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-21 12:25:33,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-21 12:25:33,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-21 12:25:33,808 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-21 12:25:33,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-21 12:25:33,810 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-21 12:25:33,810 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-21 12:25:33,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-21 12:25:33,812 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-21 12:25:33,813 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-21 12:25:33,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-21 12:25:33,815 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-21 12:25:33,817 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-21 12:25:33,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-21 12:25:33,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-21 12:25:33,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-21 12:25:33,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-21 12:25:33,823 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-21 12:25:33,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-21 12:25:33,826 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-21 12:25:33,826 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-21 12:25:33,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-21 12:25:33,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-21 12:25:33,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-21 12:25:33,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-21 12:25:33,830 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-21 12:25:33,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-21 12:25:33,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-21 12:25:33,832 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-21 12:25:33,833 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-21 12:25:33,833 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-21 12:25:33,833 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-21 12:25:33,834 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-21 12:25:33,835 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-21 12:25:33,835 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-21 12:25:33,836 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-21 12:25:33,851 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-21 12:25:33,851 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-21 12:25:33,852 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-21 12:25:33,853 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-21 12:25:33,853 INFO L138 SettingsManager]: * Use SBE=true [2019-11-21 12:25:33,853 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-21 12:25:33,853 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-21 12:25:33,853 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-21 12:25:33,854 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-21 12:25:33,854 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-21 12:25:33,854 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-21 12:25:33,854 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-21 12:25:33,855 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-21 12:25:33,855 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-21 12:25:33,855 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-21 12:25:33,855 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-21 12:25:33,855 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-21 12:25:33,856 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-21 12:25:33,856 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-21 12:25:33,856 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-21 12:25:33,856 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-21 12:25:33,856 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-21 12:25:33,857 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-21 12:25:33,857 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:25:33,857 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-21 12:25:33,857 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-21 12:25:33,858 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-21 12:25:33,858 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-21 12:25:33,858 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-21 12:25:33,858 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 -> 802e06fc98e2f59a627183597248911673af75c3 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2019-11-21 12:25:34,150 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-21 12:25:34,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-21 12:25:34,166 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-21 12:25:34,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-21 12:25:34,168 INFO L275 PluginConnector]: CDTParser initialized [2019-11-21 12:25:34,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2019-11-21 12:25:34,230 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4192c81/c8fa046f30f24b02b16b65915bd90392/FLAG022e4f881 [2019-11-21 12:25:34,800 INFO L306 CDTParser]: Found 1 translation units. [2019-11-21 12:25:34,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test13_1.i [2019-11-21 12:25:34,829 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4192c81/c8fa046f30f24b02b16b65915bd90392/FLAG022e4f881 [2019-11-21 12:25:35,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa4192c81/c8fa046f30f24b02b16b65915bd90392 [2019-11-21 12:25:35,051 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-21 12:25:35,053 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-21 12:25:35,054 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-21 12:25:35,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-21 12:25:35,058 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-21 12:25:35,059 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:35,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6783b8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35, skipping insertion in model container [2019-11-21 12:25:35,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:35,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-21 12:25:35,121 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:25:35,554 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:25:35,555 INFO L969 CHandler]: at location: C: (struct ldv_msg*)ldv_malloc(sizeof(struct ldv_msg)) [577] [2019-11-21 12:25:35,555 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:25:35,580 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:25:35,581 INFO L969 CHandler]: at location: C: (typeof(*msg) *)( (char *)__mptr - ((size_t) &((typeof(*msg) *)0)->list) ) [608] [2019-11-21 12:25:35,582 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:25:35,586 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:25:35,587 INFO L969 CHandler]: at location: C: (typeof(*(msg)) *)( (char *)__mptr - ((size_t) &((typeof(*(msg)) *)0)->list) ) [608] [2019-11-21 12:25:35,587 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:25:35,592 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:25:35,592 INFO L969 CHandler]: at location: C: (typeof(*(n)) *)( (char *)__mptr - ((size_t) &((typeof(*(n)) *)0)->list) ) [608] [2019-11-21 12:25:35,592 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:25:35,625 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:25:35,626 INFO L969 CHandler]: at location: C: (struct ldv_kobject *)( (char *)__mptr - ((size_t) &((struct ldv_kobject *)0)->kref) ) [707] [2019-11-21 12:25:35,626 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:25:35,636 INFO L966 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-21 12:25:35,637 INFO L969 CHandler]: at location: C: (struct A13 *)ldv_malloc(sizeof(struct A13)) [764] [2019-11-21 12:25:35,637 INFO L970 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-21 12:25:35,640 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:25:35,663 INFO L198 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-21 12:25:35,687 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-21 12:25:35,733 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:25:35,743 INFO L201 MainTranslator]: Completed pre-run [2019-11-21 12:25:35,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-21 12:25:35,885 INFO L205 MainTranslator]: Completed translation [2019-11-21 12:25:35,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35 WrapperNode [2019-11-21 12:25:35,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-21 12:25:35,887 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-21 12:25:35,887 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-21 12:25:35,887 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-21 12:25:35,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:35,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:35,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:35,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:35,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:36,008 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:36,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... [2019-11-21 12:25:36,038 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-21 12:25:36,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-21 12:25:36,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-21 12:25:36,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-21 12:25:36,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-21 12:25:36,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-21 12:25:36,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-21 12:25:36,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:25:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-21 12:25:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-21 12:25:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-21 12:25:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-21 12:25:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-21 12:25:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2019-11-21 12:25:36,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2019-11-21 12:25:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-11-21 12:25:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-11-21 12:25:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:25:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2019-11-21 12:25:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2019-11-21 12:25:36,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2019-11-21 12:25:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2019-11-21 12:25:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2019-11-21 12:25:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2019-11-21 12:25:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2019-11-21 12:25:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2019-11-21 12:25:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2019-11-21 12:25:36,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2019-11-21 12:25:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2019-11-21 12:25:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2019-11-21 12:25:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2019-11-21 12:25:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2019-11-21 12:25:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2019-11-21 12:25:36,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2019-11-21 12:25:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2019-11-21 12:25:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2019-11-21 12:25:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2019-11-21 12:25:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2019-11-21 12:25:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2019-11-21 12:25:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2019-11-21 12:25:36,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2019-11-21 12:25:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2019-11-21 12:25:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2019-11-21 12:25:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2019-11-21 12:25:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2019-11-21 12:25:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2019-11-21 12:25:36,112 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_13 [2019-11-21 12:25:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2019-11-21 12:25:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-21 12:25:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-11-21 12:25:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-11-21 12:25:36,113 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2019-11-21 12:25:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-21 12:25:36,113 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-21 12:25:36,114 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-21 12:25:36,114 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-21 12:25:36,114 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-21 12:25:36,114 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-21 12:25:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-21 12:25:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-21 12:25:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-21 12:25:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-21 12:25:36,115 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-21 12:25:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-21 12:25:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-21 12:25:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-21 12:25:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-21 12:25:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-21 12:25:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-21 12:25:36,116 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-21 12:25:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-21 12:25:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-21 12:25:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-21 12:25:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-21 12:25:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-21 12:25:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-21 12:25:36,117 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-21 12:25:36,118 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-21 12:25:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-21 12:25:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-21 12:25:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-21 12:25:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-21 12:25:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-21 12:25:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-21 12:25:36,119 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-21 12:25:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-21 12:25:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-21 12:25:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-21 12:25:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-21 12:25:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-21 12:25:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-21 12:25:36,120 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-21 12:25:36,121 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-21 12:25:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-21 12:25:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-21 12:25:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-21 12:25:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-21 12:25:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-21 12:25:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-21 12:25:36,122 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-21 12:25:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-21 12:25:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-21 12:25:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-21 12:25:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-21 12:25:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-21 12:25:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-21 12:25:36,123 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-21 12:25:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-21 12:25:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-21 12:25:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-21 12:25:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-21 12:25:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-21 12:25:36,124 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-21 12:25:36,125 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-21 12:25:36,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-21 12:25:36,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-21 12:25:36,125 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-21 12:25:36,125 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-21 12:25:36,125 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-21 12:25:36,125 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-21 12:25:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-21 12:25:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-21 12:25:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-21 12:25:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-21 12:25:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-21 12:25:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-21 12:25:36,126 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-21 12:25:36,127 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-21 12:25:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-21 12:25:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-21 12:25:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-21 12:25:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-21 12:25:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-21 12:25:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-21 12:25:36,128 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2019-11-21 12:25:36,129 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2019-11-21 12:25:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2019-11-21 12:25:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-11-21 12:25:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-11-21 12:25:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-21 12:25:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-11-21 12:25:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-11-21 12:25:36,130 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2019-11-21 12:25:36,131 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-21 12:25:36,131 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2019-11-21 12:25:36,131 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2019-11-21 12:25:36,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2019-11-21 12:25:36,131 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-21 12:25:36,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2019-11-21 12:25:36,131 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2019-11-21 12:25:36,132 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2019-11-21 12:25:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2019-11-21 12:25:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2019-11-21 12:25:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-21 12:25:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-21 12:25:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2019-11-21 12:25:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2019-11-21 12:25:36,133 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-11-21 12:25:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2019-11-21 12:25:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2019-11-21 12:25:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2019-11-21 12:25:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2019-11-21 12:25:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2019-11-21 12:25:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2019-11-21 12:25:36,134 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure f [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure g [2019-11-21 12:25:36,135 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_13 [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2019-11-21 12:25:36,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2019-11-21 12:25:36,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2019-11-21 12:25:36,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2019-11-21 12:25:36,776 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:25:37,196 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-21 12:25:37,606 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-21 12:25:37,607 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-21 12:25:37,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:25:37 BoogieIcfgContainer [2019-11-21 12:25:37,610 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-21 12:25:37,612 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-21 12:25:37,612 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-21 12:25:37,616 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-21 12:25:37,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 12:25:35" (1/3) ... [2019-11-21 12:25:37,618 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29add5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:25:37, skipping insertion in model container [2019-11-21 12:25:37,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 12:25:35" (2/3) ... [2019-11-21 12:25:37,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29add5e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 12:25:37, skipping insertion in model container [2019-11-21 12:25:37,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 12:25:37" (3/3) ... [2019-11-21 12:25:37,622 INFO L109 eAbstractionObserver]: Analyzing ICFG memleaks_test13_1.i [2019-11-21 12:25:37,633 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-21 12:25:37,643 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 71 error locations. [2019-11-21 12:25:37,656 INFO L249 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2019-11-21 12:25:37,681 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-21 12:25:37,682 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-21 12:25:37,682 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-21 12:25:37,683 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-21 12:25:37,683 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-21 12:25:37,684 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-21 12:25:37,688 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-21 12:25:37,688 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-21 12:25:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states. [2019-11-21 12:25:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 12:25:37,721 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:25:37,722 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:25:37,723 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 12:25:37,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:25:37,729 INFO L82 PathProgramCache]: Analyzing trace with hash -221537282, now seen corresponding path program 1 times [2019-11-21 12:25:37,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:25:37,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [649190061] [2019-11-21 12:25:37,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:25:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:25:38,095 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-21 12:25:38,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:25:38,249 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:25:38,250 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:25:38,251 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:38,297 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-21 12:25:38,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:38,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:25:38,303 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:32 [2019-11-21 12:25:38,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:38,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:25:38,342 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:38,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:38,345 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:25:38,345 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-21 12:25:38,380 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:25:38,381 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:38,383 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:38,384 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:25:38,384 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 12:25:38,461 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:38,462 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-21 12:25:38,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:38,489 INFO L567 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-21 12:25:38,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:25:38,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2019-11-21 12:25:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:25:38,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:25:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:25:38,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [649190061] [2019-11-21 12:25:38,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:25:38,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 13 [2019-11-21 12:25:38,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062303994] [2019-11-21 12:25:38,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:25:38,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:25:38,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:25:38,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:25:38,918 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 14 states. [2019-11-21 12:25:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:25:50,625 INFO L93 Difference]: Finished difference Result 92 states and 94 transitions. [2019-11-21 12:25:50,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-21 12:25:50,627 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-11-21 12:25:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:25:50,640 INFO L225 Difference]: With dead ends: 92 [2019-11-21 12:25:50,640 INFO L226 Difference]: Without dead ends: 80 [2019-11-21 12:25:50,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=134, Invalid=328, Unknown=0, NotChecked=0, Total=462 [2019-11-21 12:25:50,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-21 12:25:50,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 61. [2019-11-21 12:25:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-21 12:25:50,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2019-11-21 12:25:50,704 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2019-11-21 12:25:50,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:25:50,704 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2019-11-21 12:25:50,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:25:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2019-11-21 12:25:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-21 12:25:50,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:25:50,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:25:50,911 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:25:50,911 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 12:25:50,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:25:50,912 INFO L82 PathProgramCache]: Analyzing trace with hash -221537281, now seen corresponding path program 1 times [2019-11-21 12:25:50,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:25:50,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [330220671] [2019-11-21 12:25:50,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:25:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:25:51,277 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 27 conjunts are in the unsatisfiable core [2019-11-21 12:25:51,283 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:25:51,363 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:25:51,364 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:25:51,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,437 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.5 percent of original size [2019-11-21 12:25:51,462 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:25:51,463 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 12:25:51,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:51,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:51,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:25:51,504 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:45 [2019-11-21 12:25:51,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:51,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:51,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:51,598 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 38 [2019-11-21 12:25:51,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-11-21 12:25:51,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,624 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 12:25:51,624 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:51,673 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-21 12:25:51,673 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:126, output treesize:66 [2019-11-21 12:25:51,800 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_1, |v_#valid_BEFORE_CALL_10|], 1=[v_prenex_2, |v_#length_BEFORE_CALL_4|]} [2019-11-21 12:25:51,806 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2019-11-21 12:25:51,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:51,855 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2019-11-21 12:25:51,855 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,903 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:51,920 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:51,921 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2019-11-21 12:25:51,922 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:51,981 INFO L567 ElimStorePlain]: treesize reduction 7, result has 81.1 percent of original size [2019-11-21 12:25:51,987 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2019-11-21 12:25:51,987 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:52,013 INFO L567 ElimStorePlain]: treesize reduction 15, result has 40.0 percent of original size [2019-11-21 12:25:52,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:25:52,014 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:10 [2019-11-21 12:25:54,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:25:54,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:25:54,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:54,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 59 [2019-11-21 12:25:54,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:54,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:25:54,157 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-21 12:25:54,158 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:54,291 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2019-11-21 12:25:54,293 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.1 percent of original size [2019-11-21 12:25:54,327 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:54,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 47 [2019-11-21 12:25:54,328 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:54,341 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:25:54,342 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2019-11-21 12:25:54,342 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:25:54,386 INFO L567 ElimStorePlain]: treesize reduction 28, result has 39.1 percent of original size [2019-11-21 12:25:54,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:25:54,387 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:9 [2019-11-21 12:25:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:25:54,458 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:25:54,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:55,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:25:55,716 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-21 12:25:55,729 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 39 [2019-11-21 12:25:56,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:25:56,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [330220671] [2019-11-21 12:25:56,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:25:56,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 14 [2019-11-21 12:25:56,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205119621] [2019-11-21 12:25:56,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-21 12:25:56,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:25:56,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-21 12:25:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=163, Unknown=1, NotChecked=0, Total=210 [2019-11-21 12:25:56,786 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 15 states. [2019-11-21 12:26:19,993 WARN L192 SmtUtils]: Spent 2.10 s on a formula simplification. DAG size of input: 35 DAG size of output: 35 [2019-11-21 12:26:28,400 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-11-21 12:26:28,655 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 33 [2019-11-21 12:26:34,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:26:34,847 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-21 12:26:34,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-21 12:26:34,848 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-11-21 12:26:34,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:26:34,869 INFO L225 Difference]: With dead ends: 79 [2019-11-21 12:26:34,870 INFO L226 Difference]: Without dead ends: 79 [2019-11-21 12:26:34,874 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=160, Invalid=391, Unknown=1, NotChecked=0, Total=552 [2019-11-21 12:26:34,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2019-11-21 12:26:34,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 60. [2019-11-21 12:26:34,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-21 12:26:34,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-11-21 12:26:34,889 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 17 [2019-11-21 12:26:34,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:26:34,889 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-11-21 12:26:34,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-21 12:26:34,889 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-11-21 12:26:34,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:26:34,890 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:26:34,890 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:26:35,090 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:26:35,092 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 12:26:35,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:26:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1547904578, now seen corresponding path program 1 times [2019-11-21 12:26:35,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:26:35,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [266842981] [2019-11-21 12:26:35,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:26:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:26:35,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-21 12:26:35,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:26:35,431 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:26:35,432 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:35,445 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:35,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:26:35,446 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:20 [2019-11-21 12:26:35,517 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:26:35,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:35,521 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:35,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:26:35,522 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2019-11-21 12:26:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:26:35,562 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:26:35,573 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:35,574 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-21 12:26:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:26:35,576 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:35,587 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:35,588 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:26:35,588 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:7 [2019-11-21 12:26:35,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:26:35,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [266842981] [2019-11-21 12:26:35,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:26:35,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [] total 11 [2019-11-21 12:26:35,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924367632] [2019-11-21 12:26:35,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-21 12:26:35,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:26:35,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-21 12:26:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-21 12:26:35,695 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 12 states. [2019-11-21 12:26:36,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:26:36,388 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2019-11-21 12:26:36,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:26:36,389 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-21 12:26:36,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:26:36,391 INFO L225 Difference]: With dead ends: 78 [2019-11-21 12:26:36,391 INFO L226 Difference]: Without dead ends: 78 [2019-11-21 12:26:36,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2019-11-21 12:26:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-21 12:26:36,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 59. [2019-11-21 12:26:36,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-21 12:26:36,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2019-11-21 12:26:36,400 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 20 [2019-11-21 12:26:36,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:26:36,400 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2019-11-21 12:26:36,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-21 12:26:36,400 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2019-11-21 12:26:36,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-21 12:26:36,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:26:36,401 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:26:36,605 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:26:36,606 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 12:26:36,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:26:36,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1547904579, now seen corresponding path program 1 times [2019-11-21 12:26:36,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:26:36,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1045765852] [2019-11-21 12:26:36,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:26:36,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:26:36,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-21 12:26:36,905 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:26:37,010 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:26:37,011 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:26:37,011 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,083 INFO L567 ElimStorePlain]: treesize reduction 10, result has 87.0 percent of original size [2019-11-21 12:26:37,138 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:26:37,138 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 12:26:37,138 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:37,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:26:37,183 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:68 [2019-11-21 12:26:37,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:37,352 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:37,353 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 91 [2019-11-21 12:26:37,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,367 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:37,368 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 70 [2019-11-21 12:26:37,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,374 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 12:26:37,374 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,545 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-11-21 12:26:37,546 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.0 percent of original size [2019-11-21 12:26:37,566 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:37,567 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 56 [2019-11-21 12:26:37,568 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,574 WARN L227 Elim1Store]: Array PQE input equivalent to false [2019-11-21 12:26:37,575 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:37,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:26:37,594 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:211, output treesize:42 [2019-11-21 12:26:39,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:39,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:39,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 87 [2019-11-21 12:26:39,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:39,753 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:26:39,759 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-21 12:26:39,765 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:39,766 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 78 [2019-11-21 12:26:39,767 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:39,856 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:39,857 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 118 [2019-11-21 12:26:39,858 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:40,093 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-11-21 12:26:40,096 INFO L567 ElimStorePlain]: treesize reduction 8, result has 93.9 percent of original size [2019-11-21 12:26:40,164 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:40,164 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 73 [2019-11-21 12:26:40,165 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:40,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:40,195 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 75 [2019-11-21 12:26:40,196 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:40,427 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-11-21 12:26:40,428 INFO L567 ElimStorePlain]: treesize reduction 22, result has 84.8 percent of original size [2019-11-21 12:26:40,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-21 12:26:40,431 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:224, output treesize:97 [2019-11-21 12:26:40,614 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:26:40,615 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:40,643 INFO L567 ElimStorePlain]: treesize reduction 5, result has 86.5 percent of original size [2019-11-21 12:26:40,647 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:26:40,648 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:26:40,665 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:26:40,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:26:40,666 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:9 [2019-11-21 12:26:40,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:26:40,762 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:26:41,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:41,777 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-21 12:26:44,216 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-21 12:26:44,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:26:44,238 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 12:26:46,582 WARN L192 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-21 12:26:46,606 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 63 [2019-11-21 12:26:51,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:26:51,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1045765852] [2019-11-21 12:26:51,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:26:51,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 19 [2019-11-21 12:26:51,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109794264] [2019-11-21 12:26:51,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-21 12:26:51,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:26:51,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-21 12:26:51,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=326, Unknown=2, NotChecked=0, Total=380 [2019-11-21 12:26:51,621 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 20 states. [2019-11-21 12:26:56,845 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2019-11-21 12:26:59,117 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 12:27:01,991 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2019-11-21 12:27:04,646 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-21 12:27:06,890 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2019-11-21 12:27:17,640 WARN L192 SmtUtils]: Spent 702.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-11-21 12:27:18,653 WARN L192 SmtUtils]: Spent 418.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-21 12:27:36,706 WARN L192 SmtUtils]: Spent 786.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-21 12:27:37,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:37,693 INFO L93 Difference]: Finished difference Result 77 states and 79 transitions. [2019-11-21 12:27:37,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-21 12:27:37,694 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-11-21 12:27:37,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:37,696 INFO L225 Difference]: With dead ends: 77 [2019-11-21 12:27:37,696 INFO L226 Difference]: Without dead ends: 77 [2019-11-21 12:27:37,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 10 SyntacticMatches, 11 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=242, Invalid=946, Unknown=2, NotChecked=0, Total=1190 [2019-11-21 12:27:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-21 12:27:37,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 58. [2019-11-21 12:27:37,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-21 12:27:37,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2019-11-21 12:27:37,704 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 20 [2019-11-21 12:27:37,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:37,704 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2019-11-21 12:27:37,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-21 12:27:37,705 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2019-11-21 12:27:37,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:27:37,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:37,705 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:37,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:37,907 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 12:27:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1770744447, now seen corresponding path program 1 times [2019-11-21 12:27:37,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:37,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [408282228] [2019-11-21 12:27:37,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:38,141 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-21 12:27:38,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:38,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:38,176 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:38,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408282228] [2019-11-21 12:27:38,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:38,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:27:38,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932947298] [2019-11-21 12:27:38,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:27:38,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:38,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:27:38,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:27:38,236 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2019-11-21 12:27:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:38,255 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-21 12:27:38,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:27:38,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-21 12:27:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:38,257 INFO L225 Difference]: With dead ends: 58 [2019-11-21 12:27:38,257 INFO L226 Difference]: Without dead ends: 58 [2019-11-21 12:27:38,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:27:38,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-21 12:27:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-11-21 12:27:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-21 12:27:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2019-11-21 12:27:38,263 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 19 [2019-11-21 12:27:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:38,263 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2019-11-21 12:27:38,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:27:38,263 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2019-11-21 12:27:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:27:38,264 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:38,264 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:38,468 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:38,468 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 12:27:38,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:38,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1574230942, now seen corresponding path program 1 times [2019-11-21 12:27:38,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:38,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1188264637] [2019-11-21 12:27:38,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:38,725 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-21 12:27:38,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:38,777 INFO L343 Elim1Store]: treesize reduction 27, result has 50.9 percent of original size [2019-11-21 12:27:38,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 33 [2019-11-21 12:27:38,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:38,822 INFO L567 ElimStorePlain]: treesize reduction 10, result has 76.2 percent of original size [2019-11-21 12:27:38,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:27:38,824 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:38,825 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:32 [2019-11-21 12:27:38,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:27:38,863 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:27:38,863 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:38,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:38,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:38,866 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:5 [2019-11-21 12:27:38,892 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:27:38,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:38,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:38,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:38,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-21 12:27:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:38,921 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:39,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:39,006 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2019-11-21 12:27:39,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:39,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:39,016 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:39,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:12 [2019-11-21 12:27:39,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:39,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1188264637] [2019-11-21 12:27:39,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:39,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 7 [2019-11-21 12:27:39,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695545538] [2019-11-21 12:27:39,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-21 12:27:39,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:39,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-21 12:27:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-21 12:27:39,075 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 8 states. [2019-11-21 12:27:43,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:43,575 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2019-11-21 12:27:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:27:43,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-21 12:27:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:43,578 INFO L225 Difference]: With dead ends: 66 [2019-11-21 12:27:43,578 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 12:27:43,579 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=114, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:27:43,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 12:27:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2019-11-21 12:27:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-21 12:27:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2019-11-21 12:27:43,585 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 19 [2019-11-21 12:27:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:43,585 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2019-11-21 12:27:43,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-21 12:27:43,586 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2019-11-21 12:27:43,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-21 12:27:43,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:43,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:43,789 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:43,790 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 12:27:43,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1574230943, now seen corresponding path program 1 times [2019-11-21 12:27:43,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:43,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [428836415] [2019-11-21 12:27:43,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:44,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-21 12:27:44,046 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:44,077 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-21 12:27:44,077 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-21 12:27:44,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:44,095 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:44,096 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:44,096 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:23 [2019-11-21 12:27:44,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:27:44,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:44,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:44,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:44,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:9 [2019-11-21 12:27:44,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-21 12:27:44,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:44,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:44,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:44,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:7 [2019-11-21 12:27:44,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:44,189 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:44,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-21 12:27:44,588 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-21 12:27:44,588 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:44,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:44,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:44,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2019-11-21 12:27:44,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:44,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [428836415] [2019-11-21 12:27:44,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:44,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-21 12:27:44,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17150133] [2019-11-21 12:27:44,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-21 12:27:44,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:44,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-21 12:27:44,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-21 12:27:44,767 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 11 states. [2019-11-21 12:27:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:45,971 INFO L93 Difference]: Finished difference Result 86 states and 85 transitions. [2019-11-21 12:27:45,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:27:45,972 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2019-11-21 12:27:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:45,974 INFO L225 Difference]: With dead ends: 86 [2019-11-21 12:27:45,974 INFO L226 Difference]: Without dead ends: 67 [2019-11-21 12:27:45,975 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-11-21 12:27:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-21 12:27:45,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 61. [2019-11-21 12:27:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-21 12:27:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2019-11-21 12:27:45,980 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 19 [2019-11-21 12:27:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:45,980 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2019-11-21 12:27:45,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-21 12:27:45,980 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2019-11-21 12:27:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:27:45,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:45,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:46,184 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:46,185 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 12:27:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:46,186 INFO L82 PathProgramCache]: Analyzing trace with hash 740401709, now seen corresponding path program 1 times [2019-11-21 12:27:46,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:46,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1661418608] [2019-11-21 12:27:46,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:46,465 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-21 12:27:46,467 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:46,476 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 12:27:46,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:46,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:46,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:46,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-21 12:27:46,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:46,543 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:46,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:46,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1661418608] [2019-11-21 12:27:46,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:46,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 9] imperfect sequences [] total 13 [2019-11-21 12:27:46,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908697865] [2019-11-21 12:27:46,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-21 12:27:46,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:46,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-21 12:27:46,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-21 12:27:46,731 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand 14 states. [2019-11-21 12:27:47,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:47,226 INFO L93 Difference]: Finished difference Result 64 states and 63 transitions. [2019-11-21 12:27:47,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-21 12:27:47,226 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 21 [2019-11-21 12:27:47,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:47,228 INFO L225 Difference]: With dead ends: 64 [2019-11-21 12:27:47,228 INFO L226 Difference]: Without dead ends: 64 [2019-11-21 12:27:47,228 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:27:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-21 12:27:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2019-11-21 12:27:47,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-21 12:27:47,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2019-11-21 12:27:47,235 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 21 [2019-11-21 12:27:47,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:47,236 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2019-11-21 12:27:47,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-21 12:27:47,236 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2019-11-21 12:27:47,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:27:47,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:47,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:47,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:47,441 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 12:27:47,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:47,441 INFO L82 PathProgramCache]: Analyzing trace with hash 740401710, now seen corresponding path program 1 times [2019-11-21 12:27:47,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:47,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2146836713] [2019-11-21 12:27:47,442 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 12:27:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:47,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-21 12:27:47,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:47,759 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-21 12:27:47,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:47,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:47,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:47,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-21 12:27:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:47,874 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:48,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2146836713] [2019-11-21 12:27:48,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:48,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 17 [2019-11-21 12:27:48,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332206475] [2019-11-21 12:27:48,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-21 12:27:48,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:48,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-21 12:27:48,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-11-21 12:27:48,603 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand 18 states. [2019-11-21 12:27:49,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:49,580 INFO L93 Difference]: Finished difference Result 62 states and 61 transitions. [2019-11-21 12:27:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:27:49,581 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 21 [2019-11-21 12:27:49,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:49,582 INFO L225 Difference]: With dead ends: 62 [2019-11-21 12:27:49,582 INFO L226 Difference]: Without dead ends: 62 [2019-11-21 12:27:49,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-11-21 12:27:49,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-11-21 12:27:49,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2019-11-21 12:27:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-11-21 12:27:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2019-11-21 12:27:49,589 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 21 [2019-11-21 12:27:49,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:49,589 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2019-11-21 12:27:49,589 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-21 12:27:49,589 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2019-11-21 12:27:49,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-21 12:27:49,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:49,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:49,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:49,794 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 12:27:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:49,794 INFO L82 PathProgramCache]: Analyzing trace with hash 869484428, now seen corresponding path program 1 times [2019-11-21 12:27:49,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:49,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [506738] [2019-11-21 12:27:49,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:50,089 INFO L255 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:27:50,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:50,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:50,128 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:50,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [506738] [2019-11-21 12:27:50,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:50,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 5 [2019-11-21 12:27:50,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537485398] [2019-11-21 12:27:50,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-21 12:27:50,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:50,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-21 12:27:50,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:27:50,171 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 5 states. [2019-11-21 12:27:50,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:50,181 INFO L93 Difference]: Finished difference Result 48 states and 47 transitions. [2019-11-21 12:27:50,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-21 12:27:50,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-21 12:27:50,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:50,183 INFO L225 Difference]: With dead ends: 48 [2019-11-21 12:27:50,183 INFO L226 Difference]: Without dead ends: 44 [2019-11-21 12:27:50,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-21 12:27:50,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-21 12:27:50,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-11-21 12:27:50,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-21 12:27:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 43 transitions. [2019-11-21 12:27:50,186 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 43 transitions. Word has length 21 [2019-11-21 12:27:50,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:50,187 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 43 transitions. [2019-11-21 12:27:50,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-21 12:27:50,187 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 43 transitions. [2019-11-21 12:27:50,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 12:27:50,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:50,188 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:50,392 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:50,393 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 12:27:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1438527184, now seen corresponding path program 1 times [2019-11-21 12:27:50,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:50,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1315520058] [2019-11-21 12:27:50,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:50,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-21 12:27:50,706 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:50,715 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2019-11-21 12:27:50,716 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:50,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:50,717 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:50,717 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:1 [2019-11-21 12:27:50,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:50,748 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:50,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:50,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1315520058] [2019-11-21 12:27:50,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:50,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [] total 5 [2019-11-21 12:27:50,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310086092] [2019-11-21 12:27:50,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-21 12:27:50,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:50,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-21 12:27:50,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-21 12:27:50,783 INFO L87 Difference]: Start difference. First operand 44 states and 43 transitions. Second operand 6 states. [2019-11-21 12:27:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:51,037 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2019-11-21 12:27:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-21 12:27:51,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-11-21 12:27:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:51,038 INFO L225 Difference]: With dead ends: 43 [2019-11-21 12:27:51,038 INFO L226 Difference]: Without dead ends: 43 [2019-11-21 12:27:51,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-21 12:27:51,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-21 12:27:51,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-21 12:27:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-21 12:27:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2019-11-21 12:27:51,041 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 23 [2019-11-21 12:27:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:51,042 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2019-11-21 12:27:51,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-21 12:27:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2019-11-21 12:27:51,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-21 12:27:51,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:51,043 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:51,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:51,244 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 12:27:51,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:51,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1438527183, now seen corresponding path program 1 times [2019-11-21 12:27:51,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:51,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1948127543] [2019-11-21 12:27:51,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:51,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-21 12:27:51,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:51,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:27:51,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:51,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:51,660 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-21 12:27:51,660 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:51,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:51,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:51,670 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:46, output treesize:10 [2019-11-21 12:27:51,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:51,759 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:51,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:27:51,824 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2019-11-21 12:27:51,824 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:51,850 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2019-11-21 12:27:51,850 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:51,870 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:51,871 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2019-11-21 12:27:51,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:51,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:51,873 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:51,987 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-11-21 12:27:51,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:51,988 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:51,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 12:27:51,989 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:85, output treesize:85 [2019-11-21 12:27:51,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:52,295 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 31 [2019-11-21 12:27:52,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:52,684 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2019-11-21 12:27:52,932 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-11-21 12:27:53,197 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:27:53,485 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:27:53,760 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-21 12:27:53,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-21 12:27:53,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1948127543] [2019-11-21 12:27:53,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-21 12:27:53,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-21 12:27:53,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571712269] [2019-11-21 12:27:53,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-21 12:27:53,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-21 12:27:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-21 12:27:53,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-11-21 12:27:53,868 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 16 states. [2019-11-21 12:27:54,945 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-21 12:27:55,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-21 12:27:55,483 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2019-11-21 12:27:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-21 12:27:55,484 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-21 12:27:55,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-21 12:27:55,485 INFO L225 Difference]: With dead ends: 42 [2019-11-21 12:27:55,485 INFO L226 Difference]: Without dead ends: 42 [2019-11-21 12:27:55,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2019-11-21 12:27:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-21 12:27:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-11-21 12:27:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-21 12:27:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 41 transitions. [2019-11-21 12:27:55,488 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 41 transitions. Word has length 23 [2019-11-21 12:27:55,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-21 12:27:55,488 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 41 transitions. [2019-11-21 12:27:55,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-21 12:27:55,488 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 41 transitions. [2019-11-21 12:27:55,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-21 12:27:55,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-21 12:27:55,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-21 12:27:55,692 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:55,693 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 12:27:55,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-21 12:27:55,694 INFO L82 PathProgramCache]: Analyzing trace with hash 998521758, now seen corresponding path program 1 times [2019-11-21 12:27:55,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-21 12:27:55,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1879036110] [2019-11-21 12:27:55,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-21 12:27:56,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 39 conjunts are in the unsatisfiable core [2019-11-21 12:27:56,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-21 12:27:56,059 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:27:56,060 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:27:56,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:56,076 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:56,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:27:56,081 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:56,081 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2019-11-21 12:27:56,082 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:56,090 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:56,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:56,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:10 [2019-11-21 12:27:56,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:27:56,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2019-11-21 12:27:56,394 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:56,428 INFO L567 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2019-11-21 12:27:56,432 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-21 12:27:56,433 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:56,433 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 14 [2019-11-21 12:27:56,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-21 12:27:56,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:56,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-21 12:27:56,441 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:11 [2019-11-21 12:27:56,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 12:27:56,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-21 12:27:57,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:27:57,290 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2019-11-21 12:27:57,291 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:57,310 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 42 [2019-11-21 12:27:57,311 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:57,329 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:57,329 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2019-11-21 12:27:57,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:57,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:57,331 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:57,448 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-21 12:27:57,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:57,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:57,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-21 12:27:57,450 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:145, output treesize:137 [2019-11-21 12:27:57,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:57,809 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 35 [2019-11-21 12:27:57,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:58,275 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-21 12:27:58,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-21 12:27:58,659 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-11-21 12:27:58,660 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:58,684 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 51 [2019-11-21 12:27:58,684 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:58,741 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-21 12:27:58,742 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 69 [2019-11-21 12:27:58,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:58,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-21 12:27:58,744 INFO L496 ElimStorePlain]: Start of recursive call 4: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-21 12:27:58,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-21 12:27:58,946 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:384) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-21 12:27:58,953 INFO L168 Benchmark]: Toolchain (without parser) took 143900.51 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 239.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -171.0 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:58,953 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:27:58,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 832.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:58,954 INFO L168 Benchmark]: Boogie Preprocessor took 152.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:58,955 INFO L168 Benchmark]: RCFGBuilder took 1569.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.7 MB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. [2019-11-21 12:27:58,955 INFO L168 Benchmark]: TraceAbstraction took 141340.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 975.7 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-21 12:27:58,957 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.27 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 832.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -137.8 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 152.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1569.75 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 975.7 MB in the end (delta: 105.1 MB). Peak memory consumption was 105.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 141340.13 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 105.9 MB). Free memory was 975.7 MB in the beginning and 1.1 GB in the end (delta: -150.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...