./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:04:49,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:04:49,893 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:04:49,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:04:49,943 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:04:49,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:04:49,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:04:49,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:04:49,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:04:49,954 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:04:49,955 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:04:49,956 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:04:49,957 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:04:49,959 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:04:49,960 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:04:49,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:04:49,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:04:49,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:04:49,965 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:04:49,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:04:49,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:04:49,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:04:49,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:04:49,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:04:49,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:04:49,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:04:49,979 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:04:49,980 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:04:49,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:04:49,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:04:49,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:04:49,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:04:49,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:04:49,985 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:04:49,986 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:04:49,986 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:04:49,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:04:49,987 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:04:49,987 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:04:49,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:04:49,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:04:49,989 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-02-20 22:04:50,014 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:04:50,015 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:04:50,015 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:04:50,015 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:04:50,016 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:04:50,016 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:04:50,017 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:04:50,017 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:04:50,017 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:04:50,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:04:50,018 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 22:04:50,018 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:04:50,018 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:04:50,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:04:50,019 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:04:50,019 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:04:50,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:04:50,019 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:04:50,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:04:50,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:04:50,020 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:04:50,020 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:04:50,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:04:50,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:04:50,020 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:04:50,020 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 22:04:50,021 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 22:04:50,021 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:04:50,021 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:04:50,021 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:04:50,021 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c [2022-02-20 22:04:50,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:04:50,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:04:50,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:04:50,217 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:04:50,218 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:04:50,219 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-02-20 22:04:50,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a133506fd/51d0bb594294493baa0a58c238136e10/FLAG14e087549 [2022-02-20 22:04:50,688 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:04:50,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-02-20 22:04:50,706 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a133506fd/51d0bb594294493baa0a58c238136e10/FLAG14e087549 [2022-02-20 22:04:51,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a133506fd/51d0bb594294493baa0a58c238136e10 [2022-02-20 22:04:51,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:04:51,025 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:04:51,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:04:51,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:04:51,029 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:04:51,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@698f3856 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51, skipping insertion in model container [2022-02-20 22:04:51,031 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:04:51,070 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:04:51,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i[24075,24088] [2022-02-20 22:04:51,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:04:51,396 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 22:04:51,455 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i[24075,24088] [2022-02-20 22:04:51,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 22:04:51,540 INFO L208 MainTranslator]: Completed translation [2022-02-20 22:04:51,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51 WrapperNode [2022-02-20 22:04:51,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 22:04:51,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 22:04:51,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 22:04:51,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 22:04:51,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,574 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,614 INFO L137 Inliner]: procedures = 78, calls = 165, calls flagged for inlining = 30, calls inlined = 26, statements flattened = 507 [2022-02-20 22:04:51,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 22:04:51,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 22:04:51,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 22:04:51,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 22:04:51,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,639 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,681 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,705 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 22:04:51,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 22:04:51,706 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 22:04:51,706 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 22:04:51,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (1/1) ... [2022-02-20 22:04:51,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:04:51,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 22:04:51,744 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 22:04:51,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 22:04:51,776 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-02-20 22:04:51,777 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-02-20 22:04:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 22:04:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 22:04:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 22:04:51,777 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-02-20 22:04:51,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-02-20 22:04:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 22:04:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 22:04:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-02-20 22:04:51,778 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-02-20 22:04:51,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-02-20 22:04:51,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-02-20 22:04:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-02-20 22:04:51,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-02-20 22:04:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-02-20 22:04:51,779 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-02-20 22:04:51,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 22:04:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 22:04:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-02-20 22:04:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-02-20 22:04:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-02-20 22:04:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2022-02-20 22:04:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-02-20 22:04:51,780 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-02-20 22:04:51,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 22:04:51,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2022-02-20 22:04:51,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2022-02-20 22:04:51,781 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-02-20 22:04:51,781 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-02-20 22:04:51,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 22:04:51,781 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 22:04:51,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 22:04:51,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 22:04:51,782 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-02-20 22:04:51,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-02-20 22:04:51,782 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-02-20 22:04:51,782 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-02-20 22:04:51,782 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 22:04:51,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 22:04:51,783 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-02-20 22:04:51,783 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-02-20 22:04:51,977 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 22:04:51,978 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 22:04:52,075 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-02-20 22:04:52,404 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 22:04:52,413 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 22:04:52,413 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 22:04:52,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:04:52 BoogieIcfgContainer [2022-02-20 22:04:52,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 22:04:52,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 22:04:52,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 22:04:52,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 22:04:52,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 10:04:51" (1/3) ... [2022-02-20 22:04:52,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56424f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:04:52, skipping insertion in model container [2022-02-20 22:04:52,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:51" (2/3) ... [2022-02-20 22:04:52,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56424f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 10:04:52, skipping insertion in model container [2022-02-20 22:04:52,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 10:04:52" (3/3) ... [2022-02-20 22:04:52,425 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-02-20 22:04:52,429 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 22:04:52,429 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 22:04:52,458 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 22:04:52,462 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 22:04:52,463 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 22:04:52,478 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 139 states have internal predecessors, (172), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-02-20 22:04:52,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-02-20 22:04:52,485 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:04:52,486 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:04:52,486 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:04:52,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:04:52,490 INFO L85 PathProgramCache]: Analyzing trace with hash -630996910, now seen corresponding path program 1 times [2022-02-20 22:04:52,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:04:52,496 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674941246] [2022-02-20 22:04:52,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:04:52,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:04:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 22:04:52,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {217#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~1#1 := #t~nondet26#1;havoc #t~nondet26#1; {186#true} is VALID [2022-02-20 22:04:52,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {186#true} is VALID [2022-02-20 22:04:52,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {187#false} #395#return; {187#false} is VALID [2022-02-20 22:04:52,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-02-20 22:04:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {186#true} is VALID [2022-02-20 22:04:52,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {186#true} is VALID [2022-02-20 22:04:52,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {187#false} #397#return; {187#false} is VALID [2022-02-20 22:04:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 22:04:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:04:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {186#true} is VALID [2022-02-20 22:04:52,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186#true} {186#true} #445#return; {186#true} is VALID [2022-02-20 22:04:52,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,869 INFO L272 TraceCheckUtils]: 1: Hoare triple {186#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {186#true} is VALID [2022-02-20 22:04:52,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {186#true} is VALID [2022-02-20 22:04:52,869 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,869 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #445#return; {186#true} is VALID [2022-02-20 22:04:52,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,870 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {186#true} {187#false} #399#return; {187#false} is VALID [2022-02-20 22:04:52,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 22:04:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {186#true} is VALID [2022-02-20 22:04:52,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {186#true} is VALID [2022-02-20 22:04:52,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {186#true} {187#false} #403#return; {187#false} is VALID [2022-02-20 22:04:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-20 22:04:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:04:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:52,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {186#true} is VALID [2022-02-20 22:04:52,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {186#true} {186#true} #445#return; {186#true} is VALID [2022-02-20 22:04:52,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,912 INFO L272 TraceCheckUtils]: 1: Hoare triple {186#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {186#true} is VALID [2022-02-20 22:04:52,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {186#true} is VALID [2022-02-20 22:04:52,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,914 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {186#true} {186#true} #445#return; {186#true} is VALID [2022-02-20 22:04:52,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {186#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,915 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {186#true} {187#false} #405#return; {187#false} is VALID [2022-02-20 22:04:52,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {186#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(81, 2);call #Ultimate.allocInit(4, 3);call write~init~int(60, 3, 0, 1);call write~init~int(55, 3, 1, 1);call write~init~int(62, 3, 2, 1);call write~init~int(0, 3, 3, 1);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(4, 5);call write~init~int(37, 5, 0, 1);call write~init~int(100, 5, 1, 1);call write~init~int(10, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(37, 6, 0, 1);call write~init~int(115, 6, 1, 1);call write~init~int(10, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(11, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(11, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(27, 11);call #Ultimate.allocInit(11, 12);call #Ultimate.allocInit(13, 13);call #Ultimate.allocInit(21, 14);call #Ultimate.allocInit(30, 15);call #Ultimate.allocInit(33, 16);call #Ultimate.allocInit(25, 17);call #Ultimate.allocInit(27, 18);call #Ultimate.allocInit(10, 19);~ldv_state_variable_1~0 := 0;~s3c_hwmon_driver_group0~0.base, ~s3c_hwmon_driver_group0~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~#s3c_hwmon_driver~0.base, ~#s3c_hwmon_driver~0.offset := 20, 0;call #Ultimate.allocInit(153, 20);call write~init~$Pointer$(#funAddr~s3c_hwmon_probe.base, #funAddr~s3c_hwmon_probe.offset, ~#s3c_hwmon_driver~0.base, ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~s3c_hwmon_remove.base, #funAddr~s3c_hwmon_remove.offset, ~#s3c_hwmon_driver~0.base, 8 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 16 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 24 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 32 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(19, 0, ~#s3c_hwmon_driver~0.base, 40 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 48 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#s3c_hwmon_driver~0.base, 56 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 64 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~int(0, ~#s3c_hwmon_driver~0.base, 72 + ~#s3c_hwmon_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 73 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 81 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 89 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 97 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 105 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 113 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 121 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 129 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 137 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 145 + ~#s3c_hwmon_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_count_1~0 := 0;~ldv_count_2~0 := 0;~ldv_call_dev_attr_of_sensor_device_attribute~0 := 0; {186#true} is VALID [2022-02-20 22:04:52,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {186#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet100#1, main_#t~switch101#1, main_#t~nondet102#1, main_#t~switch103#1, main_#t~ret104#1, main_#t~ret105#1, main_#t~nondet106#1, main_#t~switch107#1, main_#t~ret108#1, main_~tmp~11#1, main_~tmp___0~4#1, main_~tmp___1~1#1;havoc main_~tmp~11#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~1#1;assume { :begin_inline_ldv_initialize } true; {186#true} is VALID [2022-02-20 22:04:52,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {188#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 22:04:52,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {188#(= ~ldv_state_variable_1~0 0)} assume -2147483648 <= main_#t~nondet100#1 && main_#t~nondet100#1 <= 2147483647;main_~tmp~11#1 := main_#t~nondet100#1;havoc main_#t~nondet100#1;main_#t~switch101#1 := 0 == main_~tmp~11#1; {188#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 22:04:52,920 INFO L290 TraceCheckUtils]: 4: Hoare triple {188#(= ~ldv_state_variable_1~0 0)} assume main_#t~switch101#1; {188#(= ~ldv_state_variable_1~0 0)} is VALID [2022-02-20 22:04:52,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {188#(= ~ldv_state_variable_1~0 0)} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_#t~switch103#1 := 0 == main_~tmp___0~4#1; {187#false} is VALID [2022-02-20 22:04:52,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {187#false} assume main_#t~switch103#1; {187#false} is VALID [2022-02-20 22:04:52,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {187#false} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_s3c_hwmon_probe } true;s3c_hwmon_probe_#in~dev#1.base, s3c_hwmon_probe_#in~dev#1.offset := ~s3c_hwmon_driver_group0~0.base, ~s3c_hwmon_driver_group0~0.offset;havoc s3c_hwmon_probe_#res#1;havoc s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset, s3c_hwmon_probe_#t~nondet69#1, s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset, s3c_hwmon_probe_#t~nondet71#1, s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset, s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset, s3c_hwmon_probe_#t~ret74#1, s3c_hwmon_probe_#t~nondet75#1, s3c_hwmon_probe_#t~mem76#1.base, s3c_hwmon_probe_#t~mem76#1.offset, s3c_hwmon_probe_#t~ret77#1, s3c_hwmon_probe_#t~ret78#1, s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset, s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset, s3c_hwmon_probe_#t~ret81#1, s3c_hwmon_probe_#t~nondet82#1, s3c_hwmon_probe_#t~mem83#1.base, s3c_hwmon_probe_#t~mem83#1.offset, s3c_hwmon_probe_#t~ret84#1, s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset, s3c_hwmon_probe_#t~mem86#1, s3c_hwmon_probe_#t~nondet87#1, s3c_hwmon_probe_#t~mem88#1, s3c_hwmon_probe_#t~nondet89#1, s3c_hwmon_probe_#t~mem90#1.base, s3c_hwmon_probe_#t~mem90#1.offset, s3c_hwmon_probe_#t~ret91#1, s3c_hwmon_probe_#t~nondet92#1, s3c_hwmon_probe_#t~mem93#1.base, s3c_hwmon_probe_#t~mem93#1.offset, s3c_hwmon_probe_#t~mem94#1.base, s3c_hwmon_probe_#t~mem94#1.offset, s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset, s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset, s3c_hwmon_probe_~ret~3#1, s3c_hwmon_probe_~i~0#1, s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset, s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset, s3c_hwmon_probe_~tmp___0~3#1, s3c_hwmon_probe_~tmp___1~0#1, s3c_hwmon_probe_~tmp___2~0#1, s3c_hwmon_probe_~tmp___3~0#1, s3c_hwmon_probe_~cfg~2#1.base, s3c_hwmon_probe_~cfg~2#1.offset;s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset := s3c_hwmon_probe_#in~dev#1.base, s3c_hwmon_probe_#in~dev#1.offset;havoc s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset;havoc s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset;havoc s3c_hwmon_probe_~ret~3#1;havoc s3c_hwmon_probe_~i~0#1;havoc s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset;call s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset := #Ultimate.allocOnStack(8);havoc s3c_hwmon_probe_~tmp___0~3#1;havoc s3c_hwmon_probe_~tmp___1~0#1;havoc s3c_hwmon_probe_~tmp___2~0#1;havoc s3c_hwmon_probe_~tmp___3~0#1;havoc s3c_hwmon_probe_~cfg~2#1.base, s3c_hwmon_probe_~cfg~2#1.offset;call s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset := read~$Pointer$(s3c_hwmon_probe_~dev#1.base, 277 + s3c_hwmon_probe_~dev#1.offset, 8);s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset := s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset;havoc s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset;s3c_hwmon_probe_~ret~3#1 := 0; {187#false} is VALID [2022-02-20 22:04:52,921 INFO L290 TraceCheckUtils]: 8: Hoare triple {187#false} assume !(0 == (s3c_hwmon_probe_~pdata~2#1.base + s3c_hwmon_probe_~pdata~2#1.offset) % 18446744073709551616);assume { :begin_inline_ldv_kzalloc_9 } true;ldv_kzalloc_9_#in~size#1, ldv_kzalloc_9_#in~flags#1 := 800, 208;havoc ldv_kzalloc_9_#res#1.base, ldv_kzalloc_9_#res#1.offset;havoc ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset, ldv_kzalloc_9_~size#1, ldv_kzalloc_9_~flags#1, ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset;ldv_kzalloc_9_~size#1 := ldv_kzalloc_9_#in~size#1;ldv_kzalloc_9_~flags#1 := ldv_kzalloc_9_#in~flags#1;havoc ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset; {187#false} is VALID [2022-02-20 22:04:52,922 INFO L272 TraceCheckUtils]: 9: Hoare triple {187#false} call ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset := ldv_zalloc(ldv_kzalloc_9_~size#1); {217#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:52,922 INFO L290 TraceCheckUtils]: 10: Hoare triple {217#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~1#1 := #t~nondet26#1;havoc #t~nondet26#1; {186#true} is VALID [2022-02-20 22:04:52,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {186#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {186#true} is VALID [2022-02-20 22:04:52,922 INFO L290 TraceCheckUtils]: 12: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,922 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {186#true} {187#false} #395#return; {187#false} is VALID [2022-02-20 22:04:52,922 INFO L290 TraceCheckUtils]: 14: Hoare triple {187#false} ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset := ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset;havoc ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset;ldv_kzalloc_9_#res#1.base, ldv_kzalloc_9_#res#1.offset := ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset; {187#false} is VALID [2022-02-20 22:04:52,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {187#false} s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset := ldv_kzalloc_9_#res#1.base, ldv_kzalloc_9_#res#1.offset;assume { :end_inline_ldv_kzalloc_9 } true;s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset := s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset;havoc s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset;s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset := s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset; {187#false} is VALID [2022-02-20 22:04:52,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {187#false} assume !(0 == (s3c_hwmon_probe_~hwmon~1#1.base + s3c_hwmon_probe_~hwmon~1#1.offset) % 18446744073709551616);assume { :begin_inline_platform_set_drvdata } true;platform_set_drvdata_#in~pdev#1.base, platform_set_drvdata_#in~pdev#1.offset, platform_set_drvdata_#in~data#1.base, platform_set_drvdata_#in~data#1.offset := s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset;havoc platform_set_drvdata_~pdev#1.base, platform_set_drvdata_~pdev#1.offset, platform_set_drvdata_~data#1.base, platform_set_drvdata_~data#1.offset;platform_set_drvdata_~pdev#1.base, platform_set_drvdata_~pdev#1.offset := platform_set_drvdata_#in~pdev#1.base, platform_set_drvdata_#in~pdev#1.offset;platform_set_drvdata_~data#1.base, platform_set_drvdata_~data#1.offset := platform_set_drvdata_#in~data#1.base, platform_set_drvdata_#in~data#1.offset;assume { :begin_inline_dev_set_drvdata } true;dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset, dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset := platform_set_drvdata_~pdev#1.base, 12 + platform_set_drvdata_~pdev#1.offset, platform_set_drvdata_~data#1.base, platform_set_drvdata_~data#1.offset;havoc dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset, dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset;dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset := dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset;dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset := dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset; {187#false} is VALID [2022-02-20 22:04:52,923 INFO L290 TraceCheckUtils]: 17: Hoare triple {187#false} assume { :end_inline_dev_set_drvdata } true; {187#false} is VALID [2022-02-20 22:04:52,923 INFO L290 TraceCheckUtils]: 18: Hoare triple {187#false} assume { :end_inline_platform_set_drvdata } true;assume { :begin_inline___mutex_init } true;__mutex_init_#in~arg0#1.base, __mutex_init_#in~arg0#1.offset, __mutex_init_#in~arg1#1.base, __mutex_init_#in~arg1#1.offset, __mutex_init_#in~arg2#1.base, __mutex_init_#in~arg2#1.offset := s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset, 13, 0, s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset;havoc __mutex_init_~arg0#1.base, __mutex_init_~arg0#1.offset, __mutex_init_~arg1#1.base, __mutex_init_~arg1#1.offset, __mutex_init_~arg2#1.base, __mutex_init_~arg2#1.offset;__mutex_init_~arg0#1.base, __mutex_init_~arg0#1.offset := __mutex_init_#in~arg0#1.base, __mutex_init_#in~arg0#1.offset;__mutex_init_~arg1#1.base, __mutex_init_~arg1#1.offset := __mutex_init_#in~arg1#1.base, __mutex_init_#in~arg1#1.offset;__mutex_init_~arg2#1.base, __mutex_init_~arg2#1.offset := __mutex_init_#in~arg2#1.base, __mutex_init_#in~arg2#1.offset; {187#false} is VALID [2022-02-20 22:04:52,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {187#false} assume { :end_inline___mutex_init } true;assume { :begin_inline_s3c_adc_register } true;s3c_adc_register_#in~arg0#1.base, s3c_adc_register_#in~arg0#1.offset, s3c_adc_register_#in~arg1#1.base, s3c_adc_register_#in~arg1#1.offset, s3c_adc_register_#in~arg2#1.base, s3c_adc_register_#in~arg2#1.offset, s3c_adc_register_#in~arg3#1 := s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset, 0, 0, 0, 0, 0;havoc s3c_adc_register_#res#1.base, s3c_adc_register_#res#1.offset;havoc s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset, s3c_adc_register_~arg0#1.base, s3c_adc_register_~arg0#1.offset, s3c_adc_register_~arg1#1.base, s3c_adc_register_~arg1#1.offset, s3c_adc_register_~arg2#1.base, s3c_adc_register_~arg2#1.offset, s3c_adc_register_~arg3#1;s3c_adc_register_~arg0#1.base, s3c_adc_register_~arg0#1.offset := s3c_adc_register_#in~arg0#1.base, s3c_adc_register_#in~arg0#1.offset;s3c_adc_register_~arg1#1.base, s3c_adc_register_~arg1#1.offset := s3c_adc_register_#in~arg1#1.base, s3c_adc_register_#in~arg1#1.offset;s3c_adc_register_~arg2#1.base, s3c_adc_register_~arg2#1.offset := s3c_adc_register_#in~arg2#1.base, s3c_adc_register_#in~arg2#1.offset;s3c_adc_register_~arg3#1 := s3c_adc_register_#in~arg3#1; {187#false} is VALID [2022-02-20 22:04:52,923 INFO L272 TraceCheckUtils]: 20: Hoare triple {187#false} call s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset := ldv_malloc(0); {218#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:52,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {218#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {186#true} is VALID [2022-02-20 22:04:52,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {186#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {186#true} is VALID [2022-02-20 22:04:52,924 INFO L290 TraceCheckUtils]: 23: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,924 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {186#true} {187#false} #397#return; {187#false} is VALID [2022-02-20 22:04:52,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {187#false} s3c_adc_register_#res#1.base, s3c_adc_register_#res#1.offset := s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset;havoc s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset; {187#false} is VALID [2022-02-20 22:04:52,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {187#false} s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset := s3c_adc_register_#res#1.base, s3c_adc_register_#res#1.offset;assume { :end_inline_s3c_adc_register } true;call write~$Pointer$(s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, 152 + s3c_hwmon_probe_~hwmon~1#1.offset, 8);havoc s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset;call s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset := read~$Pointer$(s3c_hwmon_probe_~hwmon~1#1.base, 152 + s3c_hwmon_probe_~hwmon~1#1.offset, 8); {187#false} is VALID [2022-02-20 22:04:52,924 INFO L272 TraceCheckUtils]: 27: Hoare triple {187#false} call s3c_hwmon_probe_#t~ret74#1 := IS_ERR(s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset); {186#true} is VALID [2022-02-20 22:04:52,924 INFO L290 TraceCheckUtils]: 28: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,924 INFO L272 TraceCheckUtils]: 29: Hoare triple {186#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {186#true} is VALID [2022-02-20 22:04:52,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {186#true} is VALID [2022-02-20 22:04:52,925 INFO L290 TraceCheckUtils]: 31: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,925 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {186#true} {186#true} #445#return; {186#true} is VALID [2022-02-20 22:04:52,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {186#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,925 INFO L290 TraceCheckUtils]: 34: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,925 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {186#true} {187#false} #399#return; {187#false} is VALID [2022-02-20 22:04:52,925 INFO L290 TraceCheckUtils]: 36: Hoare triple {187#false} assume -9223372036854775808 <= s3c_hwmon_probe_#t~ret74#1 && s3c_hwmon_probe_#t~ret74#1 <= 9223372036854775807;s3c_hwmon_probe_~tmp___1~0#1 := s3c_hwmon_probe_#t~ret74#1;havoc s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset;havoc s3c_hwmon_probe_#t~ret74#1; {187#false} is VALID [2022-02-20 22:04:52,925 INFO L290 TraceCheckUtils]: 37: Hoare triple {187#false} assume !(0 != s3c_hwmon_probe_~tmp___1~0#1);assume { :begin_inline_s3c_hwmon_add_raw } true;s3c_hwmon_add_raw_#in~dev#1.base, s3c_hwmon_add_raw_#in~dev#1.offset := s3c_hwmon_probe_~dev#1.base, 12 + s3c_hwmon_probe_~dev#1.offset;havoc s3c_hwmon_add_raw_#res#1;havoc s3c_hwmon_add_raw_~dev#1.base, s3c_hwmon_add_raw_~dev#1.offset;s3c_hwmon_add_raw_~dev#1.base, s3c_hwmon_add_raw_~dev#1.offset := s3c_hwmon_add_raw_#in~dev#1.base, s3c_hwmon_add_raw_#in~dev#1.offset;s3c_hwmon_add_raw_#res#1 := 0; {187#false} is VALID [2022-02-20 22:04:52,926 INFO L290 TraceCheckUtils]: 38: Hoare triple {187#false} s3c_hwmon_probe_#t~ret78#1 := s3c_hwmon_add_raw_#res#1;assume { :end_inline_s3c_hwmon_add_raw } true;assume -2147483648 <= s3c_hwmon_probe_#t~ret78#1 && s3c_hwmon_probe_#t~ret78#1 <= 2147483647;s3c_hwmon_probe_~ret~3#1 := s3c_hwmon_probe_#t~ret78#1;havoc s3c_hwmon_probe_#t~ret78#1; {187#false} is VALID [2022-02-20 22:04:52,926 INFO L290 TraceCheckUtils]: 39: Hoare triple {187#false} assume !(0 != s3c_hwmon_probe_~ret~3#1);assume { :begin_inline_hwmon_device_register } true;hwmon_device_register_#in~arg0#1.base, hwmon_device_register_#in~arg0#1.offset := s3c_hwmon_probe_~dev#1.base, 12 + s3c_hwmon_probe_~dev#1.offset;havoc hwmon_device_register_#res#1.base, hwmon_device_register_#res#1.offset;havoc hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset, hwmon_device_register_~arg0#1.base, hwmon_device_register_~arg0#1.offset;hwmon_device_register_~arg0#1.base, hwmon_device_register_~arg0#1.offset := hwmon_device_register_#in~arg0#1.base, hwmon_device_register_#in~arg0#1.offset; {187#false} is VALID [2022-02-20 22:04:52,926 INFO L272 TraceCheckUtils]: 40: Hoare triple {187#false} call hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset := ldv_malloc(1003); {218#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:52,926 INFO L290 TraceCheckUtils]: 41: Hoare triple {218#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {186#true} is VALID [2022-02-20 22:04:52,926 INFO L290 TraceCheckUtils]: 42: Hoare triple {186#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {186#true} is VALID [2022-02-20 22:04:52,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,926 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {186#true} {187#false} #403#return; {187#false} is VALID [2022-02-20 22:04:52,926 INFO L290 TraceCheckUtils]: 45: Hoare triple {187#false} hwmon_device_register_#res#1.base, hwmon_device_register_#res#1.offset := hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset;havoc hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset; {187#false} is VALID [2022-02-20 22:04:52,927 INFO L290 TraceCheckUtils]: 46: Hoare triple {187#false} s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset := hwmon_device_register_#res#1.base, hwmon_device_register_#res#1.offset;assume { :end_inline_hwmon_device_register } true;call write~$Pointer$(s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, 160 + s3c_hwmon_probe_~hwmon~1#1.offset, 8);havoc s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset;call s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset := read~$Pointer$(s3c_hwmon_probe_~hwmon~1#1.base, 160 + s3c_hwmon_probe_~hwmon~1#1.offset, 8); {187#false} is VALID [2022-02-20 22:04:52,927 INFO L272 TraceCheckUtils]: 47: Hoare triple {187#false} call s3c_hwmon_probe_#t~ret81#1 := IS_ERR(s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset); {186#true} is VALID [2022-02-20 22:04:52,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,927 INFO L272 TraceCheckUtils]: 49: Hoare triple {186#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {186#true} is VALID [2022-02-20 22:04:52,927 INFO L290 TraceCheckUtils]: 50: Hoare triple {186#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {186#true} is VALID [2022-02-20 22:04:52,927 INFO L290 TraceCheckUtils]: 51: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,927 INFO L284 TraceCheckUtils]: 52: Hoare quadruple {186#true} {186#true} #445#return; {186#true} is VALID [2022-02-20 22:04:52,927 INFO L290 TraceCheckUtils]: 53: Hoare triple {186#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {186#true} is VALID [2022-02-20 22:04:52,928 INFO L290 TraceCheckUtils]: 54: Hoare triple {186#true} assume true; {186#true} is VALID [2022-02-20 22:04:52,928 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {186#true} {187#false} #405#return; {187#false} is VALID [2022-02-20 22:04:52,928 INFO L290 TraceCheckUtils]: 56: Hoare triple {187#false} assume -9223372036854775808 <= s3c_hwmon_probe_#t~ret81#1 && s3c_hwmon_probe_#t~ret81#1 <= 9223372036854775807;s3c_hwmon_probe_~tmp___3~0#1 := s3c_hwmon_probe_#t~ret81#1;havoc s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset;havoc s3c_hwmon_probe_#t~ret81#1; {187#false} is VALID [2022-02-20 22:04:52,928 INFO L290 TraceCheckUtils]: 57: Hoare triple {187#false} assume !(0 != s3c_hwmon_probe_~tmp___3~0#1);s3c_hwmon_probe_~i~0#1 := 0; {187#false} is VALID [2022-02-20 22:04:52,928 INFO L290 TraceCheckUtils]: 58: Hoare triple {187#false} assume s3c_hwmon_probe_~i~0#1 % 4294967296 <= 7; {187#false} is VALID [2022-02-20 22:04:52,928 INFO L290 TraceCheckUtils]: 59: Hoare triple {187#false} call s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset := read~$Pointer$(s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset + 8 * s3c_hwmon_probe_~i~0#1, 8);s3c_hwmon_probe_~cfg~2#1.base, s3c_hwmon_probe_~cfg~2#1.offset := s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset;havoc s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset; {187#false} is VALID [2022-02-20 22:04:52,928 INFO L290 TraceCheckUtils]: 60: Hoare triple {187#false} assume !(0 == (s3c_hwmon_probe_~cfg~2#1.base + s3c_hwmon_probe_~cfg~2#1.offset) % 18446744073709551616);call s3c_hwmon_probe_#t~mem86#1 := read~int(s3c_hwmon_probe_~cfg~2#1.base, 8 + s3c_hwmon_probe_~cfg~2#1.offset, 4); {187#false} is VALID [2022-02-20 22:04:52,929 INFO L290 TraceCheckUtils]: 61: Hoare triple {187#false} assume s3c_hwmon_probe_#t~mem86#1 % 4294967296 > 65535;havoc s3c_hwmon_probe_#t~mem86#1;havoc s3c_hwmon_probe_#t~nondet87#1; {187#false} is VALID [2022-02-20 22:04:52,929 INFO L290 TraceCheckUtils]: 62: Hoare triple {187#false} call s3c_hwmon_probe_#t~mem88#1 := read~int(s3c_hwmon_probe_~cfg~2#1.base, 12 + s3c_hwmon_probe_~cfg~2#1.offset, 4); {187#false} is VALID [2022-02-20 22:04:52,929 INFO L290 TraceCheckUtils]: 63: Hoare triple {187#false} assume !(0 == s3c_hwmon_probe_#t~mem88#1 % 4294967296);havoc s3c_hwmon_probe_#t~mem88#1;call s3c_hwmon_probe_#t~mem90#1.base, s3c_hwmon_probe_#t~mem90#1.offset := read~$Pointer$(s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset + 8 * s3c_hwmon_probe_~i~0#1, 8);assume { :begin_inline_s3c_hwmon_create_attr } true;s3c_hwmon_create_attr_#in~dev#1.base, s3c_hwmon_create_attr_#in~dev#1.offset, s3c_hwmon_create_attr_#in~cfg#1.base, s3c_hwmon_create_attr_#in~cfg#1.offset, s3c_hwmon_create_attr_#in~attrs#1.base, s3c_hwmon_create_attr_#in~attrs#1.offset, s3c_hwmon_create_attr_#in~channel#1 := s3c_hwmon_probe_~dev#1.base, 12 + s3c_hwmon_probe_~dev#1.offset, s3c_hwmon_probe_#t~mem90#1.base, s3c_hwmon_probe_#t~mem90#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, 168 + s3c_hwmon_probe_~hwmon~1#1.offset + 120 * (s3c_hwmon_probe_~i~0#1 % 4294967296), s3c_hwmon_probe_~i~0#1;havoc s3c_hwmon_create_attr_#res#1;havoc s3c_hwmon_create_attr_#t~nondet61#1, s3c_hwmon_create_attr_#t~ret62#1, s3c_hwmon_create_attr_#t~nondet63#1, s3c_hwmon_create_attr_#t~mem64#1.base, s3c_hwmon_create_attr_#t~mem64#1.offset, s3c_hwmon_create_attr_#t~nondet65#1, s3c_hwmon_create_attr_#t~ret66#1, s3c_hwmon_create_attr_#t~nondet67#1, s3c_hwmon_create_attr_~dev#1.base, s3c_hwmon_create_attr_~dev#1.offset, s3c_hwmon_create_attr_~cfg#1.base, s3c_hwmon_create_attr_~cfg#1.offset, s3c_hwmon_create_attr_~attrs#1.base, s3c_hwmon_create_attr_~attrs#1.offset, s3c_hwmon_create_attr_~channel#1, s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset, s3c_hwmon_create_attr_~ret~2#1;s3c_hwmon_create_attr_~dev#1.base, s3c_hwmon_create_attr_~dev#1.offset := s3c_hwmon_create_attr_#in~dev#1.base, s3c_hwmon_create_attr_#in~dev#1.offset;s3c_hwmon_create_attr_~cfg#1.base, s3c_hwmon_create_attr_~cfg#1.offset := s3c_hwmon_create_attr_#in~cfg#1.base, s3c_hwmon_create_attr_#in~cfg#1.offset;s3c_hwmon_create_attr_~attrs#1.base, s3c_hwmon_create_attr_~attrs#1.offset := s3c_hwmon_create_attr_#in~attrs#1.base, s3c_hwmon_create_attr_#in~attrs#1.offset;s3c_hwmon_create_attr_~channel#1 := s3c_hwmon_create_attr_#in~channel#1;havoc s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset;havoc s3c_hwmon_create_attr_~ret~2#1;havoc s3c_hwmon_create_attr_#t~nondet61#1;s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset := s3c_hwmon_create_attr_~attrs#1.base, s3c_hwmon_create_attr_~attrs#1.offset;call write~int(s3c_hwmon_create_attr_~channel#1, s3c_hwmon_create_attr_~attr~0#1.base, 44 + s3c_hwmon_create_attr_~attr~0#1.offset, 4);call write~$Pointer$(s3c_hwmon_create_attr_~attrs#1.base, 96 + s3c_hwmon_create_attr_~attrs#1.offset, s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset, 8);call write~int(292, s3c_hwmon_create_attr_~attr~0#1.base, 8 + s3c_hwmon_create_attr_~attr~0#1.offset, 4);call write~$Pointer$(#funAddr~s3c_hwmon_ch_show.base, #funAddr~s3c_hwmon_ch_show.offset, s3c_hwmon_create_attr_~attr~0#1.base, 28 + s3c_hwmon_create_attr_~attr~0#1.offset, 8);assume { :begin_inline_ldv_device_create_file_7 } true;ldv_device_create_file_7_#in~ldv_func_arg1#1.base, ldv_device_create_file_7_#in~ldv_func_arg1#1.offset, ldv_device_create_file_7_#in~ldv_func_arg2#1.base, ldv_device_create_file_7_#in~ldv_func_arg2#1.offset := s3c_hwmon_create_attr_~dev#1.base, s3c_hwmon_create_attr_~dev#1.offset, s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset;havoc ldv_device_create_file_7_#res#1;havoc ldv_device_create_file_7_#t~ret111#1, ldv_device_create_file_7_~ldv_func_arg1#1.base, ldv_device_create_file_7_~ldv_func_arg1#1.offset, ldv_device_create_file_7_~ldv_func_arg2#1.base, ldv_device_create_file_7_~ldv_func_arg2#1.offset, ldv_device_create_file_7_~tmp~14#1;ldv_device_create_file_7_~ldv_func_arg1#1.base, ldv_device_create_file_7_~ldv_func_arg1#1.offset := ldv_device_create_file_7_#in~ldv_func_arg1#1.base, ldv_device_create_file_7_#in~ldv_func_arg1#1.offset;ldv_device_create_file_7_~ldv_func_arg2#1.base, ldv_device_create_file_7_~ldv_func_arg2#1.offset := ldv_device_create_file_7_#in~ldv_func_arg2#1.base, ldv_device_create_file_7_#in~ldv_func_arg2#1.offset;havoc ldv_device_create_file_7_~tmp~14#1; {187#false} is VALID [2022-02-20 22:04:52,930 INFO L272 TraceCheckUtils]: 64: Hoare triple {187#false} call ldv_device_create_file_7_#t~ret111#1 := ldv_device_create_file_dev_attr_of_sensor_device_attribute(); {187#false} is VALID [2022-02-20 22:04:52,930 INFO L290 TraceCheckUtils]: 65: Hoare triple {187#false} havoc ~tmp~18#1; {187#false} is VALID [2022-02-20 22:04:52,930 INFO L290 TraceCheckUtils]: 66: Hoare triple {187#false} assume 0 == ~ldv_call_dev_attr_of_sensor_device_attribute~0;~ldv_count_2~0 := 1 + ~ldv_count_2~0;~ldv_call_dev_attr_of_sensor_device_attribute~0 := 1; {187#false} is VALID [2022-02-20 22:04:52,932 INFO L290 TraceCheckUtils]: 67: Hoare triple {187#false} assume !(~ldv_count_1~0 >= ~ldv_count_2~0); {187#false} is VALID [2022-02-20 22:04:52,933 INFO L272 TraceCheckUtils]: 68: Hoare triple {187#false} call ldv_error(); {187#false} is VALID [2022-02-20 22:04:52,933 INFO L290 TraceCheckUtils]: 69: Hoare triple {187#false} assume !false; {187#false} is VALID [2022-02-20 22:04:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-02-20 22:04:52,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:04:52,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674941246] [2022-02-20 22:04:52,935 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674941246] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:04:52,935 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:04:52,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 22:04:52,936 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492583776] [2022-02-20 22:04:52,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:04:52,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-02-20 22:04:52,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:04:52,946 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:04:53,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:53,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 22:04:53,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:04:53,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 22:04:53,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 22:04:53,026 INFO L87 Difference]: Start difference. First operand has 183 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 139 states have internal predecessors, (172), 34 states have call successors, (34), 15 states have call predecessors, (34), 14 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:04:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:53,807 INFO L93 Difference]: Finished difference Result 396 states and 531 transitions. [2022-02-20 22:04:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 22:04:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 70 [2022-02-20 22:04:53,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:04:53,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:04:53,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2022-02-20 22:04:53,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:04:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 531 transitions. [2022-02-20 22:04:53,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 531 transitions. [2022-02-20 22:04:54,202 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 531 edges. 531 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:54,213 INFO L225 Difference]: With dead ends: 396 [2022-02-20 22:04:54,214 INFO L226 Difference]: Without dead ends: 195 [2022-02-20 22:04:54,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 22:04:54,219 INFO L933 BasicCegarLoop]: 226 mSDtfsCounter, 119 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 22:04:54,220 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 497 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 22:04:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-02-20 22:04:54,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 187. [2022-02-20 22:04:54,250 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:04:54,251 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 187 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 143 states have internal predecessors, (181), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 22:04:54,252 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 187 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 143 states have internal predecessors, (181), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 22:04:54,253 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 187 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 143 states have internal predecessors, (181), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 22:04:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:54,269 INFO L93 Difference]: Finished difference Result 195 states and 253 transitions. [2022-02-20 22:04:54,269 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2022-02-20 22:04:54,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:54,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:54,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 143 states have internal predecessors, (181), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 195 states. [2022-02-20 22:04:54,278 INFO L87 Difference]: Start difference. First operand has 187 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 143 states have internal predecessors, (181), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 195 states. [2022-02-20 22:04:54,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:54,288 INFO L93 Difference]: Finished difference Result 195 states and 253 transitions. [2022-02-20 22:04:54,288 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 253 transitions. [2022-02-20 22:04:54,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:54,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:54,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:04:54,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:04:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.2746478873239437) internal successors, (181), 143 states have internal predecessors, (181), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-02-20 22:04:54,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 242 transitions. [2022-02-20 22:04:54,301 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 242 transitions. Word has length 70 [2022-02-20 22:04:54,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:04:54,302 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 242 transitions. [2022-02-20 22:04:54,303 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 22:04:54,303 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 242 transitions. [2022-02-20 22:04:54,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-02-20 22:04:54,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:04:54,306 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:04:54,310 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 22:04:54,311 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:04:54,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:04:54,311 INFO L85 PathProgramCache]: Analyzing trace with hash -733290133, now seen corresponding path program 1 times [2022-02-20 22:04:54,311 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:04:54,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473672319] [2022-02-20 22:04:54,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:04:54,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:04:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-02-20 22:04:54,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~1#1 := #t~nondet26#1;havoc #t~nondet26#1; {1453#true} is VALID [2022-02-20 22:04:54,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1453#true} is VALID [2022-02-20 22:04:54,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,606 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1453#true} {1453#true} #435#return; {1453#true} is VALID [2022-02-20 22:04:54,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-02-20 22:04:54,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {1490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~1#1 := #t~nondet26#1;havoc #t~nondet26#1; {1453#true} is VALID [2022-02-20 22:04:54,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 22:04:54,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 22:04:54,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {1453#true} #395#return; {1463#(and (= |ULTIMATE.start_ldv_kzalloc_9_#t~ret113#1.base| 0) (= |ULTIMATE.start_ldv_kzalloc_9_#t~ret113#1.offset| 0))} is VALID [2022-02-20 22:04:54,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-02-20 22:04:54,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {1492#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {1453#true} is VALID [2022-02-20 22:04:54,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {1453#true} is VALID [2022-02-20 22:04:54,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1453#true} {1454#false} #397#return; {1454#false} is VALID [2022-02-20 22:04:54,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-02-20 22:04:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:04:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,663 INFO L290 TraceCheckUtils]: 0: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {1453#true} is VALID [2022-02-20 22:04:54,663 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,663 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1453#true} {1453#true} #445#return; {1453#true} is VALID [2022-02-20 22:04:54,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,664 INFO L272 TraceCheckUtils]: 1: Hoare triple {1453#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {1453#true} is VALID [2022-02-20 22:04:54,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {1453#true} is VALID [2022-02-20 22:04:54,664 INFO L290 TraceCheckUtils]: 3: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,664 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1453#true} {1453#true} #445#return; {1453#true} is VALID [2022-02-20 22:04:54,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {1453#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,665 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1453#true} {1454#false} #399#return; {1454#false} is VALID [2022-02-20 22:04:54,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-02-20 22:04:54,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {1492#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {1453#true} is VALID [2022-02-20 22:04:54,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {1453#true} is VALID [2022-02-20 22:04:54,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1453#true} {1454#false} #403#return; {1454#false} is VALID [2022-02-20 22:04:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-02-20 22:04:54,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-02-20 22:04:54,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 22:04:54,682 INFO L290 TraceCheckUtils]: 0: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {1453#true} is VALID [2022-02-20 22:04:54,682 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,683 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1453#true} {1453#true} #445#return; {1453#true} is VALID [2022-02-20 22:04:54,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,683 INFO L272 TraceCheckUtils]: 1: Hoare triple {1453#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {1453#true} is VALID [2022-02-20 22:04:54,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {1453#true} is VALID [2022-02-20 22:04:54,683 INFO L290 TraceCheckUtils]: 3: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,684 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1453#true} {1453#true} #445#return; {1453#true} is VALID [2022-02-20 22:04:54,684 INFO L290 TraceCheckUtils]: 5: Hoare triple {1453#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,684 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {1453#true} {1454#false} #405#return; {1454#false} is VALID [2022-02-20 22:04:54,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {1453#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(81, 2);call #Ultimate.allocInit(4, 3);call write~init~int(60, 3, 0, 1);call write~init~int(55, 3, 1, 1);call write~init~int(62, 3, 2, 1);call write~init~int(0, 3, 3, 1);call #Ultimate.allocInit(20, 4);call #Ultimate.allocInit(4, 5);call write~init~int(37, 5, 0, 1);call write~init~int(100, 5, 1, 1);call write~init~int(10, 5, 2, 1);call write~init~int(0, 5, 3, 1);call #Ultimate.allocInit(4, 6);call write~init~int(37, 6, 0, 1);call write~init~int(115, 6, 1, 1);call write~init~int(10, 6, 2, 1);call write~init~int(0, 6, 3, 1);call #Ultimate.allocInit(11, 7);call #Ultimate.allocInit(34, 8);call #Ultimate.allocInit(11, 9);call #Ultimate.allocInit(34, 10);call #Ultimate.allocInit(27, 11);call #Ultimate.allocInit(11, 12);call #Ultimate.allocInit(13, 13);call #Ultimate.allocInit(21, 14);call #Ultimate.allocInit(30, 15);call #Ultimate.allocInit(33, 16);call #Ultimate.allocInit(25, 17);call #Ultimate.allocInit(27, 18);call #Ultimate.allocInit(10, 19);~ldv_state_variable_1~0 := 0;~s3c_hwmon_driver_group0~0.base, ~s3c_hwmon_driver_group0~0.offset := 0, 0;~LDV_IN_INTERRUPT~0 := 1;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 0;~#s3c_hwmon_driver~0.base, ~#s3c_hwmon_driver~0.offset := 20, 0;call #Ultimate.allocInit(153, 20);call write~init~$Pointer$(#funAddr~s3c_hwmon_probe.base, #funAddr~s3c_hwmon_probe.offset, ~#s3c_hwmon_driver~0.base, ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(#funAddr~s3c_hwmon_remove.base, #funAddr~s3c_hwmon_remove.offset, ~#s3c_hwmon_driver~0.base, 8 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 16 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 24 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 32 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(19, 0, ~#s3c_hwmon_driver~0.base, 40 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 48 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(~#__this_module~0.base, ~#__this_module~0.offset, ~#s3c_hwmon_driver~0.base, 56 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 64 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~int(0, ~#s3c_hwmon_driver~0.base, 72 + ~#s3c_hwmon_driver~0.offset, 1);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 73 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 81 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 89 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 97 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 105 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 113 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 121 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 129 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 137 + ~#s3c_hwmon_driver~0.offset, 8);call write~init~$Pointer$(0, 0, ~#s3c_hwmon_driver~0.base, 145 + ~#s3c_hwmon_driver~0.offset, 8);~ldv_retval_0~0 := 0;~ldv_retval_1~0 := 0;~ldv_count_1~0 := 0;~ldv_count_2~0 := 0;~ldv_call_dev_attr_of_sensor_device_attribute~0 := 0; {1453#true} is VALID [2022-02-20 22:04:54,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {1453#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet100#1, main_#t~switch101#1, main_#t~nondet102#1, main_#t~switch103#1, main_#t~ret104#1, main_#t~ret105#1, main_#t~nondet106#1, main_#t~switch107#1, main_#t~ret108#1, main_~tmp~11#1, main_~tmp___0~4#1, main_~tmp___1~1#1;havoc main_~tmp~11#1;havoc main_~tmp___0~4#1;havoc main_~tmp___1~1#1;assume { :begin_inline_ldv_initialize } true; {1453#true} is VALID [2022-02-20 22:04:54,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {1453#true} assume { :end_inline_ldv_initialize } true;~ldv_state_variable_1~0 := 0;~ref_cnt~0 := 0;~ldv_state_variable_0~0 := 1; {1453#true} is VALID [2022-02-20 22:04:54,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {1453#true} assume -2147483648 <= main_#t~nondet100#1 && main_#t~nondet100#1 <= 2147483647;main_~tmp~11#1 := main_#t~nondet100#1;havoc main_#t~nondet100#1;main_#t~switch101#1 := 0 == main_~tmp~11#1; {1453#true} is VALID [2022-02-20 22:04:54,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {1453#true} assume !main_#t~switch101#1;main_#t~switch101#1 := main_#t~switch101#1 || 1 == main_~tmp~11#1; {1453#true} is VALID [2022-02-20 22:04:54,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {1453#true} assume main_#t~switch101#1; {1453#true} is VALID [2022-02-20 22:04:54,685 INFO L290 TraceCheckUtils]: 6: Hoare triple {1453#true} assume 0 != ~ldv_state_variable_0~0;assume -2147483648 <= main_#t~nondet106#1 && main_#t~nondet106#1 <= 2147483647;main_~tmp___1~1#1 := main_#t~nondet106#1;havoc main_#t~nondet106#1;main_#t~switch107#1 := 0 == main_~tmp___1~1#1; {1453#true} is VALID [2022-02-20 22:04:54,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {1453#true} assume !main_#t~switch107#1;main_#t~switch107#1 := main_#t~switch107#1 || 1 == main_~tmp___1~1#1; {1453#true} is VALID [2022-02-20 22:04:54,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {1453#true} assume main_#t~switch107#1; {1453#true} is VALID [2022-02-20 22:04:54,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {1453#true} assume 1 == ~ldv_state_variable_0~0;assume { :begin_inline_s3c_hwmon_init } true;havoc s3c_hwmon_init_#res#1;havoc s3c_hwmon_init_#t~ret98#1, s3c_hwmon_init_~tmp~9#1;havoc s3c_hwmon_init_~tmp~9#1;assume { :begin_inline_platform_driver_register } true;platform_driver_register_#in~arg0#1.base, platform_driver_register_#in~arg0#1.offset := ~#s3c_hwmon_driver~0.base, ~#s3c_hwmon_driver~0.offset;havoc platform_driver_register_#res#1;havoc platform_driver_register_#t~nondet122#1, platform_driver_register_~arg0#1.base, platform_driver_register_~arg0#1.offset;platform_driver_register_~arg0#1.base, platform_driver_register_~arg0#1.offset := platform_driver_register_#in~arg0#1.base, platform_driver_register_#in~arg0#1.offset;assume -2147483648 <= platform_driver_register_#t~nondet122#1 && platform_driver_register_#t~nondet122#1 <= 2147483647;platform_driver_register_#res#1 := platform_driver_register_#t~nondet122#1;havoc platform_driver_register_#t~nondet122#1; {1453#true} is VALID [2022-02-20 22:04:54,686 INFO L290 TraceCheckUtils]: 10: Hoare triple {1453#true} s3c_hwmon_init_#t~ret98#1 := platform_driver_register_#res#1;assume { :end_inline_platform_driver_register } true;assume -2147483648 <= s3c_hwmon_init_#t~ret98#1 && s3c_hwmon_init_#t~ret98#1 <= 2147483647;s3c_hwmon_init_~tmp~9#1 := s3c_hwmon_init_#t~ret98#1;havoc s3c_hwmon_init_#t~ret98#1;s3c_hwmon_init_#res#1 := s3c_hwmon_init_~tmp~9#1; {1453#true} is VALID [2022-02-20 22:04:54,686 INFO L290 TraceCheckUtils]: 11: Hoare triple {1453#true} main_#t~ret108#1 := s3c_hwmon_init_#res#1;assume { :end_inline_s3c_hwmon_init } true;assume -2147483648 <= main_#t~ret108#1 && main_#t~ret108#1 <= 2147483647;~ldv_retval_1~0 := main_#t~ret108#1;havoc main_#t~ret108#1; {1453#true} is VALID [2022-02-20 22:04:54,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {1453#true} assume 0 == ~ldv_retval_1~0;~ldv_state_variable_0~0 := 3;~ldv_state_variable_1~0 := 1;assume { :begin_inline_ldv_initialize_platform_driver_1 } true;havoc ldv_initialize_platform_driver_1_#t~ret99#1.base, ldv_initialize_platform_driver_1_#t~ret99#1.offset, ldv_initialize_platform_driver_1_~tmp~10#1.base, ldv_initialize_platform_driver_1_~tmp~10#1.offset;havoc ldv_initialize_platform_driver_1_~tmp~10#1.base, ldv_initialize_platform_driver_1_~tmp~10#1.offset; {1453#true} is VALID [2022-02-20 22:04:54,687 INFO L272 TraceCheckUtils]: 13: Hoare triple {1453#true} call ldv_initialize_platform_driver_1_#t~ret99#1.base, ldv_initialize_platform_driver_1_#t~ret99#1.offset := ldv_zalloc(624); {1490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:54,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {1490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~1#1 := #t~nondet26#1;havoc #t~nondet26#1; {1453#true} is VALID [2022-02-20 22:04:54,687 INFO L290 TraceCheckUtils]: 15: Hoare triple {1453#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1453#true} is VALID [2022-02-20 22:04:54,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,688 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1453#true} {1453#true} #435#return; {1453#true} is VALID [2022-02-20 22:04:54,688 INFO L290 TraceCheckUtils]: 18: Hoare triple {1453#true} ldv_initialize_platform_driver_1_~tmp~10#1.base, ldv_initialize_platform_driver_1_~tmp~10#1.offset := ldv_initialize_platform_driver_1_#t~ret99#1.base, ldv_initialize_platform_driver_1_#t~ret99#1.offset;havoc ldv_initialize_platform_driver_1_#t~ret99#1.base, ldv_initialize_platform_driver_1_#t~ret99#1.offset;~s3c_hwmon_driver_group0~0.base, ~s3c_hwmon_driver_group0~0.offset := ldv_initialize_platform_driver_1_~tmp~10#1.base, ldv_initialize_platform_driver_1_~tmp~10#1.offset; {1453#true} is VALID [2022-02-20 22:04:54,688 INFO L290 TraceCheckUtils]: 19: Hoare triple {1453#true} assume { :end_inline_ldv_initialize_platform_driver_1 } true; {1453#true} is VALID [2022-02-20 22:04:54,688 INFO L290 TraceCheckUtils]: 20: Hoare triple {1453#true} assume !(0 != ~ldv_retval_1~0); {1453#true} is VALID [2022-02-20 22:04:54,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {1453#true} assume -2147483648 <= main_#t~nondet100#1 && main_#t~nondet100#1 <= 2147483647;main_~tmp~11#1 := main_#t~nondet100#1;havoc main_#t~nondet100#1;main_#t~switch101#1 := 0 == main_~tmp~11#1; {1453#true} is VALID [2022-02-20 22:04:54,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {1453#true} assume main_#t~switch101#1; {1453#true} is VALID [2022-02-20 22:04:54,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {1453#true} assume 0 != ~ldv_state_variable_1~0;assume -2147483648 <= main_#t~nondet102#1 && main_#t~nondet102#1 <= 2147483647;main_~tmp___0~4#1 := main_#t~nondet102#1;havoc main_#t~nondet102#1;main_#t~switch103#1 := 0 == main_~tmp___0~4#1; {1453#true} is VALID [2022-02-20 22:04:54,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {1453#true} assume main_#t~switch103#1; {1453#true} is VALID [2022-02-20 22:04:54,689 INFO L290 TraceCheckUtils]: 25: Hoare triple {1453#true} assume 1 == ~ldv_state_variable_1~0;assume { :begin_inline_s3c_hwmon_probe } true;s3c_hwmon_probe_#in~dev#1.base, s3c_hwmon_probe_#in~dev#1.offset := ~s3c_hwmon_driver_group0~0.base, ~s3c_hwmon_driver_group0~0.offset;havoc s3c_hwmon_probe_#res#1;havoc s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset, s3c_hwmon_probe_#t~nondet69#1, s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset, s3c_hwmon_probe_#t~nondet71#1, s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset, s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset, s3c_hwmon_probe_#t~ret74#1, s3c_hwmon_probe_#t~nondet75#1, s3c_hwmon_probe_#t~mem76#1.base, s3c_hwmon_probe_#t~mem76#1.offset, s3c_hwmon_probe_#t~ret77#1, s3c_hwmon_probe_#t~ret78#1, s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset, s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset, s3c_hwmon_probe_#t~ret81#1, s3c_hwmon_probe_#t~nondet82#1, s3c_hwmon_probe_#t~mem83#1.base, s3c_hwmon_probe_#t~mem83#1.offset, s3c_hwmon_probe_#t~ret84#1, s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset, s3c_hwmon_probe_#t~mem86#1, s3c_hwmon_probe_#t~nondet87#1, s3c_hwmon_probe_#t~mem88#1, s3c_hwmon_probe_#t~nondet89#1, s3c_hwmon_probe_#t~mem90#1.base, s3c_hwmon_probe_#t~mem90#1.offset, s3c_hwmon_probe_#t~ret91#1, s3c_hwmon_probe_#t~nondet92#1, s3c_hwmon_probe_#t~mem93#1.base, s3c_hwmon_probe_#t~mem93#1.offset, s3c_hwmon_probe_#t~mem94#1.base, s3c_hwmon_probe_#t~mem94#1.offset, s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset, s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset, s3c_hwmon_probe_~ret~3#1, s3c_hwmon_probe_~i~0#1, s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset, s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset, s3c_hwmon_probe_~tmp___0~3#1, s3c_hwmon_probe_~tmp___1~0#1, s3c_hwmon_probe_~tmp___2~0#1, s3c_hwmon_probe_~tmp___3~0#1, s3c_hwmon_probe_~cfg~2#1.base, s3c_hwmon_probe_~cfg~2#1.offset;s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset := s3c_hwmon_probe_#in~dev#1.base, s3c_hwmon_probe_#in~dev#1.offset;havoc s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset;havoc s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset;havoc s3c_hwmon_probe_~ret~3#1;havoc s3c_hwmon_probe_~i~0#1;havoc s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset;call s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset := #Ultimate.allocOnStack(8);havoc s3c_hwmon_probe_~tmp___0~3#1;havoc s3c_hwmon_probe_~tmp___1~0#1;havoc s3c_hwmon_probe_~tmp___2~0#1;havoc s3c_hwmon_probe_~tmp___3~0#1;havoc s3c_hwmon_probe_~cfg~2#1.base, s3c_hwmon_probe_~cfg~2#1.offset;call s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset := read~$Pointer$(s3c_hwmon_probe_~dev#1.base, 277 + s3c_hwmon_probe_~dev#1.offset, 8);s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset := s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset;havoc s3c_hwmon_probe_#t~mem68#1.base, s3c_hwmon_probe_#t~mem68#1.offset;s3c_hwmon_probe_~ret~3#1 := 0; {1453#true} is VALID [2022-02-20 22:04:54,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {1453#true} assume !(0 == (s3c_hwmon_probe_~pdata~2#1.base + s3c_hwmon_probe_~pdata~2#1.offset) % 18446744073709551616);assume { :begin_inline_ldv_kzalloc_9 } true;ldv_kzalloc_9_#in~size#1, ldv_kzalloc_9_#in~flags#1 := 800, 208;havoc ldv_kzalloc_9_#res#1.base, ldv_kzalloc_9_#res#1.offset;havoc ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset, ldv_kzalloc_9_~size#1, ldv_kzalloc_9_~flags#1, ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset;ldv_kzalloc_9_~size#1 := ldv_kzalloc_9_#in~size#1;ldv_kzalloc_9_~flags#1 := ldv_kzalloc_9_#in~flags#1;havoc ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset; {1453#true} is VALID [2022-02-20 22:04:54,690 INFO L272 TraceCheckUtils]: 27: Hoare triple {1453#true} call ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset := ldv_zalloc(ldv_kzalloc_9_~size#1); {1490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:54,696 INFO L290 TraceCheckUtils]: 28: Hoare triple {1490#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~size#1 := #in~size#1;havoc ~p~1#1.base, ~p~1#1.offset;havoc ~tmp~1#1.base, ~tmp~1#1.offset;havoc ~tmp___0~1#1;assume -2147483648 <= #t~nondet26#1 && #t~nondet26#1 <= 2147483647;~tmp___0~1#1 := #t~nondet26#1;havoc #t~nondet26#1; {1453#true} is VALID [2022-02-20 22:04:54,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {1453#true} assume 0 != ~tmp___0~1#1;#res#1.base, #res#1.offset := 0, 0; {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 22:04:54,698 INFO L290 TraceCheckUtils]: 30: Hoare triple {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} assume true; {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} is VALID [2022-02-20 22:04:54,698 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {1491#(and (<= 0 |ldv_zalloc_#res#1.base|) (<= 0 |ldv_zalloc_#res#1.offset|) (<= |ldv_zalloc_#res#1.offset| 0) (<= |ldv_zalloc_#res#1.base| 0))} {1453#true} #395#return; {1463#(and (= |ULTIMATE.start_ldv_kzalloc_9_#t~ret113#1.base| 0) (= |ULTIMATE.start_ldv_kzalloc_9_#t~ret113#1.offset| 0))} is VALID [2022-02-20 22:04:54,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {1463#(and (= |ULTIMATE.start_ldv_kzalloc_9_#t~ret113#1.base| 0) (= |ULTIMATE.start_ldv_kzalloc_9_#t~ret113#1.offset| 0))} ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset := ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset;havoc ldv_kzalloc_9_#t~ret113#1.base, ldv_kzalloc_9_#t~ret113#1.offset;ldv_kzalloc_9_#res#1.base, ldv_kzalloc_9_#res#1.offset := ldv_kzalloc_9_~tmp~16#1.base, ldv_kzalloc_9_~tmp~16#1.offset; {1464#(and (= |ULTIMATE.start_ldv_kzalloc_9_#res#1.offset| 0) (= |ULTIMATE.start_ldv_kzalloc_9_#res#1.base| 0))} is VALID [2022-02-20 22:04:54,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {1464#(and (= |ULTIMATE.start_ldv_kzalloc_9_#res#1.offset| 0) (= |ULTIMATE.start_ldv_kzalloc_9_#res#1.base| 0))} s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset := ldv_kzalloc_9_#res#1.base, ldv_kzalloc_9_#res#1.offset;assume { :end_inline_ldv_kzalloc_9 } true;s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset := s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset;havoc s3c_hwmon_probe_#t~ret70#1.base, s3c_hwmon_probe_#t~ret70#1.offset;s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset := s3c_hwmon_probe_~tmp~7#1.base, s3c_hwmon_probe_~tmp~7#1.offset; {1465#(and (= |ULTIMATE.start_s3c_hwmon_probe_~hwmon~1#1.offset| 0) (= |ULTIMATE.start_s3c_hwmon_probe_~hwmon~1#1.base| 0))} is VALID [2022-02-20 22:04:54,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {1465#(and (= |ULTIMATE.start_s3c_hwmon_probe_~hwmon~1#1.offset| 0) (= |ULTIMATE.start_s3c_hwmon_probe_~hwmon~1#1.base| 0))} assume !(0 == (s3c_hwmon_probe_~hwmon~1#1.base + s3c_hwmon_probe_~hwmon~1#1.offset) % 18446744073709551616);assume { :begin_inline_platform_set_drvdata } true;platform_set_drvdata_#in~pdev#1.base, platform_set_drvdata_#in~pdev#1.offset, platform_set_drvdata_#in~data#1.base, platform_set_drvdata_#in~data#1.offset := s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset;havoc platform_set_drvdata_~pdev#1.base, platform_set_drvdata_~pdev#1.offset, platform_set_drvdata_~data#1.base, platform_set_drvdata_~data#1.offset;platform_set_drvdata_~pdev#1.base, platform_set_drvdata_~pdev#1.offset := platform_set_drvdata_#in~pdev#1.base, platform_set_drvdata_#in~pdev#1.offset;platform_set_drvdata_~data#1.base, platform_set_drvdata_~data#1.offset := platform_set_drvdata_#in~data#1.base, platform_set_drvdata_#in~data#1.offset;assume { :begin_inline_dev_set_drvdata } true;dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset, dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset := platform_set_drvdata_~pdev#1.base, 12 + platform_set_drvdata_~pdev#1.offset, platform_set_drvdata_~data#1.base, platform_set_drvdata_~data#1.offset;havoc dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset, dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset;dev_set_drvdata_~arg0#1.base, dev_set_drvdata_~arg0#1.offset := dev_set_drvdata_#in~arg0#1.base, dev_set_drvdata_#in~arg0#1.offset;dev_set_drvdata_~arg1#1.base, dev_set_drvdata_~arg1#1.offset := dev_set_drvdata_#in~arg1#1.base, dev_set_drvdata_#in~arg1#1.offset; {1454#false} is VALID [2022-02-20 22:04:54,700 INFO L290 TraceCheckUtils]: 35: Hoare triple {1454#false} assume { :end_inline_dev_set_drvdata } true; {1454#false} is VALID [2022-02-20 22:04:54,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {1454#false} assume { :end_inline_platform_set_drvdata } true;assume { :begin_inline___mutex_init } true;__mutex_init_#in~arg0#1.base, __mutex_init_#in~arg0#1.offset, __mutex_init_#in~arg1#1.base, __mutex_init_#in~arg1#1.offset, __mutex_init_#in~arg2#1.base, __mutex_init_#in~arg2#1.offset := s3c_hwmon_probe_~hwmon~1#1.base, s3c_hwmon_probe_~hwmon~1#1.offset, 13, 0, s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset;havoc __mutex_init_~arg0#1.base, __mutex_init_~arg0#1.offset, __mutex_init_~arg1#1.base, __mutex_init_~arg1#1.offset, __mutex_init_~arg2#1.base, __mutex_init_~arg2#1.offset;__mutex_init_~arg0#1.base, __mutex_init_~arg0#1.offset := __mutex_init_#in~arg0#1.base, __mutex_init_#in~arg0#1.offset;__mutex_init_~arg1#1.base, __mutex_init_~arg1#1.offset := __mutex_init_#in~arg1#1.base, __mutex_init_#in~arg1#1.offset;__mutex_init_~arg2#1.base, __mutex_init_~arg2#1.offset := __mutex_init_#in~arg2#1.base, __mutex_init_#in~arg2#1.offset; {1454#false} is VALID [2022-02-20 22:04:54,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {1454#false} assume { :end_inline___mutex_init } true;assume { :begin_inline_s3c_adc_register } true;s3c_adc_register_#in~arg0#1.base, s3c_adc_register_#in~arg0#1.offset, s3c_adc_register_#in~arg1#1.base, s3c_adc_register_#in~arg1#1.offset, s3c_adc_register_#in~arg2#1.base, s3c_adc_register_#in~arg2#1.offset, s3c_adc_register_#in~arg3#1 := s3c_hwmon_probe_~dev#1.base, s3c_hwmon_probe_~dev#1.offset, 0, 0, 0, 0, 0;havoc s3c_adc_register_#res#1.base, s3c_adc_register_#res#1.offset;havoc s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset, s3c_adc_register_~arg0#1.base, s3c_adc_register_~arg0#1.offset, s3c_adc_register_~arg1#1.base, s3c_adc_register_~arg1#1.offset, s3c_adc_register_~arg2#1.base, s3c_adc_register_~arg2#1.offset, s3c_adc_register_~arg3#1;s3c_adc_register_~arg0#1.base, s3c_adc_register_~arg0#1.offset := s3c_adc_register_#in~arg0#1.base, s3c_adc_register_#in~arg0#1.offset;s3c_adc_register_~arg1#1.base, s3c_adc_register_~arg1#1.offset := s3c_adc_register_#in~arg1#1.base, s3c_adc_register_#in~arg1#1.offset;s3c_adc_register_~arg2#1.base, s3c_adc_register_~arg2#1.offset := s3c_adc_register_#in~arg2#1.base, s3c_adc_register_#in~arg2#1.offset;s3c_adc_register_~arg3#1 := s3c_adc_register_#in~arg3#1; {1454#false} is VALID [2022-02-20 22:04:54,701 INFO L272 TraceCheckUtils]: 38: Hoare triple {1454#false} call s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset := ldv_malloc(0); {1492#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:54,701 INFO L290 TraceCheckUtils]: 39: Hoare triple {1492#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {1453#true} is VALID [2022-02-20 22:04:54,701 INFO L290 TraceCheckUtils]: 40: Hoare triple {1453#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {1453#true} is VALID [2022-02-20 22:04:54,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,704 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1453#true} {1454#false} #397#return; {1454#false} is VALID [2022-02-20 22:04:54,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {1454#false} s3c_adc_register_#res#1.base, s3c_adc_register_#res#1.offset := s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset;havoc s3c_adc_register_#t~ret124#1.base, s3c_adc_register_#t~ret124#1.offset; {1454#false} is VALID [2022-02-20 22:04:54,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {1454#false} s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset := s3c_adc_register_#res#1.base, s3c_adc_register_#res#1.offset;assume { :end_inline_s3c_adc_register } true;call write~$Pointer$(s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, 152 + s3c_hwmon_probe_~hwmon~1#1.offset, 8);havoc s3c_hwmon_probe_#t~ret72#1.base, s3c_hwmon_probe_#t~ret72#1.offset;call s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset := read~$Pointer$(s3c_hwmon_probe_~hwmon~1#1.base, 152 + s3c_hwmon_probe_~hwmon~1#1.offset, 8); {1454#false} is VALID [2022-02-20 22:04:54,704 INFO L272 TraceCheckUtils]: 45: Hoare triple {1454#false} call s3c_hwmon_probe_#t~ret74#1 := IS_ERR(s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset); {1453#true} is VALID [2022-02-20 22:04:54,704 INFO L290 TraceCheckUtils]: 46: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,705 INFO L272 TraceCheckUtils]: 47: Hoare triple {1453#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {1453#true} is VALID [2022-02-20 22:04:54,705 INFO L290 TraceCheckUtils]: 48: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {1453#true} is VALID [2022-02-20 22:04:54,705 INFO L290 TraceCheckUtils]: 49: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,705 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1453#true} {1453#true} #445#return; {1453#true} is VALID [2022-02-20 22:04:54,705 INFO L290 TraceCheckUtils]: 51: Hoare triple {1453#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,705 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1453#true} {1454#false} #399#return; {1454#false} is VALID [2022-02-20 22:04:54,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {1454#false} assume -9223372036854775808 <= s3c_hwmon_probe_#t~ret74#1 && s3c_hwmon_probe_#t~ret74#1 <= 9223372036854775807;s3c_hwmon_probe_~tmp___1~0#1 := s3c_hwmon_probe_#t~ret74#1;havoc s3c_hwmon_probe_#t~mem73#1.base, s3c_hwmon_probe_#t~mem73#1.offset;havoc s3c_hwmon_probe_#t~ret74#1; {1454#false} is VALID [2022-02-20 22:04:54,709 INFO L290 TraceCheckUtils]: 55: Hoare triple {1454#false} assume !(0 != s3c_hwmon_probe_~tmp___1~0#1);assume { :begin_inline_s3c_hwmon_add_raw } true;s3c_hwmon_add_raw_#in~dev#1.base, s3c_hwmon_add_raw_#in~dev#1.offset := s3c_hwmon_probe_~dev#1.base, 12 + s3c_hwmon_probe_~dev#1.offset;havoc s3c_hwmon_add_raw_#res#1;havoc s3c_hwmon_add_raw_~dev#1.base, s3c_hwmon_add_raw_~dev#1.offset;s3c_hwmon_add_raw_~dev#1.base, s3c_hwmon_add_raw_~dev#1.offset := s3c_hwmon_add_raw_#in~dev#1.base, s3c_hwmon_add_raw_#in~dev#1.offset;s3c_hwmon_add_raw_#res#1 := 0; {1454#false} is VALID [2022-02-20 22:04:54,709 INFO L290 TraceCheckUtils]: 56: Hoare triple {1454#false} s3c_hwmon_probe_#t~ret78#1 := s3c_hwmon_add_raw_#res#1;assume { :end_inline_s3c_hwmon_add_raw } true;assume -2147483648 <= s3c_hwmon_probe_#t~ret78#1 && s3c_hwmon_probe_#t~ret78#1 <= 2147483647;s3c_hwmon_probe_~ret~3#1 := s3c_hwmon_probe_#t~ret78#1;havoc s3c_hwmon_probe_#t~ret78#1; {1454#false} is VALID [2022-02-20 22:04:54,710 INFO L290 TraceCheckUtils]: 57: Hoare triple {1454#false} assume !(0 != s3c_hwmon_probe_~ret~3#1);assume { :begin_inline_hwmon_device_register } true;hwmon_device_register_#in~arg0#1.base, hwmon_device_register_#in~arg0#1.offset := s3c_hwmon_probe_~dev#1.base, 12 + s3c_hwmon_probe_~dev#1.offset;havoc hwmon_device_register_#res#1.base, hwmon_device_register_#res#1.offset;havoc hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset, hwmon_device_register_~arg0#1.base, hwmon_device_register_~arg0#1.offset;hwmon_device_register_~arg0#1.base, hwmon_device_register_~arg0#1.offset := hwmon_device_register_#in~arg0#1.base, hwmon_device_register_#in~arg0#1.offset; {1454#false} is VALID [2022-02-20 22:04:54,710 INFO L272 TraceCheckUtils]: 58: Hoare triple {1454#false} call hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset := ldv_malloc(1003); {1492#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 22:04:54,710 INFO L290 TraceCheckUtils]: 59: Hoare triple {1492#(and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))} ~size := #in~size;havoc ~p~0.base, ~p~0.offset;havoc ~tmp~0.base, ~tmp~0.offset;havoc ~tmp___0~0;assume -2147483648 <= #t~nondet23 && #t~nondet23 <= 2147483647;~tmp___0~0 := #t~nondet23;havoc #t~nondet23; {1453#true} is VALID [2022-02-20 22:04:54,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {1453#true} assume 0 != ~tmp___0~0;#res.base, #res.offset := 0, 0; {1453#true} is VALID [2022-02-20 22:04:54,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,710 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {1453#true} {1454#false} #403#return; {1454#false} is VALID [2022-02-20 22:04:54,710 INFO L290 TraceCheckUtils]: 63: Hoare triple {1454#false} hwmon_device_register_#res#1.base, hwmon_device_register_#res#1.offset := hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset;havoc hwmon_device_register_#t~ret120#1.base, hwmon_device_register_#t~ret120#1.offset; {1454#false} is VALID [2022-02-20 22:04:54,711 INFO L290 TraceCheckUtils]: 64: Hoare triple {1454#false} s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset := hwmon_device_register_#res#1.base, hwmon_device_register_#res#1.offset;assume { :end_inline_hwmon_device_register } true;call write~$Pointer$(s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, 160 + s3c_hwmon_probe_~hwmon~1#1.offset, 8);havoc s3c_hwmon_probe_#t~ret79#1.base, s3c_hwmon_probe_#t~ret79#1.offset;call s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset := read~$Pointer$(s3c_hwmon_probe_~hwmon~1#1.base, 160 + s3c_hwmon_probe_~hwmon~1#1.offset, 8); {1454#false} is VALID [2022-02-20 22:04:54,712 INFO L272 TraceCheckUtils]: 65: Hoare triple {1454#false} call s3c_hwmon_probe_#t~ret81#1 := IS_ERR(s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset); {1453#true} is VALID [2022-02-20 22:04:54,712 INFO L290 TraceCheckUtils]: 66: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;havoc ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,712 INFO L272 TraceCheckUtils]: 67: Hoare triple {1453#true} call #t~ret110 := ldv_is_err(~ptr.base, ~ptr.offset); {1453#true} is VALID [2022-02-20 22:04:54,712 INFO L290 TraceCheckUtils]: 68: Hoare triple {1453#true} ~ptr.base, ~ptr.offset := #in~ptr.base, #in~ptr.offset;#res := (if (~ptr.base + ~ptr.offset) % 18446744073709551616 > 2012 then 1 else 0); {1453#true} is VALID [2022-02-20 22:04:54,712 INFO L290 TraceCheckUtils]: 69: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,712 INFO L284 TraceCheckUtils]: 70: Hoare quadruple {1453#true} {1453#true} #445#return; {1453#true} is VALID [2022-02-20 22:04:54,712 INFO L290 TraceCheckUtils]: 71: Hoare triple {1453#true} assume -9223372036854775808 <= #t~ret110 && #t~ret110 <= 9223372036854775807;~tmp~13 := #t~ret110;havoc #t~ret110;#res := ~tmp~13; {1453#true} is VALID [2022-02-20 22:04:54,712 INFO L290 TraceCheckUtils]: 72: Hoare triple {1453#true} assume true; {1453#true} is VALID [2022-02-20 22:04:54,713 INFO L284 TraceCheckUtils]: 73: Hoare quadruple {1453#true} {1454#false} #405#return; {1454#false} is VALID [2022-02-20 22:04:54,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {1454#false} assume -9223372036854775808 <= s3c_hwmon_probe_#t~ret81#1 && s3c_hwmon_probe_#t~ret81#1 <= 9223372036854775807;s3c_hwmon_probe_~tmp___3~0#1 := s3c_hwmon_probe_#t~ret81#1;havoc s3c_hwmon_probe_#t~mem80#1.base, s3c_hwmon_probe_#t~mem80#1.offset;havoc s3c_hwmon_probe_#t~ret81#1; {1454#false} is VALID [2022-02-20 22:04:54,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {1454#false} assume !(0 != s3c_hwmon_probe_~tmp___3~0#1);s3c_hwmon_probe_~i~0#1 := 0; {1454#false} is VALID [2022-02-20 22:04:54,713 INFO L290 TraceCheckUtils]: 76: Hoare triple {1454#false} assume s3c_hwmon_probe_~i~0#1 % 4294967296 <= 7; {1454#false} is VALID [2022-02-20 22:04:54,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {1454#false} call s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset := read~$Pointer$(s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset + 8 * s3c_hwmon_probe_~i~0#1, 8);s3c_hwmon_probe_~cfg~2#1.base, s3c_hwmon_probe_~cfg~2#1.offset := s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset;havoc s3c_hwmon_probe_#t~mem85#1.base, s3c_hwmon_probe_#t~mem85#1.offset; {1454#false} is VALID [2022-02-20 22:04:54,713 INFO L290 TraceCheckUtils]: 78: Hoare triple {1454#false} assume !(0 == (s3c_hwmon_probe_~cfg~2#1.base + s3c_hwmon_probe_~cfg~2#1.offset) % 18446744073709551616);call s3c_hwmon_probe_#t~mem86#1 := read~int(s3c_hwmon_probe_~cfg~2#1.base, 8 + s3c_hwmon_probe_~cfg~2#1.offset, 4); {1454#false} is VALID [2022-02-20 22:04:54,713 INFO L290 TraceCheckUtils]: 79: Hoare triple {1454#false} assume s3c_hwmon_probe_#t~mem86#1 % 4294967296 > 65535;havoc s3c_hwmon_probe_#t~mem86#1;havoc s3c_hwmon_probe_#t~nondet87#1; {1454#false} is VALID [2022-02-20 22:04:54,714 INFO L290 TraceCheckUtils]: 80: Hoare triple {1454#false} call s3c_hwmon_probe_#t~mem88#1 := read~int(s3c_hwmon_probe_~cfg~2#1.base, 12 + s3c_hwmon_probe_~cfg~2#1.offset, 4); {1454#false} is VALID [2022-02-20 22:04:54,714 INFO L290 TraceCheckUtils]: 81: Hoare triple {1454#false} assume !(0 == s3c_hwmon_probe_#t~mem88#1 % 4294967296);havoc s3c_hwmon_probe_#t~mem88#1;call s3c_hwmon_probe_#t~mem90#1.base, s3c_hwmon_probe_#t~mem90#1.offset := read~$Pointer$(s3c_hwmon_probe_~pdata~2#1.base, s3c_hwmon_probe_~pdata~2#1.offset + 8 * s3c_hwmon_probe_~i~0#1, 8);assume { :begin_inline_s3c_hwmon_create_attr } true;s3c_hwmon_create_attr_#in~dev#1.base, s3c_hwmon_create_attr_#in~dev#1.offset, s3c_hwmon_create_attr_#in~cfg#1.base, s3c_hwmon_create_attr_#in~cfg#1.offset, s3c_hwmon_create_attr_#in~attrs#1.base, s3c_hwmon_create_attr_#in~attrs#1.offset, s3c_hwmon_create_attr_#in~channel#1 := s3c_hwmon_probe_~dev#1.base, 12 + s3c_hwmon_probe_~dev#1.offset, s3c_hwmon_probe_#t~mem90#1.base, s3c_hwmon_probe_#t~mem90#1.offset, s3c_hwmon_probe_~hwmon~1#1.base, 168 + s3c_hwmon_probe_~hwmon~1#1.offset + 120 * (s3c_hwmon_probe_~i~0#1 % 4294967296), s3c_hwmon_probe_~i~0#1;havoc s3c_hwmon_create_attr_#res#1;havoc s3c_hwmon_create_attr_#t~nondet61#1, s3c_hwmon_create_attr_#t~ret62#1, s3c_hwmon_create_attr_#t~nondet63#1, s3c_hwmon_create_attr_#t~mem64#1.base, s3c_hwmon_create_attr_#t~mem64#1.offset, s3c_hwmon_create_attr_#t~nondet65#1, s3c_hwmon_create_attr_#t~ret66#1, s3c_hwmon_create_attr_#t~nondet67#1, s3c_hwmon_create_attr_~dev#1.base, s3c_hwmon_create_attr_~dev#1.offset, s3c_hwmon_create_attr_~cfg#1.base, s3c_hwmon_create_attr_~cfg#1.offset, s3c_hwmon_create_attr_~attrs#1.base, s3c_hwmon_create_attr_~attrs#1.offset, s3c_hwmon_create_attr_~channel#1, s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset, s3c_hwmon_create_attr_~ret~2#1;s3c_hwmon_create_attr_~dev#1.base, s3c_hwmon_create_attr_~dev#1.offset := s3c_hwmon_create_attr_#in~dev#1.base, s3c_hwmon_create_attr_#in~dev#1.offset;s3c_hwmon_create_attr_~cfg#1.base, s3c_hwmon_create_attr_~cfg#1.offset := s3c_hwmon_create_attr_#in~cfg#1.base, s3c_hwmon_create_attr_#in~cfg#1.offset;s3c_hwmon_create_attr_~attrs#1.base, s3c_hwmon_create_attr_~attrs#1.offset := s3c_hwmon_create_attr_#in~attrs#1.base, s3c_hwmon_create_attr_#in~attrs#1.offset;s3c_hwmon_create_attr_~channel#1 := s3c_hwmon_create_attr_#in~channel#1;havoc s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset;havoc s3c_hwmon_create_attr_~ret~2#1;havoc s3c_hwmon_create_attr_#t~nondet61#1;s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset := s3c_hwmon_create_attr_~attrs#1.base, s3c_hwmon_create_attr_~attrs#1.offset;call write~int(s3c_hwmon_create_attr_~channel#1, s3c_hwmon_create_attr_~attr~0#1.base, 44 + s3c_hwmon_create_attr_~attr~0#1.offset, 4);call write~$Pointer$(s3c_hwmon_create_attr_~attrs#1.base, 96 + s3c_hwmon_create_attr_~attrs#1.offset, s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset, 8);call write~int(292, s3c_hwmon_create_attr_~attr~0#1.base, 8 + s3c_hwmon_create_attr_~attr~0#1.offset, 4);call write~$Pointer$(#funAddr~s3c_hwmon_ch_show.base, #funAddr~s3c_hwmon_ch_show.offset, s3c_hwmon_create_attr_~attr~0#1.base, 28 + s3c_hwmon_create_attr_~attr~0#1.offset, 8);assume { :begin_inline_ldv_device_create_file_7 } true;ldv_device_create_file_7_#in~ldv_func_arg1#1.base, ldv_device_create_file_7_#in~ldv_func_arg1#1.offset, ldv_device_create_file_7_#in~ldv_func_arg2#1.base, ldv_device_create_file_7_#in~ldv_func_arg2#1.offset := s3c_hwmon_create_attr_~dev#1.base, s3c_hwmon_create_attr_~dev#1.offset, s3c_hwmon_create_attr_~attr~0#1.base, s3c_hwmon_create_attr_~attr~0#1.offset;havoc ldv_device_create_file_7_#res#1;havoc ldv_device_create_file_7_#t~ret111#1, ldv_device_create_file_7_~ldv_func_arg1#1.base, ldv_device_create_file_7_~ldv_func_arg1#1.offset, ldv_device_create_file_7_~ldv_func_arg2#1.base, ldv_device_create_file_7_~ldv_func_arg2#1.offset, ldv_device_create_file_7_~tmp~14#1;ldv_device_create_file_7_~ldv_func_arg1#1.base, ldv_device_create_file_7_~ldv_func_arg1#1.offset := ldv_device_create_file_7_#in~ldv_func_arg1#1.base, ldv_device_create_file_7_#in~ldv_func_arg1#1.offset;ldv_device_create_file_7_~ldv_func_arg2#1.base, ldv_device_create_file_7_~ldv_func_arg2#1.offset := ldv_device_create_file_7_#in~ldv_func_arg2#1.base, ldv_device_create_file_7_#in~ldv_func_arg2#1.offset;havoc ldv_device_create_file_7_~tmp~14#1; {1454#false} is VALID [2022-02-20 22:04:54,714 INFO L272 TraceCheckUtils]: 82: Hoare triple {1454#false} call ldv_device_create_file_7_#t~ret111#1 := ldv_device_create_file_dev_attr_of_sensor_device_attribute(); {1454#false} is VALID [2022-02-20 22:04:54,714 INFO L290 TraceCheckUtils]: 83: Hoare triple {1454#false} havoc ~tmp~18#1; {1454#false} is VALID [2022-02-20 22:04:54,714 INFO L290 TraceCheckUtils]: 84: Hoare triple {1454#false} assume 0 == ~ldv_call_dev_attr_of_sensor_device_attribute~0;~ldv_count_2~0 := 1 + ~ldv_count_2~0;~ldv_call_dev_attr_of_sensor_device_attribute~0 := 1; {1454#false} is VALID [2022-02-20 22:04:54,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {1454#false} assume !(~ldv_count_1~0 >= ~ldv_count_2~0); {1454#false} is VALID [2022-02-20 22:04:54,714 INFO L272 TraceCheckUtils]: 86: Hoare triple {1454#false} call ldv_error(); {1454#false} is VALID [2022-02-20 22:04:54,715 INFO L290 TraceCheckUtils]: 87: Hoare triple {1454#false} assume !false; {1454#false} is VALID [2022-02-20 22:04:54,715 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 22:04:54,716 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 22:04:54,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473672319] [2022-02-20 22:04:54,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473672319] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 22:04:54,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 22:04:54,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 22:04:54,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844911924] [2022-02-20 22:04:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 22:04:54,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2022-02-20 22:04:54,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 22:04:54,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:04:54,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:54,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 22:04:54,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 22:04:54,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 22:04:54,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 22:04:54,767 INFO L87 Difference]: Start difference. First operand 187 states and 242 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:04:56,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:56,320 INFO L93 Difference]: Finished difference Result 497 states and 670 transitions. [2022-02-20 22:04:56,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 22:04:56,321 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 88 [2022-02-20 22:04:56,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 22:04:56,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:04:56,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 574 transitions. [2022-02-20 22:04:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:04:56,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 574 transitions. [2022-02-20 22:04:56,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 574 transitions. [2022-02-20 22:04:56,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 574 edges. 574 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 22:04:56,734 INFO L225 Difference]: With dead ends: 497 [2022-02-20 22:04:56,735 INFO L226 Difference]: Without dead ends: 313 [2022-02-20 22:04:56,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 22:04:56,736 INFO L933 BasicCegarLoop]: 279 mSDtfsCounter, 226 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1180 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 22:04:56,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1180 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 22:04:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2022-02-20 22:04:56,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 192. [2022-02-20 22:04:56,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 22:04:56,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand has 192 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 147 states have internal predecessors, (185), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (32), 31 states have call predecessors, (32), 30 states have call successors, (32) [2022-02-20 22:04:56,748 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand has 192 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 147 states have internal predecessors, (185), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (32), 31 states have call predecessors, (32), 30 states have call successors, (32) [2022-02-20 22:04:56,749 INFO L87 Difference]: Start difference. First operand 313 states. Second operand has 192 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 147 states have internal predecessors, (185), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (32), 31 states have call predecessors, (32), 30 states have call successors, (32) [2022-02-20 22:04:56,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:56,763 INFO L93 Difference]: Finished difference Result 313 states and 430 transitions. [2022-02-20 22:04:56,763 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 430 transitions. [2022-02-20 22:04:56,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:56,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:56,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 192 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 147 states have internal predecessors, (185), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (32), 31 states have call predecessors, (32), 30 states have call successors, (32) Second operand 313 states. [2022-02-20 22:04:56,765 INFO L87 Difference]: Start difference. First operand has 192 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 147 states have internal predecessors, (185), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (32), 31 states have call predecessors, (32), 30 states have call successors, (32) Second operand 313 states. [2022-02-20 22:04:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 22:04:56,774 INFO L93 Difference]: Finished difference Result 313 states and 430 transitions. [2022-02-20 22:04:56,774 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 430 transitions. [2022-02-20 22:04:56,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 22:04:56,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 22:04:56,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 22:04:56,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 22:04:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.2671232876712328) internal successors, (185), 147 states have internal predecessors, (185), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (32), 31 states have call predecessors, (32), 30 states have call successors, (32) [2022-02-20 22:04:56,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 248 transitions. [2022-02-20 22:04:56,780 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 248 transitions. Word has length 88 [2022-02-20 22:04:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 22:04:56,781 INFO L470 AbstractCegarLoop]: Abstraction has 192 states and 248 transitions. [2022-02-20 22:04:56,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 22:04:56,781 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 248 transitions. [2022-02-20 22:04:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 22:04:56,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 22:04:56,782 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 22:04:56,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 22:04:56,782 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 22:04:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 22:04:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1622073071, now seen corresponding path program 1 times [2022-02-20 22:04:56,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 22:04:56,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814780007] [2022-02-20 22:04:56,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 22:04:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 22:04:56,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 22:04:56,897 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 22:04:56,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 22:04:56,985 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 22:04:56,985 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 22:04:56,986 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 22:04:56,987 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 22:04:56,989 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 22:04:56,991 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 22:04:57,007 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,008 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,008 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,008 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,009 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,009 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,009 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,010 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,010 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,010 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,010 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,011 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,011 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,011 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,011 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,011 WARN L418 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-02-20 22:04:57,057 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret99 := ldv_zalloc(624); [2022-02-20 22:04:57,058 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 22:04:57,060 INFO L158 Benchmark]: Toolchain (without parser) took 6034.90ms. Allocated memory was 104.9MB in the beginning and 167.8MB in the end (delta: 62.9MB). Free memory was 75.7MB in the beginning and 51.4MB in the end (delta: 24.3MB). Peak memory consumption was 86.8MB. Max. memory is 16.1GB. [2022-02-20 22:04:57,061 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 63.2MB in the beginning and 63.1MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 22:04:57,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 515.10ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 59.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 22:04:57,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.77ms. Allocated memory is still 104.9MB. Free memory was 59.5MB in the beginning and 54.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 22:04:57,062 INFO L158 Benchmark]: Boogie Preprocessor took 89.96ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 54.0MB in the beginning and 102.9MB in the end (delta: -48.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-02-20 22:04:57,062 INFO L158 Benchmark]: RCFGBuilder took 710.41ms. Allocated memory is still 127.9MB. Free memory was 102.9MB in the beginning and 58.2MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-02-20 22:04:57,062 INFO L158 Benchmark]: TraceAbstraction took 4642.49ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 57.1MB in the beginning and 51.4MB in the end (delta: 5.7MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. [2022-02-20 22:04:57,063 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 104.9MB. Free memory was 63.2MB in the beginning and 63.1MB in the end (delta: 47.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 515.10ms. Allocated memory is still 104.9MB. Free memory was 75.4MB in the beginning and 59.5MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.77ms. Allocated memory is still 104.9MB. Free memory was 59.5MB in the beginning and 54.0MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 89.96ms. Allocated memory was 104.9MB in the beginning and 127.9MB in the end (delta: 23.1MB). Free memory was 54.0MB in the beginning and 102.9MB in the end (delta: -48.9MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * RCFGBuilder took 710.41ms. Allocated memory is still 127.9MB. Free memory was 102.9MB in the beginning and 58.2MB in the end (delta: 44.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 4642.49ms. Allocated memory was 127.9MB in the beginning and 167.8MB in the end (delta: 39.8MB). Free memory was 57.1MB in the beginning and 51.4MB in the end (delta: 5.7MB). Peak memory consumption was 45.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 22:04:57,090 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 22:04:58,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 22:04:58,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 22:04:58,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 22:04:58,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 22:04:58,752 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 22:04:58,754 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 22:04:58,759 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 22:04:58,761 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 22:04:58,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 22:04:58,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 22:04:58,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 22:04:58,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 22:04:58,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 22:04:58,773 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 22:04:58,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 22:04:58,778 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 22:04:58,778 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 22:04:58,780 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 22:04:58,784 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 22:04:58,787 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 22:04:58,788 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 22:04:58,789 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 22:04:58,790 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 22:04:58,793 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 22:04:58,794 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 22:04:58,794 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 22:04:58,795 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 22:04:58,796 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 22:04:58,797 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 22:04:58,797 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 22:04:58,797 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 22:04:58,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 22:04:58,798 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 22:04:58,798 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 22:04:58,799 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 22:04:58,799 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 22:04:58,799 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 22:04:58,799 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 22:04:58,800 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 22:04:58,800 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 22:04:58,801 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-02-20 22:04:58,825 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 22:04:58,825 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 22:04:58,826 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 22:04:58,826 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 22:04:58,827 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 22:04:58,827 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 22:04:58,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 22:04:58,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 22:04:58,828 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 22:04:58,828 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 22:04:58,829 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 22:04:58,829 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 22:04:58,829 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 22:04:58,829 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 22:04:58,829 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 22:04:58,829 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 22:04:58,830 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 22:04:58,830 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 22:04:58,830 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 22:04:58,830 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 22:04:58,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 22:04:58,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 22:04:58,830 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 22:04:58,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 22:04:58,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 22:04:58,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 22:04:58,831 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 22:04:58,839 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 22:04:58,839 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 22:04:58,839 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 22:04:58,839 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 22:04:58,839 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 22:04:58,840 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 22:04:58,840 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14cb0b0179e79f0e2d385464cbe440f1c78ee76831b4c47fbbc7c2a57322304c [2022-02-20 22:04:59,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 22:04:59,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 22:04:59,122 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 22:04:59,123 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 22:04:59,124 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 22:04:59,125 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-02-20 22:04:59,173 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53055c2/a745f199fe9e409da880d9a670dc008f/FLAG47825d031 [2022-02-20 22:04:59,625 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 22:04:59,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i [2022-02-20 22:04:59,636 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53055c2/a745f199fe9e409da880d9a670dc008f/FLAG47825d031 [2022-02-20 22:04:59,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d53055c2/a745f199fe9e409da880d9a670dc008f [2022-02-20 22:04:59,970 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 22:04:59,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 22:04:59,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 22:04:59,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 22:04:59,979 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 22:04:59,980 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:04:59" (1/1) ... [2022-02-20 22:04:59,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ef4c1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 10:04:59, skipping insertion in model container [2022-02-20 22:04:59,981 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 10:04:59" (1/1) ... [2022-02-20 22:04:59,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 22:05:00,035 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 22:05:00,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.6/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point.cil.out.i[24075,24088] [2022-02-20 22:05:00,322 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.IllegalArgumentException: cannot determine size of incomplete type at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:256) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:203) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.checkIfNecessaryMemoryModelAdaption(CHandler.java:1000) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:968) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.result.ExpressionResultTransformer.transformDispatchDecaySwitchRexBoolToInt(ExpressionResultTransformer.java:177) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallGivenNameAndArguments(FunctionHandler.java:675) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionCallExpression(FunctionHandler.java:509) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1449) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:267) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:729) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1392) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1076) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1076) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1465) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3271) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2356) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:601) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:192) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 22:05:00,326 INFO L158 Benchmark]: Toolchain (without parser) took 355.22ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.6MB in the beginning and 53.4MB in the end (delta: -17.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 22:05:00,327 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 22:05:00,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.47ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.4MB in the beginning and 53.4MB in the end (delta: -18.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 22:05:00,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 40.8MB in the beginning and 40.8MB in the end (delta: 52.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.47ms. Allocated memory was 58.7MB in the beginning and 77.6MB in the end (delta: 18.9MB). Free memory was 35.4MB in the beginning and 53.4MB in the end (delta: -18.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: IllegalArgumentException: cannot determine size of incomplete type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: IllegalArgumentException: cannot determine size of incomplete type: de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructSizeTValueAndOffsets_StructAndUnion(TypeSizeAndOffsetComputer.java:256) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: cannot determine size of incomplete type