./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer --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 95dd23c3faf110dda910911db52d9ffd09e9e4b3 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer --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 95dd23c3faf110dda910911db52d9ffd09e9e4b3 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 15:40:25,024 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 15:40:25,025 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 15:40:25,030 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 15:40:25,031 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 15:40:25,031 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 15:40:25,032 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 15:40:25,032 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 15:40:25,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 15:40:25,033 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 15:40:25,034 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 15:40:25,034 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 15:40:25,034 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 15:40:25,035 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 15:40:25,035 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 15:40:25,036 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 15:40:25,036 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 15:40:25,037 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 15:40:25,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 15:40:25,038 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 15:40:25,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 15:40:25,039 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 15:40:25,040 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 15:40:25,041 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 15:40:25,041 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 15:40:25,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 15:40:25,042 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 15:40:25,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 15:40:25,042 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 15:40:25,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 15:40:25,043 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 15:40:25,043 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 15:40:25,043 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 15:40:25,043 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 15:40:25,044 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 15:40:25,044 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 15:40:25,044 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-12-02 15:40:25,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 15:40:25,051 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 15:40:25,052 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 15:40:25,052 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 15:40:25,052 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 15:40:25,052 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 15:40:25,052 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 15:40:25,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 15:40:25,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 15:40:25,052 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 15:40:25,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 15:40:25,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 15:40:25,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 15:40:25,054 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 15:40:25,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 15:40:25,054 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 15:40:25,054 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 15:40:25,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer 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 -> 95dd23c3faf110dda910911db52d9ffd09e9e4b3 [2018-12-02 15:40:25,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:40:25,081 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:40:25,083 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:40:25,084 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:40:25,085 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:40:25,085 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 15:40:25,122 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/560c6830b/3b75243997e64ce8b6afca1c3e1d3d60/FLAGed598e4e6 [2018-12-02 15:40:25,603 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:40:25,603 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 15:40:25,610 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/560c6830b/3b75243997e64ce8b6afca1c3e1d3d60/FLAGed598e4e6 [2018-12-02 15:40:25,619 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/560c6830b/3b75243997e64ce8b6afca1c3e1d3d60 [2018-12-02 15:40:25,621 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:40:25,622 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 15:40:25,623 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:40:25,623 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:40:25,625 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:40:25,625 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f067e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25, skipping insertion in model container [2018-12-02 15:40:25,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,631 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:40:25,652 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:40:25,866 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:40:25,878 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:40:25,911 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:40:25,941 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:40:25,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25 WrapperNode [2018-12-02 15:40:25,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:40:25,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:40:25,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:40:25,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:40:25,950 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,950 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,976 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,981 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... [2018-12-02 15:40:25,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:40:25,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:40:25,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:40:25,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:40:25,986 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 15:40:26,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-12-02 15:40:26,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-12-02 15:40:26,019 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 15:40:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:40:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-02 15:40:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-02 15:40:26,020 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 15:40:26,020 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 15:40:26,021 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 15:40:26,022 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 15:40:26,023 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 15:40:26,024 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 15:40:26,025 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-12-02 15:40:26,026 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2018-12-02 15:40:26,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-12-02 15:40:26,028 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-12-02 15:40:26,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-12-02 15:40:26,249 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 15:40:26,363 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 15:40:26,479 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:40:26,479 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 15:40:26,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:40:26 BoogieIcfgContainer [2018-12-02 15:40:26,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:40:26,480 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:40:26,480 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:40:26,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:40:26,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:40:25" (1/3) ... [2018-12-02 15:40:26,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8508f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:40:26, skipping insertion in model container [2018-12-02 15:40:26,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:25" (2/3) ... [2018-12-02 15:40:26,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8508f23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:40:26, skipping insertion in model container [2018-12-02 15:40:26,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:40:26" (3/3) ... [2018-12-02 15:40:26,484 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 15:40:26,490 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:40:26,495 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-12-02 15:40:26,505 INFO L257 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2018-12-02 15:40:26,519 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:40:26,520 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:40:26,520 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 15:40:26,520 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:40:26,520 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:40:26,520 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:40:26,520 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:40:26,520 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:40:26,520 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:40:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-12-02 15:40:26,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 15:40:26,535 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:26,535 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:26,537 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:26,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1318867473, now seen corresponding path program 1 times [2018-12-02 15:40:26,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:26,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:26,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:26,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:26,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:40:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:40:26,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:40:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:40:26,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:26,676 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2018-12-02 15:40:26,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:26,730 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-02 15:40:26,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:40:26,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 15:40:26,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:26,737 INFO L225 Difference]: With dead ends: 41 [2018-12-02 15:40:26,737 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 15:40:26,738 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 15:40:26,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-12-02 15:40:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 15:40:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 15:40:26,767 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2018-12-02 15:40:26,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:26,767 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 15:40:26,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:40:26,767 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 15:40:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 15:40:26,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:26,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:26,769 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:26,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash 423942862, now seen corresponding path program 1 times [2018-12-02 15:40:26,769 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:26,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:26,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:26,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:26,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:40:26,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:40:26,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:40:26,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:40:26,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:40:26,808 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-02 15:40:26,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:26,834 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-12-02 15:40:26,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:40:26,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 15:40:26,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:26,836 INFO L225 Difference]: With dead ends: 39 [2018-12-02 15:40:26,836 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 15:40:26,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:40:26,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 15:40:26,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-02 15:40:26,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 15:40:26,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-02 15:40:26,841 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-12-02 15:40:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:26,842 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-02 15:40:26,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:40:26,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-02 15:40:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 15:40:26,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:26,843 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:26,843 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:26,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2065280679, now seen corresponding path program 1 times [2018-12-02 15:40:26,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:26,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:26,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:26,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:26,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:40:26,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:40:26,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:40:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:40:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:40:26,895 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-12-02 15:40:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:26,912 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-12-02 15:40:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:40:26,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 15:40:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:26,914 INFO L225 Difference]: With dead ends: 46 [2018-12-02 15:40:26,914 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 15:40:26,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:40:26,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 15:40:26,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-02 15:40:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 15:40:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-02 15:40:26,918 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2018-12-02 15:40:26,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:26,919 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 15:40:26,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:40:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-02 15:40:26,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:40:26,920 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:26,920 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:26,920 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:26,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1396667935, now seen corresponding path program 1 times [2018-12-02 15:40:26,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:26,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:26,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:26,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:26,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:26,992 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:26,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:27,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:27,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:27,045 INFO L478 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 [2018-12-02 15:40:27,046 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,048 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 15:40:27,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:27,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:27,082 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 15:40:27,082 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,098 INFO L267 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. [2018-12-02 15:40:27,098 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-12-02 15:40:27,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:27,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:27,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 8 [2018-12-02 15:40:27,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:40:27,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:40:27,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:40:27,130 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 9 states. [2018-12-02 15:40:27,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:27,309 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2018-12-02 15:40:27,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:40:27,309 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-12-02 15:40:27,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:27,310 INFO L225 Difference]: With dead ends: 63 [2018-12-02 15:40:27,310 INFO L226 Difference]: Without dead ends: 63 [2018-12-02 15:40:27,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2018-12-02 15:40:27,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-02 15:40:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2018-12-02 15:40:27,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 15:40:27,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-02 15:40:27,314 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2018-12-02 15:40:27,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:27,315 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-02 15:40:27,315 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:40:27,315 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-02 15:40:27,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:40:27,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:27,316 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:27,316 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:27,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:27,316 INFO L82 PathProgramCache]: Analyzing trace with hash 1396667936, now seen corresponding path program 1 times [2018-12-02 15:40:27,316 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:27,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:27,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:27,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:27,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:27,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:27,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:27,447 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:27,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:27,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:27,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:27,472 INFO L478 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 [2018-12-02 15:40:27,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,478 INFO L478 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 [2018-12-02 15:40:27,478 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 15:40:27,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:27,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:27,530 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:27,530 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,540 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:40:27,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:27,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:40:27,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:27,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:27,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2018-12-02 15:40:27,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 15:40:27,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:40:27,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:40:27,574 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 11 states. [2018-12-02 15:40:27,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:27,813 INFO L93 Difference]: Finished difference Result 60 states and 73 transitions. [2018-12-02 15:40:27,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 15:40:27,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2018-12-02 15:40:27,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:27,814 INFO L225 Difference]: With dead ends: 60 [2018-12-02 15:40:27,814 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 15:40:27,815 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2018-12-02 15:40:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 15:40:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 44. [2018-12-02 15:40:27,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 15:40:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-12-02 15:40:27,818 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 22 [2018-12-02 15:40:27,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:27,819 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-12-02 15:40:27,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 15:40:27,819 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-12-02 15:40:27,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:40:27,819 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:27,819 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:27,820 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:27,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:27,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1103264928, now seen corresponding path program 1 times [2018-12-02 15:40:27,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:27,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:27,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:27,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:27,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-02 15:40:27,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:27,846 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:27,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:27,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:27,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-02 15:40:27,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 5 [2018-12-02 15:40:27,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:40:27,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:40:27,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:27,886 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 5 states. [2018-12-02 15:40:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:27,893 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 15:40:27,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:40:27,893 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 15:40:27,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:27,894 INFO L225 Difference]: With dead ends: 32 [2018-12-02 15:40:27,894 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 15:40:27,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:27,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 15:40:27,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 15:40:27,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 15:40:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-02 15:40:27,896 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2018-12-02 15:40:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:27,896 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 15:40:27,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:40:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-02 15:40:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 15:40:27,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:27,897 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:27,897 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:27,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:27,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2122225147, now seen corresponding path program 1 times [2018-12-02 15:40:27,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:27,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:27,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:27,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:27,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:40:27,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:27,924 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:27,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:27,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:27,947 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:27,962 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:40:27,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:27,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-12-02 15:40:27,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 15:40:27,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 15:40:27,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:40:27,979 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 7 states. [2018-12-02 15:40:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:28,003 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-02 15:40:28,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:40:28,003 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-02 15:40:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:28,004 INFO L225 Difference]: With dead ends: 37 [2018-12-02 15:40:28,004 INFO L226 Difference]: Without dead ends: 37 [2018-12-02 15:40:28,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 15:40:28,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-02 15:40:28,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-12-02 15:40:28,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 15:40:28,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-12-02 15:40:28,007 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 27 [2018-12-02 15:40:28,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:28,007 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-12-02 15:40:28,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 15:40:28,007 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-12-02 15:40:28,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 15:40:28,008 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:28,008 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:28,008 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:28,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:28,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1065839756, now seen corresponding path program 1 times [2018-12-02 15:40:28,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:28,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:28,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:28,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:40:28,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:28,172 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:28,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:28,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:28,198 INFO L478 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 [2018-12-02 15:40:28,198 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,204 INFO L478 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 [2018-12-02 15:40:28,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,209 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,209 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 15:40:28,241 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:28,242 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:40:28,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,250 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:28,251 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:28,251 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:28,251 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,256 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:40:28,279 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:28,281 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:40:28,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:28,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:28,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:28,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:28,300 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:40:28,315 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:40:28,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:28,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-12-02 15:40:28,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 15:40:28,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 15:40:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-12-02 15:40:28,331 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 15 states. [2018-12-02 15:40:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:29,662 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-02 15:40:29,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 15:40:29,663 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2018-12-02 15:40:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:29,663 INFO L225 Difference]: With dead ends: 56 [2018-12-02 15:40:29,663 INFO L226 Difference]: Without dead ends: 56 [2018-12-02 15:40:29,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2018-12-02 15:40:29,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-02 15:40:29,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 35. [2018-12-02 15:40:29,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 15:40:29,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-02 15:40:29,667 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 31 [2018-12-02 15:40:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:29,667 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-02 15:40:29,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 15:40:29,667 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-02 15:40:29,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 15:40:29,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:29,668 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:29,668 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:29,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:29,668 INFO L82 PathProgramCache]: Analyzing trace with hash 2026286375, now seen corresponding path program 2 times [2018-12-02 15:40:29,668 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:29,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:29,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:29,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:29,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:29,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:29,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:40:29,698 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:29,698 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:29,707 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:40:29,727 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:40:29,728 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:29,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:29,763 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:40:29,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:29,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2018-12-02 15:40:29,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 15:40:29,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 15:40:29,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:40:29,779 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 9 states. [2018-12-02 15:40:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:29,805 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-12-02 15:40:29,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 15:40:29,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2018-12-02 15:40:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:29,806 INFO L225 Difference]: With dead ends: 42 [2018-12-02 15:40:29,806 INFO L226 Difference]: Without dead ends: 42 [2018-12-02 15:40:29,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2018-12-02 15:40:29,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-02 15:40:29,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 37. [2018-12-02 15:40:29,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-02 15:40:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-12-02 15:40:29,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 36 [2018-12-02 15:40:29,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:29,809 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-12-02 15:40:29,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 15:40:29,809 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-12-02 15:40:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:40:29,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:29,809 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:29,810 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:29,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1656146784, now seen corresponding path program 2 times [2018-12-02 15:40:29,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:29,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:29,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:29,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:29,949 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-12-02 15:40:29,949 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:29,949 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:29,957 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:40:29,978 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:40:29,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:29,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:29,993 INFO L478 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 [2018-12-02 15:40:29,994 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,004 INFO L478 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 [2018-12-02 15:40:30,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,008 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:19, output treesize:14 [2018-12-02 15:40:30,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,062 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:30,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,071 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,072 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,072 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:30,072 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:40:30,079 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-02 15:40:30,134 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,136 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:30,136 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:30,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:40:30,156 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-02 15:40:30,211 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,212 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:30,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:30,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,223 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:30,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:30,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:40:30,230 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:33, output treesize:17 [2018-12-02 15:40:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-12-02 15:40:30,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:30,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 21 [2018-12-02 15:40:30,269 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-02 15:40:30,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-02 15:40:30,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-12-02 15:40:30,269 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 22 states. [2018-12-02 15:40:32,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:32,341 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-12-02 15:40:32,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 15:40:32,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-12-02 15:40:32,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:32,342 INFO L225 Difference]: With dead ends: 74 [2018-12-02 15:40:32,342 INFO L226 Difference]: Without dead ends: 74 [2018-12-02 15:40:32,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=1320, Unknown=0, NotChecked=0, Total=1560 [2018-12-02 15:40:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-02 15:40:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 36. [2018-12-02 15:40:32,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-02 15:40:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2018-12-02 15:40:32,347 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 40 [2018-12-02 15:40:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:32,347 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2018-12-02 15:40:32,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-02 15:40:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2018-12-02 15:40:32,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 15:40:32,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:32,348 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:32,349 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:32,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:32,349 INFO L82 PathProgramCache]: Analyzing trace with hash 625469307, now seen corresponding path program 3 times [2018-12-02 15:40:32,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:32,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:32,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,350 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:32,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 15:40:32,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:32,392 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:32,399 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:40:32,422 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-02 15:40:32,422 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:32,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:32,460 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-12-02 15:40:32,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:32,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2018-12-02 15:40:32,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 15:40:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 15:40:32,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:40:32,476 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand 11 states. [2018-12-02 15:40:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:32,512 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2018-12-02 15:40:32,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:40:32,512 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2018-12-02 15:40:32,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:32,513 INFO L225 Difference]: With dead ends: 45 [2018-12-02 15:40:32,513 INFO L226 Difference]: Without dead ends: 45 [2018-12-02 15:40:32,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2018-12-02 15:40:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-02 15:40:32,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-12-02 15:40:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 15:40:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-02 15:40:32,516 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 45 [2018-12-02 15:40:32,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:32,516 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-02 15:40:32,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 15:40:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-12-02 15:40:32,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:40:32,516 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:32,517 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:32,517 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:32,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:32,517 INFO L82 PathProgramCache]: Analyzing trace with hash -979301465, now seen corresponding path program 4 times [2018-12-02 15:40:32,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:32,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,518 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:32,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:32,564 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 15:40:32,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:32,565 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:32,573 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 15:40:32,594 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 15:40:32,594 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:32,595 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:32,638 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 15:40:32,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:32,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-12-02 15:40:32,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 15:40:32,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 15:40:32,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:40:32,653 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 13 states. [2018-12-02 15:40:32,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:32,700 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2018-12-02 15:40:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 15:40:32,700 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-12-02 15:40:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:32,700 INFO L225 Difference]: With dead ends: 50 [2018-12-02 15:40:32,701 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 15:40:32,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=88, Unknown=0, NotChecked=0, Total=156 [2018-12-02 15:40:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 15:40:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2018-12-02 15:40:32,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-02 15:40:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-12-02 15:40:32,703 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 54 [2018-12-02 15:40:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:32,703 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-12-02 15:40:32,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 15:40:32,703 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-12-02 15:40:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 15:40:32,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:32,704 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:32,704 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:32,704 INFO L82 PathProgramCache]: Analyzing trace with hash -907028229, now seen corresponding path program 5 times [2018-12-02 15:40:32,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:32,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,705 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:32,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:32,762 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-02 15:40:32,762 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:32,762 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:32,768 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 15:40:32,801 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-12-02 15:40:32,801 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:32,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-12-02 15:40:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-12-02 15:40:32,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-12-02 15:40:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-12-02 15:40:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-12-02 15:40:32,877 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 15 states. [2018-12-02 15:40:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:32,919 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-12-02 15:40:32,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:40:32,919 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 63 [2018-12-02 15:40:32,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:32,920 INFO L225 Difference]: With dead ends: 55 [2018-12-02 15:40:32,920 INFO L226 Difference]: Without dead ends: 55 [2018-12-02 15:40:32,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=90, Invalid=120, Unknown=0, NotChecked=0, Total=210 [2018-12-02 15:40:32,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-02 15:40:32,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-12-02 15:40:32,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-02 15:40:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-12-02 15:40:32,922 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 63 [2018-12-02 15:40:32,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:32,922 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-12-02 15:40:32,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-12-02 15:40:32,923 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-12-02 15:40:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 15:40:32,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:32,923 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:32,923 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:32,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1257190873, now seen corresponding path program 6 times [2018-12-02 15:40:32,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:32,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:32,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 15:40:32,976 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:32,976 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:32,984 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 15:40:33,085 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-12-02 15:40:33,085 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:33,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:33,147 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-12-02 15:40:33,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:33,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2018-12-02 15:40:33,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 15:40:33,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 15:40:33,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-12-02 15:40:33,163 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 17 states. [2018-12-02 15:40:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:33,213 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2018-12-02 15:40:33,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:40:33,213 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-12-02 15:40:33,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:33,213 INFO L225 Difference]: With dead ends: 60 [2018-12-02 15:40:33,213 INFO L226 Difference]: Without dead ends: 60 [2018-12-02 15:40:33,214 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2018-12-02 15:40:33,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-02 15:40:33,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-12-02 15:40:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-02 15:40:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-12-02 15:40:33,216 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 72 [2018-12-02 15:40:33,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:33,216 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-12-02 15:40:33,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 15:40:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-12-02 15:40:33,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 15:40:33,217 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:33,217 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:33,217 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:33,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1846438523, now seen corresponding path program 7 times [2018-12-02 15:40:33,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:33,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:33,218 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:33,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:33,283 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-02 15:40:33,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:33,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:33,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:33,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:33,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:33,393 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-12-02 15:40:33,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:33,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-12-02 15:40:33,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 15:40:33,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 15:40:33,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-12-02 15:40:33,409 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 19 states. [2018-12-02 15:40:33,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:33,470 INFO L93 Difference]: Finished difference Result 65 states and 83 transitions. [2018-12-02 15:40:33,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 15:40:33,470 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 81 [2018-12-02 15:40:33,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:33,471 INFO L225 Difference]: With dead ends: 65 [2018-12-02 15:40:33,471 INFO L226 Difference]: Without dead ends: 65 [2018-12-02 15:40:33,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=143, Invalid=199, Unknown=0, NotChecked=0, Total=342 [2018-12-02 15:40:33,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-02 15:40:33,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2018-12-02 15:40:33,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-02 15:40:33,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 77 transitions. [2018-12-02 15:40:33,474 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 77 transitions. Word has length 81 [2018-12-02 15:40:33,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:33,474 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 77 transitions. [2018-12-02 15:40:33,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 15:40:33,475 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-12-02 15:40:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-12-02 15:40:33,475 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:33,475 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:33,475 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:33,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:33,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1870796633, now seen corresponding path program 8 times [2018-12-02 15:40:33,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:33,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:33,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:33,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:33,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 15:40:33,577 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:33,577 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:33,587 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:40:33,620 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:40:33,620 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:33,622 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-02 15:40:33,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:33,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2018-12-02 15:40:33,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-12-02 15:40:33,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-02 15:40:33,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-02 15:40:33,721 INFO L87 Difference]: Start difference. First operand 61 states and 77 transitions. Second operand 21 states. [2018-12-02 15:40:33,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:33,804 INFO L93 Difference]: Finished difference Result 70 states and 90 transitions. [2018-12-02 15:40:33,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:40:33,805 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 90 [2018-12-02 15:40:33,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:33,805 INFO L225 Difference]: With dead ends: 70 [2018-12-02 15:40:33,805 INFO L226 Difference]: Without dead ends: 70 [2018-12-02 15:40:33,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-12-02 15:40:33,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-02 15:40:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2018-12-02 15:40:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 15:40:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2018-12-02 15:40:33,809 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 90 [2018-12-02 15:40:33,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:33,809 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2018-12-02 15:40:33,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-12-02 15:40:33,810 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2018-12-02 15:40:33,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 15:40:33,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:33,811 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:33,811 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:33,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:33,811 INFO L82 PathProgramCache]: Analyzing trace with hash -583296005, now seen corresponding path program 9 times [2018-12-02 15:40:33,812 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:33,812 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:33,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:33,812 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:33,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:33,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:33,908 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 15:40:33,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:33,908 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:33,914 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:40:34,289 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-12-02 15:40:34,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:34,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:34,365 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-12-02 15:40:34,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:34,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-12-02 15:40:34,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 15:40:34,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 15:40:34,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=298, Unknown=0, NotChecked=0, Total=506 [2018-12-02 15:40:34,381 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 23 states. [2018-12-02 15:40:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:34,462 INFO L93 Difference]: Finished difference Result 75 states and 97 transitions. [2018-12-02 15:40:34,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 15:40:34,462 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 99 [2018-12-02 15:40:34,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:34,463 INFO L225 Difference]: With dead ends: 75 [2018-12-02 15:40:34,463 INFO L226 Difference]: Without dead ends: 75 [2018-12-02 15:40:34,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=223, Invalid=329, Unknown=0, NotChecked=0, Total=552 [2018-12-02 15:40:34,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-12-02 15:40:34,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 71. [2018-12-02 15:40:34,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-12-02 15:40:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2018-12-02 15:40:34,467 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 99 [2018-12-02 15:40:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:34,467 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2018-12-02 15:40:34,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 15:40:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2018-12-02 15:40:34,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 15:40:34,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:34,468 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:34,468 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr2REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_list_add_tailErr0REQUIRES_VIOLATION, ldv_list_add_tailErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr1REQUIRES_VIOLATION, ldv_dev_get_drvdataErr0REQUIRES_VIOLATION, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:34,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:34,468 INFO L82 PathProgramCache]: Analyzing trace with hash 391145255, now seen corresponding path program 10 times [2018-12-02 15:40:34,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 15:40:34,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 15:40:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:34,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:40:34,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 15:40:34,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:40:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:40:34,539 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 15:40:34,553 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 15:40:34,558 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 51 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 15:40:34,559 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 41 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 15:40:34,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:40:34 BoogieIcfgContainer [2018-12-02 15:40:34,578 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:40:34,579 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:40:34,579 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:40:34,579 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:40:34,579 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:40:26" (3/4) ... [2018-12-02 15:40:34,583 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 15:40:34,583 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:40:34,584 INFO L168 Benchmark]: Toolchain (without parser) took 8962.13 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 180.9 MB). Free memory was 951.7 MB in the beginning and 839.5 MB in the end (delta: 112.2 MB). Peak memory consumption was 293.1 MB. Max. memory is 11.5 GB. [2018-12-02 15:40:34,585 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:40:34,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-12-02 15:40:34,586 INFO L168 Benchmark]: Boogie Preprocessor took 44.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:40:34,586 INFO L168 Benchmark]: RCFGBuilder took 494.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.3 MB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:40:34,587 INFO L168 Benchmark]: TraceAbstraction took 8098.12 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 966.3 MB in the beginning and 839.5 MB in the end (delta: 126.8 MB). Peak memory consumption was 209.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:40:34,587 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 839.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:40:34,589 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.82 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 98.0 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.04 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 494.03 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 966.3 MB in the end (delta: 105.0 MB). Peak memory consumption was 105.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8098.12 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 82.8 MB). Free memory was 966.3 MB in the beginning and 839.5 MB in the end (delta: 126.8 MB). Peak memory consumption was 209.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.55 ms. Allocated memory is still 1.2 GB. Free memory is still 839.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 51 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 41 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={66:0}] [L1453] CALL entry_point() VAL [ldv_global_msg_list={66:0}] [L1439] int len = 10; VAL [ldv_global_msg_list={66:0}, len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40, ldv_global_msg_list={66:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=40, \result={50:0}, ldv_global_msg_list={66:0}, malloc(size)={50:0}, size=40] [L1440] RET, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_global_msg_list={66:0}, ldv_malloc(sizeof(struct A18*)*len)={50:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={50:0}, i=0, ldv_global_msg_list={66:0}, len=10] [L1443] COND FALSE !(!array) VAL [array={50:0}, i=0, ldv_global_msg_list={66:0}, len=10] [L1444] COND TRUE i main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer 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 -> 95dd23c3faf110dda910911db52d9ffd09e9e4b3 [2018-12-02 15:40:35,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 15:40:35,887 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 15:40:35,889 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 15:40:35,890 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 15:40:35,891 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 15:40:35,891 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/../../sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 15:40:35,937 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/21fa066d6/8e5e5a4dded547ccb9fa41f535bbda2d/FLAG25095c952 [2018-12-02 15:40:36,391 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 15:40:36,392 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/sv-benchmarks/c/ldv-memsafety/memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 15:40:36,399 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/21fa066d6/8e5e5a4dded547ccb9fa41f535bbda2d/FLAG25095c952 [2018-12-02 15:40:36,408 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/data/21fa066d6/8e5e5a4dded547ccb9fa41f535bbda2d [2018-12-02 15:40:36,410 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 15:40:36,411 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-12-02 15:40:36,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 15:40:36,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 15:40:36,413 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 15:40:36,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,415 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e4ba08e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36, skipping insertion in model container [2018-12-02 15:40:36,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,420 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 15:40:36,442 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 15:40:36,633 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:40:36,646 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 15:40:36,720 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 15:40:36,754 INFO L195 MainTranslator]: Completed translation [2018-12-02 15:40:36,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36 WrapperNode [2018-12-02 15:40:36,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 15:40:36,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 15:40:36,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 15:40:36,755 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 15:40:36,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,763 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,795 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... [2018-12-02 15:40:36,799 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 15:40:36,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 15:40:36,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 15:40:36,800 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 15:40:36,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 15:40:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 15:40:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2018-12-02 15:40:36,830 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_nonpositive [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_positive [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_del [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add_tail [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2018-12-02 15:40:36,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_alloc [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_fill [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_msg_free [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_submit_msg [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_destroy_msgs [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_get_drvdata [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_set_drvdata [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_add_return [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_sub_return [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_sub [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_init [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_get [2018-12-02 15:40:36,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kref_put [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_del [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_cleanup [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_release [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_put [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_get [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init_internal [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_init [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kobject_create [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure entry_point [2018-12-02 15:40:36,833 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 15:40:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2018-12-02 15:40:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2018-12-02 15:40:36,834 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-12-02 15:40:36,834 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-12-02 15:40:36,835 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-12-02 15:40:36,836 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-12-02 15:40:36,837 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-12-02 15:40:36,838 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-12-02 15:40:36,839 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_nonpositive [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_positive [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure memcpy [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-12-02 15:40:36,840 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_del [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add_tail [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_alloc [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_fill [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_msg_free [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_submit_msg [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_destroy_msgs [2018-12-02 15:40:36,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_get_drvdata [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_set_drvdata [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_add_return [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_sub_return [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_sub [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_init [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_get [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kref_put [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_del [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_cleanup [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_release [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_put [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_get [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init_internal [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_init [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kobject_create [2018-12-02 15:40:36,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure entry_point [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~intINTTYPE4 [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2018-12-02 15:40:36,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2018-12-02 15:40:37,112 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 15:40:37,360 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-02 15:40:37,581 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 15:40:37,581 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-02 15:40:37,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:40:37 BoogieIcfgContainer [2018-12-02 15:40:37,581 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 15:40:37,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 15:40:37,582 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 15:40:37,584 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 15:40:37,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 03:40:36" (1/3) ... [2018-12-02 15:40:37,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af7219e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:40:37, skipping insertion in model container [2018-12-02 15:40:37,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:40:36" (2/3) ... [2018-12-02 15:40:37,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1af7219e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 03:40:37, skipping insertion in model container [2018-12-02 15:40:37,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:40:37" (3/3) ... [2018-12-02 15:40:37,586 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test18_3_false-valid-memtrack_true-termination.i [2018-12-02 15:40:37,593 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 15:40:37,598 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 69 error locations. [2018-12-02 15:40:37,608 INFO L257 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2018-12-02 15:40:37,625 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 15:40:37,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 15:40:37,626 INFO L383 AbstractCegarLoop]: Hoare is false [2018-12-02 15:40:37,626 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 15:40:37,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 15:40:37,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 15:40:37,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 15:40:37,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 15:40:37,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 15:40:37,636 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2018-12-02 15:40:37,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 15:40:37,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:37,643 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:37,644 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:37,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:37,647 INFO L82 PathProgramCache]: Analyzing trace with hash -38416848, now seen corresponding path program 1 times [2018-12-02 15:40:37,650 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:37,650 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:37,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:37,711 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:37,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:37,759 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:40:37,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:40:37,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:40:37,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:40:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:40:37,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:37,775 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 5 states. [2018-12-02 15:40:37,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:37,851 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-12-02 15:40:37,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:40:37,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-02 15:40:37,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:37,859 INFO L225 Difference]: With dead ends: 41 [2018-12-02 15:40:37,859 INFO L226 Difference]: Without dead ends: 38 [2018-12-02 15:40:37,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:37,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-02 15:40:37,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2018-12-02 15:40:37,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-02 15:40:37,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-02 15:40:37,888 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2018-12-02 15:40:37,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:37,888 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-02 15:40:37,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:40:37,888 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-02 15:40:37,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-02 15:40:37,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:37,889 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:37,890 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:37,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:37,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1704393487, now seen corresponding path program 1 times [2018-12-02 15:40:37,890 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:37,890 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:37,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:37,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:37,928 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:37,934 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:40:37,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:40:37,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 15:40:37,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 15:40:37,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 15:40:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:40:37,937 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-02 15:40:37,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:37,980 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-12-02 15:40:37,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 15:40:37,982 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-02 15:40:37,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:37,983 INFO L225 Difference]: With dead ends: 39 [2018-12-02 15:40:37,983 INFO L226 Difference]: Without dead ends: 36 [2018-12-02 15:40:37,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 15:40:37,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-02 15:40:37,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-02 15:40:37,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-02 15:40:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-12-02 15:40:37,988 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 17 [2018-12-02 15:40:37,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:37,989 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-12-02 15:40:37,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 15:40:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-12-02 15:40:37,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 15:40:37,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:37,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:37,990 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:37,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:37,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1190422937, now seen corresponding path program 1 times [2018-12-02 15:40:37,990 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:37,991 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:38,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:38,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:38,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:38,050 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:40:38,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:40:38,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 15:40:38,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 15:40:38,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 15:40:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:40:38,052 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 4 states. [2018-12-02 15:40:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:38,098 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2018-12-02 15:40:38,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 15:40:38,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 15:40:38,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:38,100 INFO L225 Difference]: With dead ends: 46 [2018-12-02 15:40:38,100 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 15:40:38,101 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 15:40:38,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 15:40:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 35. [2018-12-02 15:40:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-02 15:40:38,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-02 15:40:38,106 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 18 [2018-12-02 15:40:38,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:38,106 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-02 15:40:38,106 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 15:40:38,106 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-02 15:40:38,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:40:38,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:38,107 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:38,107 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:38,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:38,108 INFO L82 PathProgramCache]: Analyzing trace with hash -198421859, now seen corresponding path program 1 times [2018-12-02 15:40:38,108 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:38,108 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:38,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:38,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:38,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:38,192 INFO L478 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 [2018-12-02 15:40:38,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:38,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:38,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-12-02 15:40:38,616 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|)) is different from true [2018-12-02 15:40:38,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 11 [2018-12-02 15:40:38,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:38,633 INFO L267 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. [2018-12-02 15:40:38,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2018-12-02 15:40:38,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 15:40:38,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:38,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:38,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2018-12-02 15:40:38,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 15:40:38,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 15:40:38,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=27, Unknown=5, NotChecked=10, Total=56 [2018-12-02 15:40:38,733 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 8 states. [2018-12-02 15:40:39,684 WARN L180 SmtUtils]: Spent 920.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-12-02 15:40:39,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:39,900 INFO L93 Difference]: Finished difference Result 53 states and 64 transitions. [2018-12-02 15:40:39,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 15:40:39,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-12-02 15:40:39,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:39,902 INFO L225 Difference]: With dead ends: 53 [2018-12-02 15:40:39,902 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 15:40:39,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=32, Invalid=73, Unknown=9, NotChecked=18, Total=132 [2018-12-02 15:40:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 15:40:39,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2018-12-02 15:40:39,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-02 15:40:39,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2018-12-02 15:40:39,906 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 22 [2018-12-02 15:40:39,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:39,906 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2018-12-02 15:40:39,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 15:40:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2018-12-02 15:40:39,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:40:39,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:39,907 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:39,907 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:39,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:39,908 INFO L82 PathProgramCache]: Analyzing trace with hash -198421858, now seen corresponding path program 1 times [2018-12-02 15:40:39,908 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:39,908 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:39,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:39,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:39,972 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:39,986 INFO L478 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 [2018-12-02 15:40:39,986 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:39,998 INFO L478 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 [2018-12-02 15:40:39,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:40,011 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:40,011 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:40,793 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:40:40,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:40,805 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:40,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:40,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:40,825 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:40,825 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:40,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:40,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:40:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 15:40:40,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:41,114 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:41,115 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:41,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:41,155 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:41,160 INFO L478 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 [2018-12-02 15:40:41,160 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:41,173 INFO L478 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 [2018-12-02 15:40:41,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:41,181 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:41,182 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:41,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:41,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:41,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:41,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:41,214 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:41,214 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:41,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:41,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:41,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2018-12-02 15:40:41,231 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:41,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:41,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-12-02 15:40:41,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 15:40:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 15:40:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=88, Unknown=1, NotChecked=18, Total=132 [2018-12-02 15:40:41,400 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand 10 states. [2018-12-02 15:40:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:41,811 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2018-12-02 15:40:41,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 15:40:41,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-02 15:40:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:41,812 INFO L225 Difference]: With dead ends: 49 [2018-12-02 15:40:41,812 INFO L226 Difference]: Without dead ends: 49 [2018-12-02 15:40:41,812 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=54, Invalid=221, Unknown=1, NotChecked=30, Total=306 [2018-12-02 15:40:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-02 15:40:41,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 44. [2018-12-02 15:40:41,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 15:40:41,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 57 transitions. [2018-12-02 15:40:41,816 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 57 transitions. Word has length 22 [2018-12-02 15:40:41,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:41,816 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 57 transitions. [2018-12-02 15:40:41,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 15:40:41,816 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 57 transitions. [2018-12-02 15:40:41,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 15:40:41,817 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:41,817 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:41,817 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:41,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash -491824866, now seen corresponding path program 1 times [2018-12-02 15:40:41,817 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:41,817 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:41,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:41,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:41,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 15:40:41,885 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-02 15:40:41,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 15:40:41,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 15:40:41,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 15:40:41,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 15:40:41,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:41,887 INFO L87 Difference]: Start difference. First operand 44 states and 57 transitions. Second operand 5 states. [2018-12-02 15:40:41,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:41,905 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2018-12-02 15:40:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 15:40:41,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-12-02 15:40:41,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:41,906 INFO L225 Difference]: With dead ends: 32 [2018-12-02 15:40:41,906 INFO L226 Difference]: Without dead ends: 30 [2018-12-02 15:40:41,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 15:40:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-02 15:40:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-12-02 15:40:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-02 15:40:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-12-02 15:40:41,909 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2018-12-02 15:40:41,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:41,909 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-12-02 15:40:41,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 15:40:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-12-02 15:40:41,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 15:40:41,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:41,910 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:41,910 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:41,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:41,910 INFO L82 PathProgramCache]: Analyzing trace with hash -768653187, now seen corresponding path program 1 times [2018-12-02 15:40:41,910 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:41,910 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:41,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:41,967 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:41,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:40:41,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:42,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-02 15:40:42,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:42,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-12-02 15:40:42,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 15:40:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 15:40:42,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-02 15:40:42,018 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 8 states. [2018-12-02 15:40:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:42,129 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2018-12-02 15:40:42,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 15:40:42,130 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-12-02 15:40:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:42,130 INFO L225 Difference]: With dead ends: 44 [2018-12-02 15:40:42,130 INFO L226 Difference]: Without dead ends: 44 [2018-12-02 15:40:42,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-12-02 15:40:42,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-02 15:40:42,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-12-02 15:40:42,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 15:40:42,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 52 transitions. [2018-12-02 15:40:42,134 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 52 transitions. Word has length 27 [2018-12-02 15:40:42,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:42,134 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 52 transitions. [2018-12-02 15:40:42,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 15:40:42,134 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-12-02 15:40:42,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 15:40:42,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:42,135 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:42,135 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:42,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:42,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1856173644, now seen corresponding path program 1 times [2018-12-02 15:40:42,135 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:42,135 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:42,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:42,226 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:42,241 INFO L478 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 [2018-12-02 15:40:42,241 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:42,249 INFO L478 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 [2018-12-02 15:40:42,249 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:42,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:42,255 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:43,158 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:40:43,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,166 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,166 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:43,166 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,189 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:40:43,189 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:40:43,244 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,247 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:43,247 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,261 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,262 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:43,263 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,273 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,273 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:43,291 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-12-02 15:40:43,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:43,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:43,572 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:43,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:40:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:40:43,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:43,608 INFO L478 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 [2018-12-02 15:40:43,608 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,616 INFO L478 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 [2018-12-02 15:40:43,617 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:43,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,633 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:43,633 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,648 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:43,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:43,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,692 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:40:43,693 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,709 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,710 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:43,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:43,711 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,721 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:43,721 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:40:43,723 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 4 not checked. [2018-12-02 15:40:43,724 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:43,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:43,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-12-02 15:40:43,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 15:40:43,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 15:40:43,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2018-12-02 15:40:43,943 INFO L87 Difference]: Start difference. First operand 42 states and 52 transitions. Second operand 12 states. [2018-12-02 15:40:44,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:44,402 INFO L93 Difference]: Finished difference Result 46 states and 55 transitions. [2018-12-02 15:40:44,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 15:40:44,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-12-02 15:40:44,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:44,403 INFO L225 Difference]: With dead ends: 46 [2018-12-02 15:40:44,403 INFO L226 Difference]: Without dead ends: 46 [2018-12-02 15:40:44,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=75, Invalid=348, Unknown=1, NotChecked=38, Total=462 [2018-12-02 15:40:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-02 15:40:44,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-12-02 15:40:44,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 15:40:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2018-12-02 15:40:44,406 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 31 [2018-12-02 15:40:44,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:44,406 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2018-12-02 15:40:44,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 15:40:44,406 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2018-12-02 15:40:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 15:40:44,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:44,406 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:44,407 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:44,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1213852510, now seen corresponding path program 2 times [2018-12-02 15:40:44,407 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:44,407 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:44,421 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 15:40:44,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:40:44,519 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:44,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:44,531 INFO L478 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 [2018-12-02 15:40:44,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:44,540 INFO L478 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 [2018-12-02 15:40:44,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:44,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:44,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:45,462 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:40:45,468 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:45,470 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:40:45,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,492 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:45,494 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:45,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:45,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:40:45,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:45,543 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:45,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:45,544 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,561 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:45,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:45,644 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:45,646 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:45,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:45,647 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,672 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:45,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,683 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:45,683 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:45,705 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 6 not checked. [2018-12-02 15:40:45,705 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:46,037 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:46,037 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:46,043 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:40:46,081 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:40:46,081 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:46,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:46,088 INFO L478 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 [2018-12-02 15:40:46,088 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:46,097 INFO L478 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 [2018-12-02 15:40:46,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:46,103 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:46,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:47,631 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 15:40:47,641 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,643 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,644 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 15:40:47,644 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,670 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:47,670 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:40:47,685 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 15:40:47,767 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:47,770 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,795 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,796 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:40:47,796 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-12-02 15:40:47,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:14 [2018-12-02 15:40:47,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,856 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:47,856 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,871 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:47,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:47,873 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,882 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:47,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2018-12-02 15:40:47,886 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:48,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:48,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 16 [2018-12-02 15:40:48,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-02 15:40:48,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-02 15:40:48,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=223, Unknown=2, NotChecked=62, Total=342 [2018-12-02 15:40:48,080 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand 17 states. [2018-12-02 15:40:50,243 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 15:40:50,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:40:50,786 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2018-12-02 15:40:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 15:40:50,786 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 40 [2018-12-02 15:40:50,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:40:50,787 INFO L225 Difference]: With dead ends: 50 [2018-12-02 15:40:50,787 INFO L226 Difference]: Without dead ends: 50 [2018-12-02 15:40:50,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 64 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=110, Invalid=546, Unknown=2, NotChecked=98, Total=756 [2018-12-02 15:40:50,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-02 15:40:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-12-02 15:40:50,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-02 15:40:50,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-12-02 15:40:50,789 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 40 [2018-12-02 15:40:50,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:40:50,789 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-12-02 15:40:50,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-02 15:40:50,790 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-12-02 15:40:50,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 15:40:50,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:40:50,790 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:40:50,790 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:40:50,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:40:50,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1913604340, now seen corresponding path program 3 times [2018-12-02 15:40:50,791 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:40:50,791 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/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 [2018-12-02 15:40:50,809 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 15:40:50,999 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 15:40:50,999 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:51,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:51,015 INFO L478 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 [2018-12-02 15:40:51,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:51,024 INFO L478 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 [2018-12-02 15:40:51,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:51,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:51,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:52,016 WARN L180 SmtUtils]: Spent 925.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 15:40:52,021 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:52,023 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:52,024 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:52,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:52,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:52,040 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-12-02 15:40:52,109 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:52,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:52,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:52,111 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,124 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:52,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,135 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-02 15:40:52,876 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:40:52,881 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:52,882 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:52,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:52,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,895 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:52,895 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,905 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:52,905 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:53,013 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,015 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:53,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,030 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,031 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,031 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:53,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 12 not checked. [2018-12-02 15:40:53,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:53,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:40:53,448 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:40:53,455 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:40:53,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-12-02 15:40:53,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:40:53,798 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:40:53,802 INFO L478 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 [2018-12-02 15:40:53,802 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,809 INFO L478 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 [2018-12-02 15:40:53,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:40:53,822 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,824 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:53,825 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,844 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:53,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:40:53,863 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,865 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:53,865 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,880 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,881 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:40:53,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,891 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:40:53,899 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,900 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:53,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,914 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,915 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,915 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:53,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,925 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,925 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:53,965 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:40:53,970 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:40:53,970 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,987 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:40:53,987 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:40:53,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:40:54,001 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 4 proven. 31 refuted. 0 times theorem prover too weak. 24 trivial. 8 not checked. [2018-12-02 15:40:54,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:40:54,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:40:54,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 18 [2018-12-02 15:40:54,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 15:40:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 15:40:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=324, Unknown=1, NotChecked=36, Total=420 [2018-12-02 15:40:54,206 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 19 states. [2018-12-02 15:40:56,599 WARN L180 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 31 DAG size of output: 24 [2018-12-02 15:41:03,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:41:03,837 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2018-12-02 15:41:03,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 15:41:03,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-12-02 15:41:03,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:41:03,838 INFO L225 Difference]: With dead ends: 54 [2018-12-02 15:41:03,838 INFO L226 Difference]: Without dead ends: 54 [2018-12-02 15:41:03,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 80 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=142, Invalid=983, Unknown=1, NotChecked=64, Total=1190 [2018-12-02 15:41:03,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-02 15:41:03,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-12-02 15:41:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-12-02 15:41:03,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2018-12-02 15:41:03,842 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 49 [2018-12-02 15:41:03,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:41:03,842 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2018-12-02 15:41:03,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 15:41:03,842 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2018-12-02 15:41:03,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 15:41:03,843 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:41:03,843 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:41:03,843 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:41:03,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:41:03,844 INFO L82 PathProgramCache]: Analyzing trace with hash 209115111, now seen corresponding path program 2 times [2018-12-02 15:41:03,844 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:41:03,844 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:41:03,859 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 15:41:03,964 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:41:03,965 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:03,968 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-12-02 15:41:04,041 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:04,346 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-02 15:41:04,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:41:04,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2018-12-02 15:41:04,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-12-02 15:41:04,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-12-02 15:41:04,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=245, Unknown=0, NotChecked=0, Total=342 [2018-12-02 15:41:04,349 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 19 states. [2018-12-02 15:41:05,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:41:05,306 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2018-12-02 15:41:05,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 15:41:05,306 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 54 [2018-12-02 15:41:05,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:41:05,307 INFO L225 Difference]: With dead ends: 77 [2018-12-02 15:41:05,307 INFO L226 Difference]: Without dead ends: 77 [2018-12-02 15:41:05,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=464, Unknown=0, NotChecked=0, Total=702 [2018-12-02 15:41:05,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-12-02 15:41:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2018-12-02 15:41:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 15:41:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 97 transitions. [2018-12-02 15:41:05,311 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 97 transitions. Word has length 54 [2018-12-02 15:41:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:41:05,311 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 97 transitions. [2018-12-02 15:41:05,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-12-02 15:41:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 97 transitions. [2018-12-02 15:41:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 15:41:05,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:41:05,312 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:41:05,312 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:41:05,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:41:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 890950686, now seen corresponding path program 4 times [2018-12-02 15:41:05,313 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:41:05,313 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:41:05,328 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 15:41:05,495 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 15:41:05,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:05,500 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:05,514 INFO L478 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 [2018-12-02 15:41:05,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:05,524 INFO L478 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 [2018-12-02 15:41:05,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:05,530 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:05,530 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:06,466 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:41:06,470 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,472 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,472 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:06,472 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,488 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:06,489 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,499 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:06,535 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,537 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:06,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,552 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,553 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,553 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:41:06,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:41:06,602 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,605 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:06,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:41:06,620 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,630 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:41:06,674 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,675 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:06,676 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,692 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:06,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:41:06,748 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:06,750 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:06,750 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,767 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:06,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:06,778 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:41:06,804 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2018-12-02 15:41:06,804 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:07,156 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:41:07,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:41:07,163 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 15:41:07,217 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 15:41:07,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:07,222 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:07,225 INFO L478 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 [2018-12-02 15:41:07,225 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,233 INFO L478 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 [2018-12-02 15:41:07,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,239 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,239 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:07,245 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,247 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:07,248 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,267 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:07,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,282 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,282 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:07,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,294 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:41:07,294 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,319 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:07,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,329 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:41:07,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,338 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:07,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,354 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,355 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,355 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:07,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,366 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:07,372 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,374 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:07,375 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,389 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,390 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,390 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:07,391 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:07,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,468 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:07,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,488 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,489 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:07,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:07,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:07,500 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:41:07,505 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 5 proven. 51 refuted. 0 times theorem prover too weak. 40 trivial. 10 not checked. [2018-12-02 15:41:07,505 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:07,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:41:07,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-12-02 15:41:07,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-12-02 15:41:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-12-02 15:41:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2018-12-02 15:41:07,743 INFO L87 Difference]: Start difference. First operand 72 states and 97 transitions. Second operand 18 states. [2018-12-02 15:41:09,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:41:09,024 INFO L93 Difference]: Finished difference Result 82 states and 106 transitions. [2018-12-02 15:41:09,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 15:41:09,025 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 58 [2018-12-02 15:41:09,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:41:09,026 INFO L225 Difference]: With dead ends: 82 [2018-12-02 15:41:09,026 INFO L226 Difference]: Without dead ends: 82 [2018-12-02 15:41:09,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=138, Invalid=921, Unknown=1, NotChecked=62, Total=1122 [2018-12-02 15:41:09,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-12-02 15:41:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 72. [2018-12-02 15:41:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 15:41:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 96 transitions. [2018-12-02 15:41:09,030 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 96 transitions. Word has length 58 [2018-12-02 15:41:09,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:41:09,030 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 96 transitions. [2018-12-02 15:41:09,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-12-02 15:41:09,030 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 96 transitions. [2018-12-02 15:41:09,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:41:09,030 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:41:09,030 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:41:09,030 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:41:09,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:41:09,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1561839564, now seen corresponding path program 5 times [2018-12-02 15:41:09,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:41:09,031 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:41:09,044 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-12-02 15:41:09,368 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-02 15:41:09,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:09,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:09,401 INFO L478 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 [2018-12-02 15:41:09,401 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:09,406 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:09,406 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-12-02 15:41:10,334 WARN L854 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| |c_ldv_malloc_#in~size|))) is different from true [2018-12-02 15:41:10,339 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:10,346 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 15 [2018-12-02 15:41:10,346 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 15:41:10,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 15:41:10,362 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:32 [2018-12-02 15:41:11,334 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:41:11,342 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,347 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 56 [2018-12-02 15:41:11,363 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 15:41:11,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,462 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,462 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-12-02 15:41:11,463 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:11,465 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-12-02 15:41:11,467 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:11,537 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,539 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:11,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-02 15:41:11,539 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:11,611 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 15:41:11,611 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:11,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-02 15:41:11,668 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 9 variables, input treesize:74, output treesize:54 [2018-12-02 15:41:13,176 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 15:41:13,183 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:13,184 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:13,185 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 15:41:13,185 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,215 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:13,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:13,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2018-12-02 15:41:13,306 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:13,308 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:13,308 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:13,309 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-12-02 15:41:13,309 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,340 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:13,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:13,365 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:44, output treesize:41 [2018-12-02 15:41:13,461 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:13,461 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:13,462 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:13,463 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-12-02 15:41:13,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,494 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:13,494 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,519 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,519 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:54, output treesize:14 [2018-12-02 15:41:13,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:13,610 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:13,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:13,611 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,624 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:13,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:13,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:13,676 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 12 proven. 80 refuted. 0 times theorem prover too weak. 28 trivial. 34 not checked. [2018-12-02 15:41:13,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:14,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:41:14,056 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:41:14,064 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-02 15:41:16,571 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-12-02 15:41:16,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:16,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:16,581 INFO L478 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 [2018-12-02 15:41:16,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,590 INFO L478 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 [2018-12-02 15:41:16,590 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,595 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:16,731 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,732 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,732 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:41:16,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,746 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:16,746 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:41:16,777 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,779 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:16,779 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,792 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,794 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:16,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,804 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2018-12-02 15:41:16,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,845 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:16,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,861 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,862 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,862 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 15:41:16,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:16,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 15:41:16,910 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,911 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:16,911 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:16,912 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-12-02 15:41:16,912 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,939 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:16,939 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:16,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:16,964 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:42 [2018-12-02 15:41:17,046 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:17,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:17,049 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:17,049 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:17,050 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 67 [2018-12-02 15:41:17,050 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:17,101 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:17,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:17,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:17,138 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:60, output treesize:62 [2018-12-02 15:41:17,369 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:17,370 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:17,370 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:17,370 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:17,371 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-12-02 15:41:17,372 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:17,419 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:17,419 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:17,457 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:17,457 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:75, output treesize:14 [2018-12-02 15:41:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 76 refuted. 0 times theorem prover too weak. 42 trivial. 30 not checked. [2018-12-02 15:41:17,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:17,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:41:17,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20] total 32 [2018-12-02 15:41:17,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 15:41:17,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 15:41:17,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=883, Unknown=3, NotChecked=186, Total=1190 [2018-12-02 15:41:17,736 INFO L87 Difference]: Start difference. First operand 72 states and 96 transitions. Second operand 33 states. [2018-12-02 15:41:25,032 WARN L180 SmtUtils]: Spent 7.07 s on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2018-12-02 15:41:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:41:28,585 INFO L93 Difference]: Finished difference Result 111 states and 147 transitions. [2018-12-02 15:41:28,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 15:41:28,586 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 67 [2018-12-02 15:41:28,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:41:28,586 INFO L225 Difference]: With dead ends: 111 [2018-12-02 15:41:28,586 INFO L226 Difference]: Without dead ends: 111 [2018-12-02 15:41:28,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 6 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=245, Invalid=2116, Unknown=3, NotChecked=288, Total=2652 [2018-12-02 15:41:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-12-02 15:41:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 89. [2018-12-02 15:41:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-12-02 15:41:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 119 transitions. [2018-12-02 15:41:28,591 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 119 transitions. Word has length 67 [2018-12-02 15:41:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:41:28,591 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 119 transitions. [2018-12-02 15:41:28,591 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 15:41:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 119 transitions. [2018-12-02 15:41:28,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:41:28,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:41:28,592 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:41:28,592 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:41:28,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:41:28,592 INFO L82 PathProgramCache]: Analyzing trace with hash 723023891, now seen corresponding path program 1 times [2018-12-02 15:41:28,592 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:41:28,592 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:41:28,609 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:41:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:41:28,831 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:28,841 INFO L478 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 [2018-12-02 15:41:28,841 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:28,851 INFO L478 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 [2018-12-02 15:41:28,851 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:28,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:28,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:29,782 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:41:29,787 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,789 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:29,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,803 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,804 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,804 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:29,804 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:29,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,851 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:29,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,865 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,866 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:29,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,876 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,876 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:29,934 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,936 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:29,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:29,936 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,953 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:29,953 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,963 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:29,963 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:30,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:30,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:30,008 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:30,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,025 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:30,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:30,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:30,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:30,085 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:30,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,102 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:30,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,112 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 50 trivial. 20 not checked. [2018-12-02 15:41:30,142 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:30,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:41:30,528 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:41:30,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:41:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:41:30,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:30,602 INFO L478 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 [2018-12-02 15:41:30,603 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,611 INFO L478 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 [2018-12-02 15:41:30,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:30,625 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:30,628 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:30,628 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:41:30,628 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,647 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:30,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,658 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:30,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:41:31,488 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 15:41:31,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,495 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:31,495 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,514 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,518 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 15:41:31,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,533 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:31,533 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:26 [2018-12-02 15:41:31,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,661 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,661 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 15:41:31,662 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,693 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:31,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,710 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,710 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:41, output treesize:14 [2018-12-02 15:41:31,716 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,719 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:31,719 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,734 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:31,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,744 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:31,781 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,783 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:31,783 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,797 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,798 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:31,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:31,798 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,808 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:31,808 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:31,816 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 42 trivial. 28 not checked. [2018-12-02 15:41:31,817 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:32,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:41:32,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 20] total 22 [2018-12-02 15:41:32,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-12-02 15:41:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-12-02 15:41:32,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=431, Unknown=3, NotChecked=86, Total=600 [2018-12-02 15:41:32,046 INFO L87 Difference]: Start difference. First operand 89 states and 119 transitions. Second operand 23 states. [2018-12-02 15:41:33,774 WARN L180 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 15:41:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:41:34,750 INFO L93 Difference]: Finished difference Result 129 states and 173 transitions. [2018-12-02 15:41:34,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 15:41:34,751 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 67 [2018-12-02 15:41:34,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:41:34,751 INFO L225 Difference]: With dead ends: 129 [2018-12-02 15:41:34,751 INFO L226 Difference]: Without dead ends: 129 [2018-12-02 15:41:34,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 113 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=148, Invalid=979, Unknown=3, NotChecked=130, Total=1260 [2018-12-02 15:41:34,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-12-02 15:41:34,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 94. [2018-12-02 15:41:34,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 15:41:34,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 126 transitions. [2018-12-02 15:41:34,757 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 126 transitions. Word has length 67 [2018-12-02 15:41:34,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:41:34,757 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 126 transitions. [2018-12-02 15:41:34,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-12-02 15:41:34,757 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 126 transitions. [2018-12-02 15:41:34,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 15:41:34,758 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:41:34,758 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:41:34,758 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:41:34,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:41:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1212636396, now seen corresponding path program 2 times [2018-12-02 15:41:34,759 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:41:34,759 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:41:34,774 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 15:41:34,959 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:41:34,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:34,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:34,974 INFO L478 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 [2018-12-02 15:41:34,974 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:34,982 INFO L478 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 [2018-12-02 15:41:34,982 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:34,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:34,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:35,932 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:41:35,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:35,939 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:35,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:35,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:35,955 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:35,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:35,956 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:35,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:35,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:36,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,041 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:36,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,056 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,057 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,057 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:36,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,068 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,068 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:36,124 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,126 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:36,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,147 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,148 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,149 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:36,149 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,166 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,166 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:41:36,270 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,272 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:36,272 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:36,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,295 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:36,295 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,310 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:41:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 44 trivial. 24 not checked. [2018-12-02 15:41:36,368 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:36,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:41:36,730 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:41:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:41:36,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:41:36,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:36,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:36,803 INFO L478 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 [2018-12-02 15:41:36,803 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,809 INFO L478 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 [2018-12-02 15:41:36,809 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:36,814 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:37,373 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 15:41:37,380 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:37,382 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:37,382 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:37,402 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:37,403 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:37,403 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 15:41:37,403 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:37,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:37,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:27 [2018-12-02 15:41:37,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:37,620 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:37,621 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:37,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:37,655 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:37,656 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:37,656 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-12-02 15:41:37,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:37,681 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:37,682 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:44 [2018-12-02 15:41:37,841 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:37,842 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:37,842 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 55 [2018-12-02 15:41:37,843 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:37,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:37,889 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:37,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:37,923 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:61, output treesize:61 [2018-12-02 15:41:38,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:38,120 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:38,120 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:38,168 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:38,169 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:38,171 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:38,172 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:38,172 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:38,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2018-12-02 15:41:38,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:38,213 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:38,213 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:72, output treesize:14 [2018-12-02 15:41:38,225 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 6 proven. 80 refuted. 0 times theorem prover too weak. 38 trivial. 30 not checked. [2018-12-02 15:41:38,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:38,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:41:38,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2018-12-02 15:41:38,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-12-02 15:41:38,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-12-02 15:41:38,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=601, Unknown=2, NotChecked=102, Total=812 [2018-12-02 15:41:38,450 INFO L87 Difference]: Start difference. First operand 94 states and 126 transitions. Second operand 27 states. [2018-12-02 15:41:40,417 WARN L180 SmtUtils]: Spent 1.79 s on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-12-02 15:41:45,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:41:45,413 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2018-12-02 15:41:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-02 15:41:45,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 67 [2018-12-02 15:41:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:41:45,415 INFO L225 Difference]: With dead ends: 143 [2018-12-02 15:41:45,415 INFO L226 Difference]: Without dead ends: 143 [2018-12-02 15:41:45,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=237, Invalid=1749, Unknown=2, NotChecked=174, Total=2162 [2018-12-02 15:41:45,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-12-02 15:41:45,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 72. [2018-12-02 15:41:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 15:41:45,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2018-12-02 15:41:45,419 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 67 [2018-12-02 15:41:45,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:41:45,419 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2018-12-02 15:41:45,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-12-02 15:41:45,419 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2018-12-02 15:41:45,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 15:41:45,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:41:45,420 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:41:45,420 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:41:45,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:41:45,420 INFO L82 PathProgramCache]: Analyzing trace with hash 440077534, now seen corresponding path program 6 times [2018-12-02 15:41:45,421 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:41:45,421 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:41:45,441 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2018-12-02 15:41:46,248 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-02 15:41:46,248 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:41:46,271 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:41:46,282 INFO L478 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 [2018-12-02 15:41:46,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:46,290 INFO L478 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 [2018-12-02 15:41:46,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:46,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:46,296 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:41:47,282 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 15:41:47,287 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,288 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,288 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-12-02 15:41:47,289 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:47,310 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:47,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:47,322 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:47,322 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:29 [2018-12-02 15:41:47,379 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:47,383 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:47,411 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,413 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,413 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:47,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 42 [2018-12-02 15:41:47,414 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:47,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:47,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:46, output treesize:42 [2018-12-02 15:41:47,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:47,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:47,570 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,572 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:47,574 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:47,574 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 59 [2018-12-02 15:41:47,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:47,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-12-02 15:41:47,607 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:59, output treesize:59 [2018-12-02 15:41:48,680 WARN L180 SmtUtils]: Spent 951.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 15:41:48,686 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:48,689 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:48,693 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:48,694 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:48,695 INFO L683 Elim1Store]: detected equality via solver [2018-12-02 15:41:48,695 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 41 [2018-12-02 15:41:48,696 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:48,741 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:48,742 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:48,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:48,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:72, output treesize:18 [2018-12-02 15:41:48,938 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:48,940 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:48,940 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:41:48,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:48,957 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:48,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:48,967 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:48,967 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:18 [2018-12-02 15:41:49,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:49,066 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:41:49,066 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:49,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:49,083 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:49,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:41:49,083 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:49,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:49,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:18 [2018-12-02 15:41:50,358 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:41:50,365 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:50,367 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:41:50,368 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:50,385 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:50,386 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:41:50,386 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:41:50,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:41:50,396 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:41:50,396 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:41:50,441 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 112 refuted. 0 times theorem prover too weak. 54 trivial. 38 not checked. [2018-12-02 15:41:50,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:41:50,875 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:41:50,875 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:41:50,881 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-12-02 15:42:11,718 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2018-12-02 15:42:11,719 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:42:11,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:42:11,732 INFO L478 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 [2018-12-02 15:42:11,732 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,742 INFO L478 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 [2018-12-02 15:42:11,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:42:11,756 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:11,759 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:11,759 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,774 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:11,775 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:11,775 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:11,775 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,785 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,785 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:11,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:11,875 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:11,876 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:11,876 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,893 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:11,893 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:11,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:11,985 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:11,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:11,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:11,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,002 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:12,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:12,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,063 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:12,063 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,081 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:12,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,092 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:12,099 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,101 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:12,101 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,116 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,117 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:12,118 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:42:12,170 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,172 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:12,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,186 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,187 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:12,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,198 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,198 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:12,273 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,275 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:12,276 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,290 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,291 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:12,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:12,291 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:12,303 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:12,312 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 7 proven. 106 refuted. 0 times theorem prover too weak. 84 trivial. 14 not checked. [2018-12-02 15:42:12,312 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:42:12,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:42:12,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21] total 32 [2018-12-02 15:42:12,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-12-02 15:42:12,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-12-02 15:42:12,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=935, Unknown=2, NotChecked=126, Total=1190 [2018-12-02 15:42:12,594 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand 33 states. [2018-12-02 15:42:16,182 WARN L180 SmtUtils]: Spent 3.34 s on a formula simplification. DAG size of input: 35 DAG size of output: 30 [2018-12-02 15:42:36,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:42:36,674 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2018-12-02 15:42:36,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-02 15:42:36,674 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 76 [2018-12-02 15:42:36,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:42:36,675 INFO L225 Difference]: With dead ends: 101 [2018-12-02 15:42:36,675 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 15:42:36,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=306, Invalid=2780, Unknown=2, NotChecked=218, Total=3306 [2018-12-02 15:42:36,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 15:42:36,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 72. [2018-12-02 15:42:36,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 15:42:36,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 94 transitions. [2018-12-02 15:42:36,679 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 94 transitions. Word has length 76 [2018-12-02 15:42:36,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:42:36,679 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 94 transitions. [2018-12-02 15:42:36,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-12-02 15:42:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 94 transitions. [2018-12-02 15:42:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 15:42:36,680 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:42:36,680 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:42:36,681 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:42:36,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:42:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash -912533644, now seen corresponding path program 7 times [2018-12-02 15:42:36,681 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:42:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:42:36,697 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 15:42:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:42:37,051 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:42:37,064 INFO L478 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 [2018-12-02 15:42:37,064 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:37,074 INFO L478 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 [2018-12-02 15:42:37,074 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:37,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:37,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:42:38,611 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:42:38,617 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,619 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,619 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:38,619 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,637 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:38,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,648 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:38,683 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,685 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,685 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:38,686 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,702 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:38,702 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:42:38,751 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,753 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:38,753 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,769 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:38,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,779 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:38,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,831 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:38,832 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,852 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:38,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:38,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,928 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:38,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,948 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:38,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:38,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:38,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:39,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,054 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:39,055 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,077 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,078 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,079 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:39,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,092 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:39,188 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,190 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:39,190 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,213 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:39,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:39,275 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,277 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:39,277 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,292 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,293 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:39,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,304 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:42:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2018-12-02 15:42:39,341 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:42:39,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:42:39,750 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:42:39,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 15:42:39,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 15:42:39,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:42:39,854 INFO L478 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 [2018-12-02 15:42:39,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,865 INFO L478 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 [2018-12-02 15:42:39,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:42:39,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,879 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:39,879 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,894 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,895 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:39,896 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:42:39,912 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,915 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:39,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,930 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,931 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,931 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:39,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,942 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:42:39,949 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,951 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:39,951 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,966 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:39,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:39,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:39,984 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,986 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:39,986 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:39,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,004 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:40,004 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,014 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:40,020 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,022 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:40,022 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,039 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:40,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:40,058 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,061 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,062 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:40,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,079 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:40,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,090 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,090 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:40,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,097 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,097 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:40,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,113 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:40,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,123 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:40,162 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,163 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:40,164 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,180 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:40,180 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:40,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:40,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:40,202 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 8 proven. 141 refuted. 0 times theorem prover too weak. 112 trivial. 16 not checked. [2018-12-02 15:42:40,202 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:42:40,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:42:40,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-12-02 15:42:40,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-12-02 15:42:40,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-12-02 15:42:40,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=522, Unknown=1, NotChecked=46, Total=650 [2018-12-02 15:42:40,498 INFO L87 Difference]: Start difference. First operand 72 states and 94 transitions. Second operand 24 states. [2018-12-02 15:42:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:42:42,929 INFO L93 Difference]: Finished difference Result 88 states and 109 transitions. [2018-12-02 15:42:42,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 15:42:42,929 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 85 [2018-12-02 15:42:42,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:42:42,930 INFO L225 Difference]: With dead ends: 88 [2018-12-02 15:42:42,930 INFO L226 Difference]: Without dead ends: 88 [2018-12-02 15:42:42,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=201, Invalid=1782, Unknown=1, NotChecked=86, Total=2070 [2018-12-02 15:42:42,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-02 15:42:42,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2018-12-02 15:42:42,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 15:42:42,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 93 transitions. [2018-12-02 15:42:42,932 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 93 transitions. Word has length 85 [2018-12-02 15:42:42,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:42:42,932 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 93 transitions. [2018-12-02 15:42:42,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-12-02 15:42:42,932 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 93 transitions. [2018-12-02 15:42:42,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 15:42:42,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:42:42,933 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:42:42,933 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:42:42,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:42:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash 2089194910, now seen corresponding path program 8 times [2018-12-02 15:42:42,934 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:42:42,934 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:42:42,951 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-12-02 15:42:43,317 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:42:43,317 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:42:43,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:42:43,350 INFO L478 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 [2018-12-02 15:42:43,350 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:43,361 INFO L478 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 [2018-12-02 15:42:43,361 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:43,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:43,368 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:42:44,038 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:42:44,045 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,047 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:44,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,063 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,064 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:44,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,074 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:44,110 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,111 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:44,112 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,128 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:44,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:44,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,179 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:44,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,194 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,195 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:44,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,205 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:42:44,247 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,250 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:44,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,265 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,266 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,267 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:44,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,279 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:44,330 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,331 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,332 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:44,332 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,351 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:44,351 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:44,434 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,437 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:44,438 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,469 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:44,469 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,489 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:44,597 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,599 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:44,600 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,634 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:44,634 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,670 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:44,864 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:44,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:44,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,917 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:44,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,946 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:44,946 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:45,114 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,116 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:45,116 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,131 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,132 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:45,132 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,142 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,142 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:45,182 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2018-12-02 15:42:45,182 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:42:45,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:42:45,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:42:45,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-02 15:42:45,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-02 15:42:45,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:42:45,802 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:42:45,806 INFO L478 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 [2018-12-02 15:42:45,806 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,820 INFO L478 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 [2018-12-02 15:42:45,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,826 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:42:45,834 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,836 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:45,836 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:45,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,866 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:28, output treesize:12 [2018-12-02 15:42:45,872 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,874 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:45,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:45,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,900 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,901 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:42:45,907 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,909 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:45,909 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,924 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,925 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:45,925 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:45,941 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,943 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:45,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,957 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,958 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,959 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:42:45,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,969 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,969 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:42:45,975 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,976 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:45,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:45,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:45,990 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:45,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:46,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,007 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,007 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:46,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,024 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:46,024 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,034 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:46,040 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,041 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:46,042 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,059 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:46,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,069 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,069 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:46,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,078 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:46,079 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,095 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:46,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,107 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,107 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:46,179 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,181 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:46,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,197 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,198 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:46,198 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:46,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,210 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:46,210 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:46,226 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 9 proven. 181 refuted. 0 times theorem prover too weak. 144 trivial. 18 not checked. [2018-12-02 15:42:46,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:42:46,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:42:46,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-12-02 15:42:46,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-12-02 15:42:46,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-12-02 15:42:46,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=616, Unknown=1, NotChecked=50, Total=756 [2018-12-02 15:42:46,521 INFO L87 Difference]: Start difference. First operand 72 states and 93 transitions. Second operand 26 states. [2018-12-02 15:42:48,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:42:48,978 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2018-12-02 15:42:48,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-12-02 15:42:48,979 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 94 [2018-12-02 15:42:48,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:42:48,979 INFO L225 Difference]: With dead ends: 90 [2018-12-02 15:42:48,979 INFO L226 Difference]: Without dead ends: 90 [2018-12-02 15:42:48,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 163 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=222, Invalid=2133, Unknown=1, NotChecked=94, Total=2450 [2018-12-02 15:42:48,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-02 15:42:48,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2018-12-02 15:42:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-12-02 15:42:48,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 92 transitions. [2018-12-02 15:42:48,981 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 92 transitions. Word has length 94 [2018-12-02 15:42:48,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:42:48,982 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 92 transitions. [2018-12-02 15:42:48,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-12-02 15:42:48,982 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 92 transitions. [2018-12-02 15:42:48,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-02 15:42:48,982 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:42:48,982 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:42:48,983 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:42:48,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:42:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash 115222196, now seen corresponding path program 9 times [2018-12-02 15:42:48,983 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:42:48,983 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:42:49,006 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-12-02 15:42:49,985 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 15:42:49,985 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:42:50,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:42:50,027 INFO L478 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 [2018-12-02 15:42:50,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:50,036 INFO L478 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 [2018-12-02 15:42:50,037 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:50,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:50,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:42:51,840 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)) (= (store |c_old(#valid)| |ldv_malloc_#t~malloc12.base| (_ bv1 1)) |c_#valid|))) is different from true [2018-12-02 15:42:51,848 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:51,849 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:51,849 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-12-02 15:42:51,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:51,872 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:51,872 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:51,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-02 15:42:51,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:28 [2018-12-02 15:42:52,897 WARN L180 SmtUtils]: Spent 943.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-12-02 15:42:52,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:52,905 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:52,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:52,927 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:52,928 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:52,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:52,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-12-02 15:42:52,929 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:52,947 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:52,947 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:39, output treesize:16 [2018-12-02 15:42:53,035 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:53,038 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:53,038 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:53,052 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:53,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:53,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:53,054 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:53,064 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:53,064 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:16 [2018-12-02 15:42:54,041 WARN L854 $PredicateComparison]: unable to prove that (exists ((ldv_malloc_~size (_ BitVec 32)) (|ldv_malloc_#t~malloc12.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |ldv_malloc_#t~malloc12.base| ldv_malloc_~size)) (= (select |c_old(#valid)| |ldv_malloc_#t~malloc12.base|) (_ bv0 1)))) is different from true [2018-12-02 15:42:54,047 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,049 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:54,049 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,064 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,065 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:54,065 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:54,142 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,145 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:54,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,169 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:42:54,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:42:54,345 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,352 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 15 [2018-12-02 15:42:54,352 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-12-02 15:42:54,365 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-02 15:42:54,365 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:33 [2018-12-02 15:42:54,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 19 [2018-12-02 15:42:54,543 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,578 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,585 INFO L478 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2018-12-02 15:42:54,585 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-12-02 15:42:54,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-12-02 15:42:54,609 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:50, output treesize:44 [2018-12-02 15:42:54,901 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,902 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-12-02 15:42:54,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:54,954 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,956 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:54,956 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-12-02 15:42:54,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,003 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,006 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,020 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 44 [2018-12-02 15:42:55,020 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-02 15:42:55,095 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 25 [2018-12-02 15:42:55,096 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,145 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-12-02 15:42:55,145 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:74, output treesize:66 [2018-12-02 15:42:55,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,549 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:55,549 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,563 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,564 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:55,565 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,577 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,577 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:55,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,795 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:42:55,795 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,810 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,811 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:42:55,811 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:42:55,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:42:55,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:42:55,888 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 18 proven. 272 refuted. 0 times theorem prover too weak. 78 trivial. 68 not checked. [2018-12-02 15:42:55,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:42:56,466 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 15:42:56,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FPBP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 15:42:56,472 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:43:22,456 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 15:43:22,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 15:43:22,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 15:43:22,473 INFO L478 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 [2018-12-02 15:43:22,473 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,483 INFO L478 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 [2018-12-02 15:43:22,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,490 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,490 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-12-02 15:43:22,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,502 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:22,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:43:22,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:43:22,575 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,576 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,576 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:43:22,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,589 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:22,589 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,599 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:43:22,605 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,607 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:22,607 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,622 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,623 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:43:22,623 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,632 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,632 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:43:22,639 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,641 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:43:22,641 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:43:22,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:12 [2018-12-02 15:43:22,673 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,675 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:22,675 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,690 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,691 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:43:22,692 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,702 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:43:22,754 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,756 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:22,756 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,771 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,772 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,772 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-02 15:43:22,772 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,782 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,782 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:14 [2018-12-02 15:43:22,835 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,838 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:22,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,853 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:43:22,855 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,864 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:43:22,950 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,952 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-12-02 15:43:22,952 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,967 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,968 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:22,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:43:22,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:22,978 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:43:23,033 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:23,035 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:23,035 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:23,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:23,050 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:23,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:43:23,051 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:23,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:23,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:43:23,144 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:23,146 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-12-02 15:43:23,146 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:23,163 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:23,164 INFO L701 Elim1Store]: detected not equals via solver [2018-12-02 15:43:23,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-12-02 15:43:23,164 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-02 15:43:23,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-02 15:43:23,176 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:14 [2018-12-02 15:43:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 436 backedges. 10 proven. 226 refuted. 0 times theorem prover too weak. 180 trivial. 20 not checked. [2018-12-02 15:43:23,194 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 15:43:23,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-02 15:43:23,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 27] total 44 [2018-12-02 15:43:23,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-12-02 15:43:23,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-12-02 15:43:23,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1833, Unknown=2, NotChecked=174, Total=2162 [2018-12-02 15:43:23,564 INFO L87 Difference]: Start difference. First operand 72 states and 92 transitions. Second operand 45 states. [2018-12-02 15:43:27,870 WARN L180 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2018-12-02 15:43:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 15:43:47,218 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2018-12-02 15:43:47,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-12-02 15:43:47,218 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 103 [2018-12-02 15:43:47,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 15:43:47,219 INFO L225 Difference]: With dead ends: 101 [2018-12-02 15:43:47,219 INFO L226 Difference]: Without dead ends: 101 [2018-12-02 15:43:47,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 160 SyntacticMatches, 5 SemanticMatches, 69 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 894 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=347, Invalid=4351, Unknown=2, NotChecked=270, Total=4970 [2018-12-02 15:43:47,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-02 15:43:47,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 75. [2018-12-02 15:43:47,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 15:43:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 97 transitions. [2018-12-02 15:43:47,225 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 97 transitions. Word has length 103 [2018-12-02 15:43:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 15:43:47,225 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 97 transitions. [2018-12-02 15:43:47,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-12-02 15:43:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 97 transitions. [2018-12-02 15:43:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-02 15:43:47,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 15:43:47,226 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 15:43:47,226 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ldv_kref_initErr1REQUIRES_VIOLATION, ldv_kref_initErr0REQUIRES_VIOLATION, ldv_list_addErr0REQUIRES_VIOLATION, ldv_list_addErr1REQUIRES_VIOLATION, ldv_kobject_createErr0REQUIRES_VIOLATION, ldv_kobject_createErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr1REQUIRES_VIOLATION, ldv_destroy_msgsErr2REQUIRES_VIOLATION, ldv_destroy_msgsErr3REQUIRES_VIOLATION, ldv_destroy_msgsErr4REQUIRES_VIOLATION, ldv_destroy_msgsErr5REQUIRES_VIOLATION, ldv_destroy_msgsErr0REQUIRES_VIOLATION, ldv_msg_fillErr2REQUIRES_VIOLATION, ldv_msg_fillErr1REQUIRES_VIOLATION, ldv_msg_fillErr5REQUIRES_VIOLATION, ldv_msg_fillErr0REQUIRES_VIOLATION, ldv_msg_fillErr4REQUIRES_VIOLATION, ldv_msg_fillErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr3REQUIRES_VIOLATION, ldv_atomic_add_returnErr0REQUIRES_VIOLATION, ldv_atomic_add_returnErr1REQUIRES_VIOLATION, ldv_atomic_add_returnErr2REQUIRES_VIOLATION, __ldv_list_delErr1REQUIRES_VIOLATION, __ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_delErr3REQUIRES_VIOLATION, __ldv_list_delErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr0REQUIRES_VIOLATION, ldv_kobject_cleanupErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_kobject_cleanupErr1REQUIRES_VIOLATION, ldv_msg_freeErr0REQUIRES_VIOLATION, ldv_msg_freeErr5ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr4ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr2ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr3ASSERT_VIOLATIONMEMORY_FREE, ldv_msg_freeErr1REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, LDV_INIT_LIST_HEADErr3REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATION, LDV_INIT_LIST_HEADErr2REQUIRES_VIOLATION, ldv_list_delErr3REQUIRES_VIOLATION, ldv_list_delErr0REQUIRES_VIOLATION, ldv_list_delErr1REQUIRES_VIOLATION, ldv_list_delErr2REQUIRES_VIOLATION, __ldv_list_addErr1REQUIRES_VIOLATION, __ldv_list_addErr6REQUIRES_VIOLATION, __ldv_list_addErr7REQUIRES_VIOLATION, __ldv_list_addErr2REQUIRES_VIOLATION, __ldv_list_addErr4REQUIRES_VIOLATION, __ldv_list_addErr3REQUIRES_VIOLATION, __ldv_list_addErr5REQUIRES_VIOLATION, __ldv_list_addErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr0REQUIRES_VIOLATION, ldv_dev_set_drvdataErr1REQUIRES_VIOLATION, ldv_atomic_sub_returnErr3REQUIRES_VIOLATION, ldv_atomic_sub_returnErr0REQUIRES_VIOLATION, ldv_atomic_sub_returnErr1REQUIRES_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, entry_pointErr1REQUIRES_VIOLATION, entry_pointErr0REQUIRES_VIOLATION, ldv_msg_allocErr1REQUIRES_VIOLATION, ldv_msg_allocErr0REQUIRES_VIOLATION]=== [2018-12-02 15:43:47,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 15:43:47,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1358130649, now seen corresponding path program 3 times [2018-12-02 15:43:47,227 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-12-02 15:43:47,227 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_bd21bc85-3202-42a8-80bb-2e8cc326a9a5/bin-2019/uautomizer/cvc4 Starting monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2018-12-02 15:43:47,244 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 15:43:49,023 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-12-02 15:43:49,024 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-12-02 15:43:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 15:43:50,756 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 15:43:50,776 WARN L416 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-12-02 15:43:50,782 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 15:43:50,782 WARN L1298 BoogieBacktranslator]: Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# [2018-12-02 15:43:50,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 03:43:50 BoogieIcfgContainer [2018-12-02 15:43:50,802 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 15:43:50,802 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 15:43:50,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 15:43:50,802 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 15:43:50,803 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:40:37" (3/4) ... [2018-12-02 15:43:50,806 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-02 15:43:50,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 15:43:50,806 INFO L168 Benchmark]: Toolchain (without parser) took 194396.08 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 254.3 MB). Free memory was 938.0 MB in the beginning and 879.7 MB in the end (delta: 58.3 MB). Peak memory consumption was 312.5 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:50,806 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:50,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:50,807 INFO L168 Benchmark]: Boogie Preprocessor took 44.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:50,807 INFO L168 Benchmark]: RCFGBuilder took 782.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.3 MB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:50,807 INFO L168 Benchmark]: TraceAbstraction took 193219.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 996.3 MB in the beginning and 879.7 MB in the end (delta: 116.5 MB). Peak memory consumption was 223.0 MB. Max. memory is 11.5 GB. [2018-12-02 15:43:50,807 INFO L168 Benchmark]: Witness Printer took 3.66 ms. Allocated memory is still 1.3 GB. Free memory is still 879.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 15:43:50,808 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 343.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -176.9 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 782.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.3 MB in the end (delta: 118.6 MB). Peak memory consumption was 118.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 193219.82 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 106.4 MB). Free memory was 996.3 MB in the beginning and 879.7 MB in the end (delta: 116.5 MB). Peak memory consumption was 223.0 MB. Max. memory is 11.5 GB. * Witness Printer took 3.66 ms. Allocated memory is still 1.3 GB. Free memory is still 879.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: BitvecLiteral 0bv32 could not be translated for associated CType STRUCT~~ldv_list_head?next~*ldv_list_head?prev~*ldv_list_head# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1452]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1452. Possible FailurePath: [L1135] struct ldv_list_head ldv_global_msg_list = { &(ldv_global_msg_list), &(ldv_global_msg_list) }; VAL [\old(ldv_global_msg_list)=null, \old(ldv_global_msg_list)=null, ldv_global_msg_list={1129648599:0}] [L1453] CALL entry_point() VAL [ldv_global_msg_list={1129648599:0}] [L1439] int len = 10; VAL [ldv_global_msg_list={1129648599:0}, len=10] [L1440] CALL, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [\old(size)=40, ldv_global_msg_list={1129648599:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] return malloc(size); VAL [\old(size)=40, \result={-1666658772:0}, ldv_global_msg_list={1129648599:0}, malloc(size)={-1666658772:0}, size=40] [L1440] RET, EXPR ldv_malloc(sizeof(struct A18*)*len) VAL [ldv_global_msg_list={1129648599:0}, ldv_malloc(sizeof(struct A18*)*len)={-1666658772:0}, len=10] [L1440] struct A18 **array = (struct A18 **)ldv_malloc(sizeof(struct A18*)*len); [L1441] struct A18 *p; [L1442] int i=0; VAL [array={-1666658772:0}, i=0, ldv_global_msg_list={1129648599:0}, len=10] [L1443] COND FALSE !(!array) VAL [array={-1666658772:0}, i=0, ldv_global_msg_list={1129648599:0}, len=10] [L1444] COND TRUE i