/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf -i ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-05d3305-m [2022-10-16 14:10:19,804 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-10-16 14:10:19,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-10-16 14:10:19,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-10-16 14:10:19,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-10-16 14:10:19,879 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-10-16 14:10:19,883 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-10-16 14:10:19,890 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-10-16 14:10:19,893 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-10-16 14:10:19,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-10-16 14:10:19,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-10-16 14:10:19,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-10-16 14:10:19,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-10-16 14:10:19,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-10-16 14:10:19,907 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-10-16 14:10:19,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-10-16 14:10:19,914 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-10-16 14:10:19,915 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-10-16 14:10:19,918 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-10-16 14:10:19,927 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-10-16 14:10:19,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-10-16 14:10:19,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-10-16 14:10:19,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-10-16 14:10:19,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-10-16 14:10:19,938 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-10-16 14:10:19,939 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-10-16 14:10:19,939 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-10-16 14:10:19,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-10-16 14:10:19,940 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-10-16 14:10:19,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-10-16 14:10:19,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-10-16 14:10:19,942 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-10-16 14:10:19,943 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-10-16 14:10:19,944 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-10-16 14:10:19,945 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-10-16 14:10:19,946 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-10-16 14:10:19,946 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-10-16 14:10:19,947 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-10-16 14:10:19,947 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-10-16 14:10:19,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-10-16 14:10:19,948 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-10-16 14:10:19,949 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Overflow-32bit-Automizer_Default.epf [2022-10-16 14:10:19,976 INFO L113 SettingsManager]: Loading preferences was successful [2022-10-16 14:10:19,977 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-10-16 14:10:19,977 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-10-16 14:10:19,977 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-10-16 14:10:19,978 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-10-16 14:10:19,978 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-10-16 14:10:19,979 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-10-16 14:10:19,979 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-10-16 14:10:19,979 INFO L138 SettingsManager]: * Use SBE=true [2022-10-16 14:10:19,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-10-16 14:10:19,980 INFO L138 SettingsManager]: * sizeof long=4 [2022-10-16 14:10:19,980 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-10-16 14:10:19,980 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-10-16 14:10:19,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-10-16 14:10:19,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-10-16 14:10:19,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-10-16 14:10:19,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-10-16 14:10:19,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-10-16 14:10:19,982 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-10-16 14:10:19,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-10-16 14:10:19,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-10-16 14:10:19,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-10-16 14:10:19,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-10-16 14:10:19,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-10-16 14:10:19,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-10-16 14:10:19,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-10-16 14:10:19,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:10:19,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-10-16 14:10:19,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-10-16 14:10:19,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-10-16 14:10:19,984 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-10-16 14:10:19,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-10-16 14:10:19,984 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-10-16 14:10:19,985 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 [2022-10-16 14:10:20,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-10-16 14:10:20,361 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-10-16 14:10:20,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-10-16 14:10:20,367 INFO L271 PluginConnector]: Initializing CDTParser... [2022-10-16 14:10:20,367 INFO L275 PluginConnector]: CDTParser initialized [2022-10-16 14:10:20,369 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:10:20,455 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2808b0214/7eaa8b122e0a453cb8f319d39e05570b/FLAGfa8148d6f [2022-10-16 14:10:21,246 INFO L306 CDTParser]: Found 1 translation units. [2022-10-16 14:10:21,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:10:21,275 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2808b0214/7eaa8b122e0a453cb8f319d39e05570b/FLAGfa8148d6f [2022-10-16 14:10:21,465 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2808b0214/7eaa8b122e0a453cb8f319d39e05570b [2022-10-16 14:10:21,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-10-16 14:10:21,477 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-10-16 14:10:21,482 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-10-16 14:10:21,482 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-10-16 14:10:21,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-10-16 14:10:21,489 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:10:21" (1/1) ... [2022-10-16 14:10:21,491 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e096dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:21, skipping insertion in model container [2022-10-16 14:10:21,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:10:21" (1/1) ... [2022-10-16 14:10:21,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-10-16 14:10:21,597 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-10-16 14:10:22,295 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.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i[37767,37780] [2022-10-16 14:10:22,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:10:22,330 INFO L203 MainTranslator]: Completed pre-run [2022-10-16 14:10:22,467 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.8/linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i[37767,37780] [2022-10-16 14:10:22,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-10-16 14:10:22,521 INFO L208 MainTranslator]: Completed translation [2022-10-16 14:10:22,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22 WrapperNode [2022-10-16 14:10:22,521 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-10-16 14:10:22,523 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-10-16 14:10:22,523 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-10-16 14:10:22,523 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-10-16 14:10:22,531 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,584 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,639 INFO L138 Inliner]: procedures = 83, calls = 176, calls flagged for inlining = 31, calls inlined = 25, statements flattened = 523 [2022-10-16 14:10:22,640 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-10-16 14:10:22,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-10-16 14:10:22,641 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-10-16 14:10:22,641 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-10-16 14:10:22,651 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,659 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,719 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,729 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-10-16 14:10:22,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-10-16 14:10:22,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-10-16 14:10:22,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-10-16 14:10:22,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (1/1) ... [2022-10-16 14:10:22,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-10-16 14:10:22,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:22,789 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-10-16 14:10:22,797 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-10-16 14:10:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2022-10-16 14:10:22,841 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2022-10-16 14:10:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_probe [2022-10-16 14:10:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_probe [2022-10-16 14:10:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-10-16 14:10:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-10-16 14:10:22,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-10-16 14:10:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-10-16 14:10:22,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-10-16 14:10:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-10-16 14:10:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-10-16 14:10:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-10-16 14:10:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-10-16 14:10:22,843 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-10-16 14:10:22,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-10-16 14:10:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-10-16 14:10:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-10-16 14:10:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-10-16 14:10:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-10-16 14:10:22,844 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-10-16 14:10:22,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-10-16 14:10:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2022-10-16 14:10:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2022-10-16 14:10:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-10-16 14:10:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-10-16 14:10:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2022-10-16 14:10:22,845 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2022-10-16 14:10:22,845 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2022-10-16 14:10:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2022-10-16 14:10:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-10-16 14:10:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2022-10-16 14:10:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2022-10-16 14:10:22,846 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-10-16 14:10:22,846 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-10-16 14:10:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-10-16 14:10:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove [2022-10-16 14:10:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove [2022-10-16 14:10:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-10-16 14:10:22,847 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-10-16 14:10:22,847 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-10-16 14:10:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-10-16 14:10:22,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-10-16 14:10:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2022-10-16 14:10:22,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2022-10-16 14:10:22,848 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-10-16 14:10:22,848 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-10-16 14:10:23,118 INFO L235 CfgBuilder]: Building ICFG [2022-10-16 14:10:23,121 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-10-16 14:10:23,580 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-10-16 14:10:23,830 INFO L276 CfgBuilder]: Performing block encoding [2022-10-16 14:10:23,840 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-10-16 14:10:23,840 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-10-16 14:10:23,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:10:23 BoogieIcfgContainer [2022-10-16 14:10:23,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-10-16 14:10:23,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-10-16 14:10:23,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-10-16 14:10:23,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-10-16 14:10:23,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:10:21" (1/3) ... [2022-10-16 14:10:23,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1a9397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:10:23, skipping insertion in model container [2022-10-16 14:10:23,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:10:22" (2/3) ... [2022-10-16 14:10:23,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e1a9397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:10:23, skipping insertion in model container [2022-10-16 14:10:23,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:10:23" (3/3) ... [2022-10-16 14:10:23,855 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-stable-af3071a-1-130_7a-drivers--hwmon--s3c-hwmon.ko-entry_point_ldv-val-v0.8.cil.out.i [2022-10-16 14:10:23,876 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-10-16 14:10:23,877 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2022-10-16 14:10:23,947 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-10-16 14:10:23,957 INFO L357 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=FINITE_AUTOMATA, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@246a4c6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-10-16 14:10:23,958 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2022-10-16 14:10:23,963 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 161 states have (on average 1.360248447204969) internal successors, (219), 182 states have internal predecessors, (219), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 14:10:23,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-10-16 14:10:23,974 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:23,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:23,975 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:23,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:23,982 INFO L85 PathProgramCache]: Analyzing trace with hash -548774463, now seen corresponding path program 1 times [2022-10-16 14:10:23,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:23,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533680102] [2022-10-16 14:10:23,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:23,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:24,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-10-16 14:10:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:24,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-10-16 14:10:24,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:24,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533680102] [2022-10-16 14:10:24,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533680102] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:24,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:24,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 14:10:24,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804439371] [2022-10-16 14:10:24,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:24,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:10:24,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:24,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:10:24,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:10:24,475 INFO L87 Difference]: Start difference. First operand has 234 states, 161 states have (on average 1.360248447204969) internal successors, (219), 182 states have internal predecessors, (219), 40 states have call successors, (40), 17 states have call predecessors, (40), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 14:10:25,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:25,052 INFO L93 Difference]: Finished difference Result 514 states and 672 transitions. [2022-10-16 14:10:25,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:10:25,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-10-16 14:10:25,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:25,070 INFO L225 Difference]: With dead ends: 514 [2022-10-16 14:10:25,071 INFO L226 Difference]: Without dead ends: 260 [2022-10-16 14:10:25,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:10:25,082 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 92 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:25,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 586 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 14:10:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-10-16 14:10:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 237. [2022-10-16 14:10:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 169 states have (on average 1.3372781065088757) internal successors, (226), 185 states have internal predecessors, (226), 36 states have call successors, (36), 16 states have call predecessors, (36), 16 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-10-16 14:10:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 298 transitions. [2022-10-16 14:10:25,175 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 298 transitions. Word has length 16 [2022-10-16 14:10:25,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:25,176 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 298 transitions. [2022-10-16 14:10:25,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-10-16 14:10:25,177 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 298 transitions. [2022-10-16 14:10:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-10-16 14:10:25,181 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:25,181 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:25,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-10-16 14:10:25,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:25,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1987841195, now seen corresponding path program 1 times [2022-10-16 14:10:25,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:25,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357298905] [2022-10-16 14:10:25,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:25,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:25,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:25,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:25,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:25,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-10-16 14:10:25,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:25,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357298905] [2022-10-16 14:10:25,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357298905] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:25,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:25,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 14:10:25,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753537659] [2022-10-16 14:10:25,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:25,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:10:25,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:25,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:10:25,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:10:25,536 INFO L87 Difference]: Start difference. First operand 237 states and 298 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 14:10:26,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:26,121 INFO L93 Difference]: Finished difference Result 517 states and 659 transitions. [2022-10-16 14:10:26,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:10:26,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2022-10-16 14:10:26,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:26,166 INFO L225 Difference]: With dead ends: 517 [2022-10-16 14:10:26,166 INFO L226 Difference]: Without dead ends: 511 [2022-10-16 14:10:26,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:10:26,174 INFO L413 NwaCegarLoop]: 327 mSDtfsCounter, 391 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:26,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 648 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 14:10:26,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2022-10-16 14:10:26,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 455. [2022-10-16 14:10:26,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 335 states have (on average 1.3223880597014925) internal successors, (443), 352 states have internal predecessors, (443), 72 states have call successors, (72), 32 states have call predecessors, (72), 32 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-10-16 14:10:26,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 587 transitions. [2022-10-16 14:10:26,278 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 587 transitions. Word has length 40 [2022-10-16 14:10:26,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:26,279 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 587 transitions. [2022-10-16 14:10:26,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-10-16 14:10:26,279 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 587 transitions. [2022-10-16 14:10:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-10-16 14:10:26,283 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:26,283 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-10-16 14:10:26,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-10-16 14:10:26,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:26,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:26,284 INFO L85 PathProgramCache]: Analyzing trace with hash 298072317, now seen corresponding path program 1 times [2022-10-16 14:10:26,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:26,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102740] [2022-10-16 14:10:26,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:26,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:26,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:26,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:26,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:26,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:26,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-10-16 14:10:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:26,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-10-16 14:10:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102740] [2022-10-16 14:10:26,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102740] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:26,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:26,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 14:10:26,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956489192] [2022-10-16 14:10:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:26,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:10:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:10:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:10:26,475 INFO L87 Difference]: Start difference. First operand 455 states and 587 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 14:10:27,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:27,040 INFO L93 Difference]: Finished difference Result 1159 states and 1489 transitions. [2022-10-16 14:10:27,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:10:27,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 54 [2022-10-16 14:10:27,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:27,047 INFO L225 Difference]: With dead ends: 1159 [2022-10-16 14:10:27,047 INFO L226 Difference]: Without dead ends: 707 [2022-10-16 14:10:27,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-10-16 14:10:27,051 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 179 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:27,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 796 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 14:10:27,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-10-16 14:10:27,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 621. [2022-10-16 14:10:27,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 621 states, 455 states have (on average 1.298901098901099) internal successors, (591), 472 states have internal predecessors, (591), 96 states have call successors, (96), 54 states have call predecessors, (96), 54 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2022-10-16 14:10:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 783 transitions. [2022-10-16 14:10:27,113 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 783 transitions. Word has length 54 [2022-10-16 14:10:27,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:27,114 INFO L495 AbstractCegarLoop]: Abstraction has 621 states and 783 transitions. [2022-10-16 14:10:27,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-10-16 14:10:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 783 transitions. [2022-10-16 14:10:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-10-16 14:10:27,118 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:27,119 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-10-16 14:10:27,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-10-16 14:10:27,119 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:27,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:27,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1731795937, now seen corresponding path program 1 times [2022-10-16 14:10:27,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:27,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961329501] [2022-10-16 14:10:27,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:27,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:27,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:27,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:27,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-10-16 14:10:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-10-16 14:10:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-10-16 14:10:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:27,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,431 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-10-16 14:10:27,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:27,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961329501] [2022-10-16 14:10:27,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961329501] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:27,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680732587] [2022-10-16 14:10:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:27,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:27,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:27,435 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:27,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-10-16 14:10:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:27,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjunts are in the unsatisfiable core [2022-10-16 14:10:27,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:27,688 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-10-16 14:10:27,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:10:27,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680732587] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:27,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:10:27,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-10-16 14:10:27,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977308125] [2022-10-16 14:10:27,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:27,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-10-16 14:10:27,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:27,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-10-16 14:10:27,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:10:27,693 INFO L87 Difference]: Start difference. First operand 621 states and 783 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 14:10:27,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:27,795 INFO L93 Difference]: Finished difference Result 1322 states and 1672 transitions. [2022-10-16 14:10:27,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-10-16 14:10:27,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 66 [2022-10-16 14:10:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:27,802 INFO L225 Difference]: With dead ends: 1322 [2022-10-16 14:10:27,802 INFO L226 Difference]: Without dead ends: 704 [2022-10-16 14:10:27,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:10:27,806 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 194 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:27,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 576 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:10:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-10-16 14:10:27,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 692. [2022-10-16 14:10:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 517 states have (on average 1.3075435203094778) internal successors, (676), 535 states have internal predecessors, (676), 104 states have call successors, (104), 55 states have call predecessors, (104), 55 states have return successors, (104), 104 states have call predecessors, (104), 104 states have call successors, (104) [2022-10-16 14:10:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 884 transitions. [2022-10-16 14:10:27,864 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 884 transitions. Word has length 66 [2022-10-16 14:10:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:27,865 INFO L495 AbstractCegarLoop]: Abstraction has 692 states and 884 transitions. [2022-10-16 14:10:27,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 14:10:27,866 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 884 transitions. [2022-10-16 14:10:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-10-16 14:10:27,868 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:27,868 INFO L195 NwaCegarLoop]: trace histogram [3, 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] [2022-10-16 14:10:27,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-10-16 14:10:28,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:28,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:28,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:28,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1735791587, now seen corresponding path program 1 times [2022-10-16 14:10:28,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:28,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698465891] [2022-10-16 14:10:28,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:28,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:28,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:28,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 14:10:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:10:28,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 14:10:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:28,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-10-16 14:10:28,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:28,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698465891] [2022-10-16 14:10:28,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698465891] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:28,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:28,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-10-16 14:10:28,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261564550] [2022-10-16 14:10:28,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:28,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:10:28,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:28,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:10:28,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:10:28,293 INFO L87 Difference]: Start difference. First operand 692 states and 884 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:10:28,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:28,763 INFO L93 Difference]: Finished difference Result 1260 states and 1626 transitions. [2022-10-16 14:10:28,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-10-16 14:10:28,764 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2022-10-16 14:10:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:28,771 INFO L225 Difference]: With dead ends: 1260 [2022-10-16 14:10:28,771 INFO L226 Difference]: Without dead ends: 758 [2022-10-16 14:10:28,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 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-10-16 14:10:28,774 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 62 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:28,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 694 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:10:28,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-10-16 14:10:28,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 700. [2022-10-16 14:10:28,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 523 states have (on average 1.3040152963671128) internal successors, (682), 541 states have internal predecessors, (682), 106 states have call successors, (106), 55 states have call predecessors, (106), 55 states have return successors, (106), 106 states have call predecessors, (106), 106 states have call successors, (106) [2022-10-16 14:10:28,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 894 transitions. [2022-10-16 14:10:28,828 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 894 transitions. Word has length 81 [2022-10-16 14:10:28,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:28,829 INFO L495 AbstractCegarLoop]: Abstraction has 700 states and 894 transitions. [2022-10-16 14:10:28,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:10:28,829 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 894 transitions. [2022-10-16 14:10:28,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-10-16 14:10:28,831 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:28,831 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-16 14:10:28,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-10-16 14:10:28,832 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:28,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:28,833 INFO L85 PathProgramCache]: Analyzing trace with hash 9879826, now seen corresponding path program 1 times [2022-10-16 14:10:28,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:28,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851440938] [2022-10-16 14:10:28,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:28,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:28,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:28,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 14:10:28,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 14:10:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:28,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:10:29,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 14:10:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:29,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,027 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 14:10:29,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:29,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851440938] [2022-10-16 14:10:29,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851440938] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:29,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:29,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:10:29,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102859386] [2022-10-16 14:10:29,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:29,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:10:29,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:10:29,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:10:29,034 INFO L87 Difference]: Start difference. First operand 700 states and 894 transitions. Second operand has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 14:10:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:29,373 INFO L93 Difference]: Finished difference Result 1521 states and 1978 transitions. [2022-10-16 14:10:29,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:10:29,374 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 84 [2022-10-16 14:10:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:29,380 INFO L225 Difference]: With dead ends: 1521 [2022-10-16 14:10:29,380 INFO L226 Difference]: Without dead ends: 824 [2022-10-16 14:10:29,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:10:29,384 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 82 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:29,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 581 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 14:10:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2022-10-16 14:10:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 772. [2022-10-16 14:10:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 586 states have (on average 1.3071672354948805) internal successors, (766), 604 states have internal predecessors, (766), 115 states have call successors, (115), 55 states have call predecessors, (115), 55 states have return successors, (115), 115 states have call predecessors, (115), 115 states have call successors, (115) [2022-10-16 14:10:29,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 996 transitions. [2022-10-16 14:10:29,437 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 996 transitions. Word has length 84 [2022-10-16 14:10:29,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:29,437 INFO L495 AbstractCegarLoop]: Abstraction has 772 states and 996 transitions. [2022-10-16 14:10:29,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 14:10:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 996 transitions. [2022-10-16 14:10:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-10-16 14:10:29,439 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:29,440 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:29,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-10-16 14:10:29,440 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:29,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:29,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1848564369, now seen corresponding path program 2 times [2022-10-16 14:10:29,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:29,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977734796] [2022-10-16 14:10:29,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:29,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:29,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:29,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:29,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-10-16 14:10:29,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-10-16 14:10:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-10-16 14:10:29,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-10-16 14:10:29,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:29,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977734796] [2022-10-16 14:10:29,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977734796] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:29,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:29,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-10-16 14:10:29,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584385796] [2022-10-16 14:10:29,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:29,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:10:29,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:29,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:10:29,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:10:29,597 INFO L87 Difference]: Start difference. First operand 772 states and 996 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 14:10:29,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:29,984 INFO L93 Difference]: Finished difference Result 1325 states and 1708 transitions. [2022-10-16 14:10:29,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:10:29,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 78 [2022-10-16 14:10:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:29,989 INFO L225 Difference]: With dead ends: 1325 [2022-10-16 14:10:29,989 INFO L226 Difference]: Without dead ends: 530 [2022-10-16 14:10:29,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:10:29,993 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 269 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:29,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 567 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 14:10:29,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-10-16 14:10:30,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 497. [2022-10-16 14:10:30,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 370 states have (on average 1.2783783783783784) internal successors, (473), 385 states have internal predecessors, (473), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-10-16 14:10:30,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 621 transitions. [2022-10-16 14:10:30,039 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 621 transitions. Word has length 78 [2022-10-16 14:10:30,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:30,039 INFO L495 AbstractCegarLoop]: Abstraction has 497 states and 621 transitions. [2022-10-16 14:10:30,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-10-16 14:10:30,040 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 621 transitions. [2022-10-16 14:10:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-10-16 14:10:30,041 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:30,042 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-16 14:10:30,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-10-16 14:10:30,042 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:30,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:30,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1826441039, now seen corresponding path program 1 times [2022-10-16 14:10:30,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:30,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496130449] [2022-10-16 14:10:30,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:30,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:30,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:30,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 14:10:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 14:10:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:10:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 14:10:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 14:10:30,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:30,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496130449] [2022-10-16 14:10:30,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496130449] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:30,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558530986] [2022-10-16 14:10:30,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:30,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:30,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:30,324 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:30,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-10-16 14:10:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:30,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 699 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:10:30,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:30,586 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 14:10:30,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:10:30,648 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 14:10:30,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558530986] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:10:30,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:10:30,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2022-10-16 14:10:30,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124952404] [2022-10-16 14:10:30,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:10:30,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:10:30,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:30,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:10:30,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:10:30,651 INFO L87 Difference]: Start difference. First operand 497 states and 621 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 14:10:31,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:31,062 INFO L93 Difference]: Finished difference Result 609 states and 785 transitions. [2022-10-16 14:10:31,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-10-16 14:10:31,063 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 89 [2022-10-16 14:10:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:31,068 INFO L225 Difference]: With dead ends: 609 [2022-10-16 14:10:31,068 INFO L226 Difference]: Without dead ends: 605 [2022-10-16 14:10:31,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:10:31,069 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 203 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:31,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 746 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 14:10:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-10-16 14:10:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 546. [2022-10-16 14:10:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 414 states have (on average 1.2826086956521738) internal successors, (531), 426 states have internal predecessors, (531), 82 states have call successors, (82), 39 states have call predecessors, (82), 39 states have return successors, (82), 82 states have call predecessors, (82), 82 states have call successors, (82) [2022-10-16 14:10:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 695 transitions. [2022-10-16 14:10:31,119 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 695 transitions. Word has length 89 [2022-10-16 14:10:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:31,119 INFO L495 AbstractCegarLoop]: Abstraction has 546 states and 695 transitions. [2022-10-16 14:10:31,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 7 states have internal predecessors, (77), 1 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 14:10:31,120 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 695 transitions. [2022-10-16 14:10:31,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-10-16 14:10:31,121 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:31,122 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-16 14:10:31,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:31,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-10-16 14:10:31,335 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:31,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 785097531, now seen corresponding path program 1 times [2022-10-16 14:10:31,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:31,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572439798] [2022-10-16 14:10:31,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:31,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:31,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 14:10:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 14:10:31,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:31,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:10:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 14:10:31,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,591 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 14:10:31,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:31,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572439798] [2022-10-16 14:10:31,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572439798] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:31,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143359607] [2022-10-16 14:10:31,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:31,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:31,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:31,593 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:31,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-10-16 14:10:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:31,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 700 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:10:31,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:31,834 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 14:10:31,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:10:31,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143359607] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:31,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:10:31,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-10-16 14:10:31,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432568007] [2022-10-16 14:10:31,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:31,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:10:31,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:31,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:10:31,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:10:31,837 INFO L87 Difference]: Start difference. First operand 546 states and 695 transitions. Second operand has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 14:10:31,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:31,953 INFO L93 Difference]: Finished difference Result 1072 states and 1370 transitions. [2022-10-16 14:10:31,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:10:31,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 90 [2022-10-16 14:10:31,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:31,957 INFO L225 Difference]: With dead ends: 1072 [2022-10-16 14:10:31,957 INFO L226 Difference]: Without dead ends: 551 [2022-10-16 14:10:31,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-10-16 14:10:31,960 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 49 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:31,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 520 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:10:31,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-10-16 14:10:31,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 489. [2022-10-16 14:10:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 368 states have (on average 1.247282608695652) internal successors, (459), 377 states have internal predecessors, (459), 74 states have call successors, (74), 39 states have call predecessors, (74), 39 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2022-10-16 14:10:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 607 transitions. [2022-10-16 14:10:32,003 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 607 transitions. Word has length 90 [2022-10-16 14:10:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:32,004 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 607 transitions. [2022-10-16 14:10:32,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.333333333333332) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-10-16 14:10:32,004 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 607 transitions. [2022-10-16 14:10:32,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-10-16 14:10:32,006 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:32,006 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-10-16 14:10:32,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:32,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:32,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:32,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:32,222 INFO L85 PathProgramCache]: Analyzing trace with hash 498488219, now seen corresponding path program 1 times [2022-10-16 14:10:32,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:32,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674947887] [2022-10-16 14:10:32,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:32,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:32,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-10-16 14:10:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:10:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-10-16 14:10:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:10:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:32,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-10-16 14:10:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:32,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674947887] [2022-10-16 14:10:32,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674947887] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:32,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432897588] [2022-10-16 14:10:32,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:32,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:32,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:32,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:32,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-10-16 14:10:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:32,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 14:10:32,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:32,662 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 14:10:32,663 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:10:32,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432897588] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:32,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:10:32,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-10-16 14:10:32,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772063998] [2022-10-16 14:10:32,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:32,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:10:32,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:32,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:10:32,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:10:32,665 INFO L87 Difference]: Start difference. First operand 489 states and 607 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:10:32,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:32,802 INFO L93 Difference]: Finished difference Result 1149 states and 1423 transitions. [2022-10-16 14:10:32,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:10:32,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2022-10-16 14:10:32,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:32,809 INFO L225 Difference]: With dead ends: 1149 [2022-10-16 14:10:32,809 INFO L226 Difference]: Without dead ends: 867 [2022-10-16 14:10:32,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:10:32,811 INFO L413 NwaCegarLoop]: 359 mSDtfsCounter, 197 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:32,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1322 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:10:32,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2022-10-16 14:10:32,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 679. [2022-10-16 14:10:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 512 states have (on average 1.2421875) internal successors, (636), 524 states have internal predecessors, (636), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-10-16 14:10:32,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 845 transitions. [2022-10-16 14:10:32,882 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 845 transitions. Word has length 96 [2022-10-16 14:10:32,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:32,882 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 845 transitions. [2022-10-16 14:10:32,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:10:32,883 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 845 transitions. [2022-10-16 14:10:32,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-10-16 14:10:32,884 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:32,885 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-10-16 14:10:32,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:33,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:33,098 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 569557243, now seen corresponding path program 1 times [2022-10-16 14:10:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:33,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300041062] [2022-10-16 14:10:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:33,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:33,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:33,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:33,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 14:10:33,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 14:10:33,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:33,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:10:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 14:10:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:33,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-10-16 14:10:33,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:33,420 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-10-16 14:10:33,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:33,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300041062] [2022-10-16 14:10:33,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300041062] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:33,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:33,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-10-16 14:10:33,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493725284] [2022-10-16 14:10:33,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:33,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:10:33,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:33,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:10:33,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-10-16 14:10:33,423 INFO L87 Difference]: Start difference. First operand 679 states and 845 transitions. Second operand has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 14:10:33,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:33,863 INFO L93 Difference]: Finished difference Result 1389 states and 1746 transitions. [2022-10-16 14:10:33,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-10-16 14:10:33,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 95 [2022-10-16 14:10:33,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:33,872 INFO L225 Difference]: With dead ends: 1389 [2022-10-16 14:10:33,873 INFO L226 Difference]: Without dead ends: 1387 [2022-10-16 14:10:33,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-10-16 14:10:33,875 INFO L413 NwaCegarLoop]: 304 mSDtfsCounter, 290 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:33,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 629 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-10-16 14:10:33,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2022-10-16 14:10:34,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1319. [2022-10-16 14:10:34,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 995 states have (on average 1.236180904522613) internal successors, (1230), 1012 states have internal predecessors, (1230), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-10-16 14:10:34,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1659 transitions. [2022-10-16 14:10:34,013 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1659 transitions. Word has length 95 [2022-10-16 14:10:34,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:34,014 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1659 transitions. [2022-10-16 14:10:34,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-10-16 14:10:34,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1659 transitions. [2022-10-16 14:10:34,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-10-16 14:10:34,016 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:34,016 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2022-10-16 14:10:34,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-10-16 14:10:34,017 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:34,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:34,017 INFO L85 PathProgramCache]: Analyzing trace with hash -496679220, now seen corresponding path program 1 times [2022-10-16 14:10:34,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:34,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511225235] [2022-10-16 14:10:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:34,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:34,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:34,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-10-16 14:10:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:34,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-10-16 14:10:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-10-16 14:10:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-10-16 14:10:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-10-16 14:10:34,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:34,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511225235] [2022-10-16 14:10:34,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511225235] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:34,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066346670] [2022-10-16 14:10:34,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:34,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:34,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:34,234 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:34,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-10-16 14:10:34,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:34,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 672 conjuncts, 4 conjunts are in the unsatisfiable core [2022-10-16 14:10:34,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:34,455 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-10-16 14:10:34,455 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:10:34,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066346670] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:34,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:10:34,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2022-10-16 14:10:34,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106296616] [2022-10-16 14:10:34,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:34,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-10-16 14:10:34,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:34,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-10-16 14:10:34,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:10:34,458 INFO L87 Difference]: Start difference. First operand 1319 states and 1659 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:10:34,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:34,705 INFO L93 Difference]: Finished difference Result 2647 states and 3318 transitions. [2022-10-16 14:10:34,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:10:34,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2022-10-16 14:10:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:34,720 INFO L225 Difference]: With dead ends: 2647 [2022-10-16 14:10:34,720 INFO L226 Difference]: Without dead ends: 2085 [2022-10-16 14:10:34,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-10-16 14:10:34,724 INFO L413 NwaCegarLoop]: 357 mSDtfsCounter, 197 mSDsluCounter, 958 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:34,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 1315 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:10:34,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2085 states. [2022-10-16 14:10:34,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2085 to 1319. [2022-10-16 14:10:34,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 995 states have (on average 1.236180904522613) internal successors, (1230), 1012 states have internal predecessors, (1230), 204 states have call successors, (204), 106 states have call predecessors, (204), 112 states have return successors, (225), 206 states have call predecessors, (225), 204 states have call successors, (225) [2022-10-16 14:10:34,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1659 transitions. [2022-10-16 14:10:34,883 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1659 transitions. Word has length 100 [2022-10-16 14:10:34,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:34,883 INFO L495 AbstractCegarLoop]: Abstraction has 1319 states and 1659 transitions. [2022-10-16 14:10:34,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-10-16 14:10:34,883 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1659 transitions. [2022-10-16 14:10:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-10-16 14:10:34,886 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:34,886 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 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, 1, 1, 1] [2022-10-16 14:10:34,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:35,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-10-16 14:10:35,102 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:35,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:35,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1601901646, now seen corresponding path program 1 times [2022-10-16 14:10:35,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:35,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809155729] [2022-10-16 14:10:35,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:35,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:35,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-10-16 14:10:35,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-10-16 14:10:35,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-10-16 14:10:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-10-16 14:10:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-10-16 14:10:35,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-10-16 14:10:35,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-10-16 14:10:35,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:35,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809155729] [2022-10-16 14:10:35,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809155729] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:35,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-10-16 14:10:35,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-10-16 14:10:35,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837019364] [2022-10-16 14:10:35,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:35,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-10-16 14:10:35,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-10-16 14:10:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-10-16 14:10:35,692 INFO L87 Difference]: Start difference. First operand 1319 states and 1659 transitions. Second operand has 8 states, 8 states have (on average 9.375) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-10-16 14:10:36,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:36,210 INFO L93 Difference]: Finished difference Result 1368 states and 1709 transitions. [2022-10-16 14:10:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-10-16 14:10:36,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 113 [2022-10-16 14:10:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:36,215 INFO L225 Difference]: With dead ends: 1368 [2022-10-16 14:10:36,216 INFO L226 Difference]: Without dead ends: 696 [2022-10-16 14:10:36,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-10-16 14:10:36,220 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 398 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:36,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 638 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:10:36,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2022-10-16 14:10:36,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 665. [2022-10-16 14:10:36,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 665 states, 500 states have (on average 1.23) internal successors, (615), 510 states have internal predecessors, (615), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-10-16 14:10:36,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 824 transitions. [2022-10-16 14:10:36,302 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 824 transitions. Word has length 113 [2022-10-16 14:10:36,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:36,303 INFO L495 AbstractCegarLoop]: Abstraction has 665 states and 824 transitions. [2022-10-16 14:10:36,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.375) internal successors, (75), 6 states have internal predecessors, (75), 4 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2022-10-16 14:10:36,303 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 824 transitions. [2022-10-16 14:10:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-10-16 14:10:36,306 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:36,306 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:36,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-10-16 14:10:36,308 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:36,308 INFO L85 PathProgramCache]: Analyzing trace with hash -852113446, now seen corresponding path program 1 times [2022-10-16 14:10:36,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:36,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748139163] [2022-10-16 14:10:36,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:36,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:36,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-16 14:10:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 14:10:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:36,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:10:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:36,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-16 14:10:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-16 14:10:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 14:10:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,646 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-16 14:10:36,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748139163] [2022-10-16 14:10:36,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748139163] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:36,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671397428] [2022-10-16 14:10:36,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:36,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:36,650 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:36,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-10-16 14:10:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:36,880 INFO L263 TraceCheckSpWp]: Trace formula consists of 885 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:10:36,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:36,928 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-16 14:10:36,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:10:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-16 14:10:37,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671397428] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:10:37,021 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:10:37,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-16 14:10:37,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414856555] [2022-10-16 14:10:37,022 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:10:37,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 14:10:37,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:37,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 14:10:37,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:10:37,024 INFO L87 Difference]: Start difference. First operand 665 states and 824 transitions. Second operand has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-10-16 14:10:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:37,678 INFO L93 Difference]: Finished difference Result 729 states and 917 transitions. [2022-10-16 14:10:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-10-16 14:10:37,678 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) Word has length 129 [2022-10-16 14:10:37,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:37,683 INFO L225 Difference]: With dead ends: 729 [2022-10-16 14:10:37,684 INFO L226 Difference]: Without dead ends: 728 [2022-10-16 14:10:37,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 284 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-10-16 14:10:37,685 INFO L413 NwaCegarLoop]: 240 mSDtfsCounter, 113 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:37,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 781 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-10-16 14:10:37,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2022-10-16 14:10:37,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 664. [2022-10-16 14:10:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 500 states have (on average 1.228) internal successors, (614), 509 states have internal predecessors, (614), 103 states have call successors, (103), 53 states have call predecessors, (103), 56 states have return successors, (106), 104 states have call predecessors, (106), 103 states have call successors, (106) [2022-10-16 14:10:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 823 transitions. [2022-10-16 14:10:37,806 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 823 transitions. Word has length 129 [2022-10-16 14:10:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:37,807 INFO L495 AbstractCegarLoop]: Abstraction has 664 states and 823 transitions. [2022-10-16 14:10:37,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 6 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (17), 6 states have call predecessors, (17), 6 states have call successors, (17) [2022-10-16 14:10:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 823 transitions. [2022-10-16 14:10:37,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-10-16 14:10:37,810 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:37,810 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:37,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:38,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:38,026 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:38,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:38,027 INFO L85 PathProgramCache]: Analyzing trace with hash -645712824, now seen corresponding path program 1 times [2022-10-16 14:10:38,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:38,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870352174] [2022-10-16 14:10:38,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:38,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:38,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:38,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:38,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-16 14:10:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 14:10:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:38,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-10-16 14:10:38,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-10-16 14:10:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-10-16 14:10:38,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:38,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-10-16 14:10:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:38,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,285 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-16 14:10:38,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870352174] [2022-10-16 14:10:38,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870352174] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:38,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738388536] [2022-10-16 14:10:38,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:38,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:38,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:38,288 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:38,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-10-16 14:10:38,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:38,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:10:38,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2022-10-16 14:10:38,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:10:38,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738388536] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:38,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:10:38,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-16 14:10:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503768561] [2022-10-16 14:10:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:38,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:10:38,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:38,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:10:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:10:38,544 INFO L87 Difference]: Start difference. First operand 664 states and 823 transitions. Second operand has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-16 14:10:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:38,656 INFO L93 Difference]: Finished difference Result 664 states and 823 transitions. [2022-10-16 14:10:38,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:10:38,657 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2022-10-16 14:10:38,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:38,661 INFO L225 Difference]: With dead ends: 664 [2022-10-16 14:10:38,662 INFO L226 Difference]: Without dead ends: 663 [2022-10-16 14:10:38,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:10:38,663 INFO L413 NwaCegarLoop]: 247 mSDtfsCounter, 8 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:38,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 483 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-10-16 14:10:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-10-16 14:10:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 660. [2022-10-16 14:10:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 498 states have (on average 1.2269076305220883) internal successors, (611), 506 states have internal predecessors, (611), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-10-16 14:10:38,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 818 transitions. [2022-10-16 14:10:38,768 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 818 transitions. Word has length 130 [2022-10-16 14:10:38,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:38,768 INFO L495 AbstractCegarLoop]: Abstraction has 660 states and 818 transitions. [2022-10-16 14:10:38,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 26.333333333333332) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-10-16 14:10:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 818 transitions. [2022-10-16 14:10:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-10-16 14:10:38,772 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:38,772 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 14:10:38,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:38,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:38,985 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:38,986 INFO L85 PathProgramCache]: Analyzing trace with hash -564417073, now seen corresponding path program 1 times [2022-10-16 14:10:38,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:38,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809157447] [2022-10-16 14:10:38,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:38,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-16 14:10:39,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 14:10:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 14:10:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-16 14:10:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:10:39,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:10:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 14:10:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 14:10:39,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:39,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809157447] [2022-10-16 14:10:39,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809157447] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:39,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16621180] [2022-10-16 14:10:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:39,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:39,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:39,303 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:39,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-10-16 14:10:39,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:39,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 870 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:10:39,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:39,672 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:10:39,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-10-16 14:10:39,790 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 14:10:39,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16621180] provided 0 perfect and 2 imperfect interpolant sequences [2022-10-16 14:10:39,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-10-16 14:10:39,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 8 [2022-10-16 14:10:39,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313925328] [2022-10-16 14:10:39,791 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-10-16 14:10:39,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-10-16 14:10:39,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:39,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-10-16 14:10:39,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-10-16 14:10:39,793 INFO L87 Difference]: Start difference. First operand 660 states and 818 transitions. Second operand has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-10-16 14:10:40,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:40,524 INFO L93 Difference]: Finished difference Result 686 states and 853 transitions. [2022-10-16 14:10:40,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-10-16 14:10:40,525 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) Word has length 131 [2022-10-16 14:10:40,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:40,530 INFO L225 Difference]: With dead ends: 686 [2022-10-16 14:10:40,530 INFO L226 Difference]: Without dead ends: 684 [2022-10-16 14:10:40,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 291 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=110, Unknown=0, NotChecked=0, Total=182 [2022-10-16 14:10:40,531 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 1070 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1110 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 835 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 501 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:40,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1110 Valid, 550 Invalid, 835 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [501 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-10-16 14:10:40,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-10-16 14:10:40,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 658. [2022-10-16 14:10:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 658 states, 498 states have (on average 1.2228915662650603) internal successors, (609), 504 states have internal predecessors, (609), 102 states have call successors, (102), 53 states have call predecessors, (102), 56 states have return successors, (105), 103 states have call predecessors, (105), 102 states have call successors, (105) [2022-10-16 14:10:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 816 transitions. [2022-10-16 14:10:40,644 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 816 transitions. Word has length 131 [2022-10-16 14:10:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:40,645 INFO L495 AbstractCegarLoop]: Abstraction has 658 states and 816 transitions. [2022-10-16 14:10:40,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 26.0) internal successors, (208), 7 states have internal predecessors, (208), 6 states have call successors, (39), 5 states have call predecessors, (39), 3 states have return successors, (36), 6 states have call predecessors, (36), 6 states have call successors, (36) [2022-10-16 14:10:40,646 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 816 transitions. [2022-10-16 14:10:40,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-10-16 14:10:40,649 INFO L187 NwaCegarLoop]: Found error trace [2022-10-16 14:10:40,649 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-16 14:10:40,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:40,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-10-16 14:10:40,864 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 13 more)] === [2022-10-16 14:10:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-10-16 14:10:40,865 INFO L85 PathProgramCache]: Analyzing trace with hash -317059754, now seen corresponding path program 1 times [2022-10-16 14:10:40,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-10-16 14:10:40,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827357042] [2022-10-16 14:10:40,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:40,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-10-16 14:10:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-10-16 14:10:41,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-10-16 14:10:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-10-16 14:10:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-10-16 14:10:41,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-10-16 14:10:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-10-16 14:10:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-10-16 14:10:41,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:41,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-10-16 14:10:41,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-10-16 14:10:41,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-10-16 14:10:41,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-10-16 14:10:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-10-16 14:10:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-10-16 14:10:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-10-16 14:10:41,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-10-16 14:10:41,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827357042] [2022-10-16 14:10:41,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827357042] provided 0 perfect and 1 imperfect interpolant sequences [2022-10-16 14:10:41,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146966095] [2022-10-16 14:10:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-10-16 14:10:41,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-10-16 14:10:41,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-10-16 14:10:41,188 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-10-16 14:10:41,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-10-16 14:10:41,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-10-16 14:10:41,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 3 conjunts are in the unsatisfiable core [2022-10-16 14:10:41,410 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-10-16 14:10:41,550 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-10-16 14:10:41,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-10-16 14:10:41,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146966095] provided 1 perfect and 0 imperfect interpolant sequences [2022-10-16 14:10:41,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-10-16 14:10:41,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-10-16 14:10:41,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941382051] [2022-10-16 14:10:41,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-10-16 14:10:41,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-10-16 14:10:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-10-16 14:10:41,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-10-16 14:10:41,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:10:41,553 INFO L87 Difference]: Start difference. First operand 658 states and 816 transitions. Second operand has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-10-16 14:10:41,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-10-16 14:10:41,754 INFO L93 Difference]: Finished difference Result 658 states and 816 transitions. [2022-10-16 14:10:41,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-10-16 14:10:41,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2022-10-16 14:10:41,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-10-16 14:10:41,755 INFO L225 Difference]: With dead ends: 658 [2022-10-16 14:10:41,755 INFO L226 Difference]: Without dead ends: 0 [2022-10-16 14:10:41,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-10-16 14:10:41,759 INFO L413 NwaCegarLoop]: 291 mSDtfsCounter, 209 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-10-16 14:10:41,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 441 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-10-16 14:10:41,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-10-16 14:10:41,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-10-16 14:10:41,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-10-16 14:10:41,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-10-16 14:10:41,761 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2022-10-16 14:10:41,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-10-16 14:10:41,761 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-10-16 14:10:41,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 31.333333333333332) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-10-16 14:10:41,762 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-10-16 14:10:41,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-10-16 14:10:41,766 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2022-10-16 14:10:41,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2022-10-16 14:10:41,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2022-10-16 14:10:41,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2022-10-16 14:10:41,767 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2022-10-16 14:10:41,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2022-10-16 14:10:41,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2022-10-16 14:10:41,768 INFO L805 garLoopResultBuilder]: Registering result SAFE for location s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2022-10-16 14:10:41,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2022-10-16 14:10:41,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2022-10-16 14:10:41,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2022-10-16 14:10:41,769 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2022-10-16 14:10:41,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2022-10-16 14:10:41,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2022-10-16 14:10:41,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2022-10-16 14:10:41,770 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2022-10-16 14:10:41,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-10-16 14:10:41,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-10-16 14:10:41,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-10-16 14:10:51,796 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_rawENTRY(lines 940 945) the Hoare annotation is: true [2022-10-16 14:10:51,797 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawFINAL(lines 940 945) no Hoare annotation was computed. [2022-10-16 14:10:51,797 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_rawEXIT(lines 940 945) no Hoare annotation was computed. [2022-10-16 14:10:51,797 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_probeENTRY(lines 1040 1149) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|))) [2022-10-16 14:10:51,798 INFO L895 garLoopResultBuilder]: At program point L1142(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,799 INFO L895 garLoopResultBuilder]: At program point L1076(line 1076) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,799 INFO L899 garLoopResultBuilder]: For program point L1076-1(line 1076) no Hoare annotation was computed. [2022-10-16 14:10:51,802 INFO L895 garLoopResultBuilder]: At program point L1456(lines 1455 1457) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,802 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeFINAL(lines 1040 1149) no Hoare annotation was computed. [2022-10-16 14:10:51,802 INFO L895 garLoopResultBuilder]: At program point L837(lines 823 840) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,802 INFO L899 garLoopResultBuilder]: For program point L1118(line 1118) no Hoare annotation was computed. [2022-10-16 14:10:51,802 INFO L899 garLoopResultBuilder]: For program point L1118-1(line 1118) no Hoare annotation was computed. [2022-10-16 14:10:51,803 INFO L895 garLoopResultBuilder]: At program point L1135(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-10-16 14:10:51,803 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-10-16 14:10:51,803 INFO L895 garLoopResultBuilder]: At program point L937(lines 934 939) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,803 INFO L895 garLoopResultBuilder]: At program point L1507(line 1507) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,803 INFO L899 garLoopResultBuilder]: For program point L1507-1(line 1507) no Hoare annotation was computed. [2022-10-16 14:10:51,804 INFO L895 garLoopResultBuilder]: At program point L1507-2(lines 1506 1508) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,804 INFO L899 garLoopResultBuilder]: For program point L830(lines 830 838) no Hoare annotation was computed. [2022-10-16 14:10:51,804 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-10-16 14:10:51,804 INFO L895 garLoopResultBuilder]: At program point L1144(line 1144) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,804 INFO L899 garLoopResultBuilder]: For program point L1144-1(line 1144) no Hoare annotation was computed. [2022-10-16 14:10:51,804 INFO L899 garLoopResultBuilder]: For program point L1103(lines 1103 1107) no Hoare annotation was computed. [2022-10-16 14:10:51,805 INFO L899 garLoopResultBuilder]: For program point L1103-2(lines 1103 1107) no Hoare annotation was computed. [2022-10-16 14:10:51,805 INFO L895 garLoopResultBuilder]: At program point L1128(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,805 INFO L895 garLoopResultBuilder]: At program point L1029(lines 996 1031) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-10-16 14:10:51,805 INFO L895 garLoopResultBuilder]: At program point L1087(line 1087) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,805 INFO L899 garLoopResultBuilder]: For program point L1087-1(line 1087) no Hoare annotation was computed. [2022-10-16 14:10:51,806 INFO L895 garLoopResultBuilder]: At program point L1145(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,806 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-10-16 14:10:51,806 INFO L895 garLoopResultBuilder]: At program point L1352(line 1352) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-10-16 14:10:51,806 INFO L899 garLoopResultBuilder]: For program point L1063(lines 1063 1067) no Hoare annotation was computed. [2022-10-16 14:10:51,806 INFO L899 garLoopResultBuilder]: For program point L1352-1(line 1352) no Hoare annotation was computed. [2022-10-16 14:10:51,806 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeEXIT(lines 1040 1149) no Hoare annotation was computed. [2022-10-16 14:10:51,807 INFO L899 garLoopResultBuilder]: For program point L1121(line 1121) no Hoare annotation was computed. [2022-10-16 14:10:51,807 INFO L899 garLoopResultBuilder]: For program point L1088(lines 1088 1094) no Hoare annotation was computed. [2022-10-16 14:10:51,807 INFO L895 garLoopResultBuilder]: At program point L1344(line 1344) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-10-16 14:10:51,807 INFO L899 garLoopResultBuilder]: For program point L1344-1(line 1344) no Hoare annotation was computed. [2022-10-16 14:10:51,807 INFO L899 garLoopResultBuilder]: For program point L1022(lines 1022 1026) no Hoare annotation was computed. [2022-10-16 14:10:51,807 INFO L899 garLoopResultBuilder]: For program point L1014(lines 1014 1028) no Hoare annotation was computed. [2022-10-16 14:10:51,807 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1122) no Hoare annotation was computed. [2022-10-16 14:10:51,808 INFO L899 garLoopResultBuilder]: For program point L1014-1(lines 1014 1028) no Hoare annotation was computed. [2022-10-16 14:10:51,808 INFO L895 garLoopResultBuilder]: At program point L1361(lines 1356 1363) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,808 INFO L895 garLoopResultBuilder]: At program point L907(lines 903 909) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,808 INFO L895 garLoopResultBuilder]: At program point L1353(lines 1348 1355) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-10-16 14:10:51,808 INFO L899 garLoopResultBuilder]: For program point L1122(line 1122) no Hoare annotation was computed. [2022-10-16 14:10:51,809 INFO L895 garLoopResultBuilder]: At program point L833(line 833) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,809 INFO L895 garLoopResultBuilder]: At program point L1345(lines 1340 1347) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-10-16 14:10:51,809 INFO L899 garLoopResultBuilder]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2022-10-16 14:10:51,809 INFO L899 garLoopResultBuilder]: For program point L833-1(line 833) no Hoare annotation was computed. [2022-10-16 14:10:51,809 INFO L895 garLoopResultBuilder]: At program point L1023(line 1023) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0)))) [2022-10-16 14:10:51,809 INFO L899 garLoopResultBuilder]: For program point L1023-1(line 1023) no Hoare annotation was computed. [2022-10-16 14:10:51,810 INFO L895 garLoopResultBuilder]: At program point L1073(line 1073) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,810 INFO L899 garLoopResultBuilder]: For program point L1073-1(line 1073) no Hoare annotation was computed. [2022-10-16 14:10:51,810 INFO L895 garLoopResultBuilder]: At program point L1131(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (and (or (= |s3c_hwmon_probe_~i~0#1| 0) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646))) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,810 INFO L895 garLoopResultBuilder]: At program point L1123(lines 1115 1129) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,810 INFO L895 garLoopResultBuilder]: At program point L1090(line 1090) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,811 INFO L899 garLoopResultBuilder]: For program point L1090-1(line 1090) no Hoare annotation was computed. [2022-10-16 14:10:51,811 INFO L895 garLoopResultBuilder]: At program point L1470(lines 1469 1471) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,811 INFO L899 garLoopResultBuilder]: For program point L1115(lines 1115 1130) no Hoare annotation was computed. [2022-10-16 14:10:51,811 INFO L899 garLoopResultBuilder]: For program point L1082(lines 1082 1085) no Hoare annotation was computed. [2022-10-16 14:10:51,811 INFO L895 garLoopResultBuilder]: At program point L1140(line 1140) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (<= |s3c_hwmon_probe_~i~0#1| 0) (= ~ldv_count_2~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,811 INFO L899 garLoopResultBuilder]: For program point L1140-1(line 1140) no Hoare annotation was computed. [2022-10-16 14:10:51,811 INFO L899 garLoopResultBuilder]: For program point L1074(lines 1074 1080) no Hoare annotation was computed. [2022-10-16 14:10:51,812 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1132) no Hoare annotation was computed. [2022-10-16 14:10:51,812 INFO L899 garLoopResultBuilder]: For program point L1132(line 1132) no Hoare annotation was computed. [2022-10-16 14:10:51,812 INFO L899 garLoopResultBuilder]: For program point L1099(lines 1099 1102) no Hoare annotation was computed. [2022-10-16 14:10:51,812 INFO L895 garLoopResultBuilder]: At program point L835(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,812 INFO L895 garLoopResultBuilder]: At program point L835-1(line 835) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,812 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_probeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1118) no Hoare annotation was computed. [2022-10-16 14:10:51,813 INFO L895 garLoopResultBuilder]: At program point L1141(lines 1053 1148) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,813 INFO L899 garLoopResultBuilder]: For program point L1108(lines 1108 1112) no Hoare annotation was computed. [2022-10-16 14:10:51,813 INFO L899 garLoopResultBuilder]: For program point L1009(lines 1009 1013) no Hoare annotation was computed. [2022-10-16 14:10:51,813 INFO L895 garLoopResultBuilder]: At program point L1133(lines 1053 1148) the Hoare annotation is: (let ((.cse0 (= ~ldv_count_2~0 0))) (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (and (= |s3c_hwmon_probe_~i~0#1| 0) .cse0) (not (= ~ref_cnt~0 0)) (and (<= 1 |s3c_hwmon_probe_~i~0#1|) (<= |s3c_hwmon_probe_~i~0#1| 2147483646) .cse0) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)))) [2022-10-16 14:10:51,813 INFO L899 garLoopResultBuilder]: For program point L1513(lines 1513 1515) no Hoare annotation was computed. [2022-10-16 14:10:51,813 INFO L895 garLoopResultBuilder]: At program point L1480(line 1480) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,814 INFO L899 garLoopResultBuilder]: For program point L1480-1(line 1480) no Hoare annotation was computed. [2022-10-16 14:10:51,814 INFO L895 garLoopResultBuilder]: At program point L1480-2(lines 1479 1481) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,814 INFO L895 garLoopResultBuilder]: At program point L1125(lines 1115 1129) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (and (<= 0 |s3c_hwmon_probe_~i~0#1|) (< |s3c_hwmon_probe_~i~0#1| 2147483646) (= ~ldv_count_2~0 0)) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,814 INFO L899 garLoopResultBuilder]: For program point L836(line 836) no Hoare annotation was computed. [2022-10-16 14:10:51,814 INFO L895 garLoopResultBuilder]: At program point L836-1(line 836) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= ~ref_cnt~0 0)) (not (= |old(~ldv_count_2~0)| 0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,814 INFO L899 garLoopResultBuilder]: For program point L836-2(line 836) no Hoare annotation was computed. [2022-10-16 14:10:51,815 INFO L895 garLoopResultBuilder]: At program point platform_get_drvdataENTRY(lines 895 902) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,815 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataEXIT(lines 895 902) no Hoare annotation was computed. [2022-10-16 14:10:51,815 INFO L895 garLoopResultBuilder]: At program point L1463(line 1463) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,815 INFO L899 garLoopResultBuilder]: For program point platform_get_drvdataFINAL(lines 895 902) no Hoare annotation was computed. [2022-10-16 14:10:51,815 INFO L899 garLoopResultBuilder]: For program point L1463-1(line 1463) no Hoare annotation was computed. [2022-10-16 14:10:51,815 INFO L902 garLoopResultBuilder]: At program point L1463-2(lines 1462 1464) the Hoare annotation is: true [2022-10-16 14:10:51,815 INFO L902 garLoopResultBuilder]: At program point ldv_undef_intENTRY(lines 860 867) the Hoare annotation is: true [2022-10-16 14:10:51,816 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intFINAL(lines 860 867) no Hoare annotation was computed. [2022-10-16 14:10:51,816 INFO L899 garLoopResultBuilder]: For program point ldv_undef_intEXIT(lines 860 867) no Hoare annotation was computed. [2022-10-16 14:10:51,816 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterFINAL(lines 1482 1484) no Hoare annotation was computed. [2022-10-16 14:10:51,816 INFO L902 garLoopResultBuilder]: At program point hwmon_device_unregisterENTRY(lines 1482 1484) the Hoare annotation is: true [2022-10-16 14:10:51,816 INFO L899 garLoopResultBuilder]: For program point hwmon_device_unregisterEXIT(lines 1482 1484) no Hoare annotation was computed. [2022-10-16 14:10:51,816 INFO L899 garLoopResultBuilder]: For program point ldv_stopEXIT(lines 876 882) no Hoare annotation was computed. [2022-10-16 14:10:51,816 INFO L902 garLoopResultBuilder]: At program point ldv_stopENTRY(lines 876 882) the Hoare annotation is: true [2022-10-16 14:10:51,817 INFO L895 garLoopResultBuilder]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (= |#memory_int| |old(#memory_int)|) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,817 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitEXIT(line -1) no Hoare annotation was computed. [2022-10-16 14:10:51,817 INFO L899 garLoopResultBuilder]: For program point #Ultimate.meminitFINAL(line -1) no Hoare annotation was computed. [2022-10-16 14:10:51,817 INFO L902 garLoopResultBuilder]: At program point s3c_adc_releaseENTRY(lines 1509 1511) the Hoare annotation is: true [2022-10-16 14:10:51,817 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseEXIT(lines 1509 1511) no Hoare annotation was computed. [2022-10-16 14:10:51,817 INFO L899 garLoopResultBuilder]: For program point s3c_adc_releaseFINAL(lines 1509 1511) no Hoare annotation was computed. [2022-10-16 14:10:51,817 INFO L899 garLoopResultBuilder]: For program point L801(line 801) no Hoare annotation was computed. [2022-10-16 14:10:51,817 INFO L899 garLoopResultBuilder]: For program point L801-2(lines 800 802) no Hoare annotation was computed. [2022-10-16 14:10:51,818 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 800 802) the Hoare annotation is: true [2022-10-16 14:10:51,818 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 800 802) no Hoare annotation was computed. [2022-10-16 14:10:51,818 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeFINAL(lines 1150 1173) no Hoare annotation was computed. [2022-10-16 14:10:51,818 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeEXIT(lines 1150 1173) no Hoare annotation was computed. [2022-10-16 14:10:51,818 INFO L895 garLoopResultBuilder]: At program point L1170(line 1170) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,818 INFO L895 garLoopResultBuilder]: At program point L1169(line 1169) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,819 INFO L899 garLoopResultBuilder]: For program point L1170-1(line 1170) no Hoare annotation was computed. [2022-10-16 14:10:51,819 INFO L899 garLoopResultBuilder]: For program point L1169-1(line 1169) no Hoare annotation was computed. [2022-10-16 14:10:51,819 INFO L895 garLoopResultBuilder]: At program point L1166(lines 1155 1172) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (and (<= 1 s3c_hwmon_remove_~i~1) (< s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,819 INFO L895 garLoopResultBuilder]: At program point L1164(lines 1155 1172) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (= s3c_hwmon_remove_~i~1 0) (and (<= 1 s3c_hwmon_remove_~i~1) (<= s3c_hwmon_remove_~i~1 2147483646)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,819 INFO L899 garLoopResultBuilder]: For program point L1163(line 1163) no Hoare annotation was computed. [2022-10-16 14:10:51,819 INFO L899 garLoopResultBuilder]: For program point L1162(line 1162) no Hoare annotation was computed. [2022-10-16 14:10:51,819 INFO L895 garLoopResultBuilder]: At program point s3c_hwmon_removeENTRY(lines 1150 1173) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,820 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-10-16 14:10:51,820 INFO L902 garLoopResultBuilder]: At program point L1158(line 1158) the Hoare annotation is: true [2022-10-16 14:10:51,820 INFO L899 garLoopResultBuilder]: For program point L1158-1(line 1158) no Hoare annotation was computed. [2022-10-16 14:10:51,820 INFO L895 garLoopResultBuilder]: At program point L1156(line 1156) the Hoare annotation is: (or (not (= ~ldv_state_variable_0~0 2)) (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) (not (= ~ldv_count_2~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= ~ldv_count_1~0 0)) (not (<= ~ref_cnt~0 1))) [2022-10-16 14:10:51,820 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_removeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1163) no Hoare annotation was computed. [2022-10-16 14:10:51,820 INFO L899 garLoopResultBuilder]: For program point L1156-1(line 1156) no Hoare annotation was computed. [2022-10-16 14:10:51,820 INFO L902 garLoopResultBuilder]: At program point L1400(lines 1397 1402) the Hoare annotation is: true [2022-10-16 14:10:51,821 INFO L899 garLoopResultBuilder]: For program point PTR_ERREXIT(lines 1324 1331) no Hoare annotation was computed. [2022-10-16 14:10:51,821 INFO L902 garLoopResultBuilder]: At program point PTR_ERRENTRY(lines 1324 1331) the Hoare annotation is: true [2022-10-16 14:10:51,821 INFO L899 garLoopResultBuilder]: For program point PTR_ERRFINAL(lines 1324 1331) no Hoare annotation was computed. [2022-10-16 14:10:51,821 INFO L899 garLoopResultBuilder]: For program point ldv_is_errEXIT(lines 1385 1390) no Hoare annotation was computed. [2022-10-16 14:10:51,821 INFO L902 garLoopResultBuilder]: At program point ldv_is_errENTRY(lines 1385 1390) the Hoare annotation is: true [2022-10-16 14:10:51,821 INFO L899 garLoopResultBuilder]: For program point ldv_is_errFINAL(lines 1385 1390) no Hoare annotation was computed. [2022-10-16 14:10:51,821 INFO L902 garLoopResultBuilder]: At program point L817(line 817) the Hoare annotation is: true [2022-10-16 14:10:51,821 INFO L902 garLoopResultBuilder]: At program point L818-1(line 818) the Hoare annotation is: true [2022-10-16 14:10:51,822 INFO L902 garLoopResultBuilder]: At program point L817-1(line 817) the Hoare annotation is: true [2022-10-16 14:10:51,822 INFO L899 garLoopResultBuilder]: For program point L818-2(line 818) no Hoare annotation was computed. [2022-10-16 14:10:51,822 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 805 822) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_state_variable_0~0 2))) (.cse1 (not (= ~ldv_count_2~0 0))) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= ~ldv_count_1~0 0)))) (and (or (not (<= ~probed_1~0 0)) .cse0 (not (<= 0 ~ref_cnt~0)) .cse1 .cse2 .cse3 (not (<= ~ref_cnt~0 0))) (or .cse0 (not (= ~ldv_state_variable_1~0 2)) (not (<= 1 ~ref_cnt~0)) .cse1 .cse2 .cse3 (not (<= ~ref_cnt~0 1))))) [2022-10-16 14:10:51,822 INFO L899 garLoopResultBuilder]: For program point L812(lines 812 820) no Hoare annotation was computed. [2022-10-16 14:10:51,822 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 805 822) no Hoare annotation was computed. [2022-10-16 14:10:51,831 INFO L899 garLoopResultBuilder]: For program point L818(line 818) no Hoare annotation was computed. [2022-10-16 14:10:51,831 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 805 822) no Hoare annotation was computed. [2022-10-16 14:10:51,831 INFO L899 garLoopResultBuilder]: For program point device_remove_fileEXIT(lines 1476 1478) no Hoare annotation was computed. [2022-10-16 14:10:51,832 INFO L902 garLoopResultBuilder]: At program point device_remove_fileENTRY(lines 1476 1478) the Hoare annotation is: true [2022-10-16 14:10:51,832 INFO L899 garLoopResultBuilder]: For program point device_remove_fileFINAL(lines 1476 1478) no Hoare annotation was computed. [2022-10-16 14:10:51,832 INFO L899 garLoopResultBuilder]: For program point L1249(line 1249) no Hoare annotation was computed. [2022-10-16 14:10:51,832 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-10-16 14:10:51,832 INFO L899 garLoopResultBuilder]: For program point L1307(line 1307) no Hoare annotation was computed. [2022-10-16 14:10:51,832 INFO L895 garLoopResultBuilder]: At program point L1497(lines 1496 1498) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,833 INFO L899 garLoopResultBuilder]: For program point L1233(line 1233) no Hoare annotation was computed. [2022-10-16 14:10:51,833 INFO L899 garLoopResultBuilder]: For program point L1291(lines 1291 1305) no Hoare annotation was computed. [2022-10-16 14:10:51,833 INFO L899 garLoopResultBuilder]: For program point L1283(lines 1283 1288) no Hoare annotation was computed. [2022-10-16 14:10:51,833 INFO L899 garLoopResultBuilder]: For program point L1250(lines 1250 1259) no Hoare annotation was computed. [2022-10-16 14:10:51,833 INFO L899 garLoopResultBuilder]: For program point L1250-1(lines 1236 1273) no Hoare annotation was computed. [2022-10-16 14:10:51,833 INFO L895 garLoopResultBuilder]: At program point L1217(lines 1210 1219) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,833 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-10-16 14:10:51,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-10-16 14:10:51,834 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-10-16 14:10:51,834 INFO L902 garLoopResultBuilder]: At program point L1308(line 1308) the Hoare annotation is: true [2022-10-16 14:10:51,834 INFO L899 garLoopResultBuilder]: For program point L1242(line 1242) no Hoare annotation was computed. [2022-10-16 14:10:51,834 INFO L899 garLoopResultBuilder]: For program point L1242-1(line 1242) no Hoare annotation was computed. [2022-10-16 14:10:51,834 INFO L899 garLoopResultBuilder]: For program point L1234(lines 1234 1276) no Hoare annotation was computed. [2022-10-16 14:10:51,834 INFO L895 garLoopResultBuilder]: At program point L1317(lines 1225 1322) the Hoare annotation is: (let ((.cse2 (= ~ldv_state_variable_0~0 2)) (.cse0 (= ~ldv_count_1~0 0)) (.cse1 (<= ~probed_1~0 0)) (.cse4 (= ~ldv_state_variable_1~0 0)) (.cse3 (= ~ldv_count_2~0 0))) (or (and (<= ~ref_cnt~0 0) .cse0 .cse1 (<= 0 ~ref_cnt~0) .cse2 .cse3) (and .cse0 (= ~ldv_state_variable_1~0 2) .cse2 (<= 1 ~ref_cnt~0) .cse3 (<= ~ref_cnt~0 1)) (and .cse1 .cse4 .cse2) (and .cse0 .cse1 .cse4 (= ~ref_cnt~0 0) .cse3))) [2022-10-16 14:10:51,835 INFO L895 garLoopResultBuilder]: At program point L1251(line 1251) the Hoare annotation is: false [2022-10-16 14:10:51,835 INFO L899 garLoopResultBuilder]: For program point L1251-1(line 1251) no Hoare annotation was computed. [2022-10-16 14:10:51,835 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1242) no Hoare annotation was computed. [2022-10-16 14:10:51,835 INFO L899 garLoopResultBuilder]: For program point L1293(lines 1293 1297) no Hoare annotation was computed. [2022-10-16 14:10:51,835 INFO L899 garLoopResultBuilder]: For program point L1252(lines 1252 1257) no Hoare annotation was computed. [2022-10-16 14:10:51,835 INFO L902 garLoopResultBuilder]: At program point L1500(lines 1499 1501) the Hoare annotation is: true [2022-10-16 14:10:51,835 INFO L899 garLoopResultBuilder]: For program point L1236(lines 1236 1273) no Hoare annotation was computed. [2022-10-16 14:10:51,835 INFO L895 garLoopResultBuilder]: At program point L1261(line 1261) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (= ~ldv_state_variable_1~0 2) (= ~ldv_state_variable_0~0 2) (<= 1 ~ref_cnt~0) (= ~ldv_count_2~0 0) (<= ~ref_cnt~0 1)) [2022-10-16 14:10:51,836 INFO L899 garLoopResultBuilder]: For program point L1261-1(line 1261) no Hoare annotation was computed. [2022-10-16 14:10:51,836 INFO L899 garLoopResultBuilder]: For program point L1278(line 1278) no Hoare annotation was computed. [2022-10-16 14:10:51,836 INFO L899 garLoopResultBuilder]: For program point L1237(line 1237) no Hoare annotation was computed. [2022-10-16 14:10:51,836 INFO L902 garLoopResultBuilder]: At program point L1295(lines 1225 1322) the Hoare annotation is: true [2022-10-16 14:10:51,836 INFO L899 garLoopResultBuilder]: For program point L1262(lines 1262 1267) no Hoare annotation was computed. [2022-10-16 14:10:51,836 INFO L895 garLoopResultBuilder]: At program point L1452(lines 1449 1454) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,836 INFO L899 garLoopResultBuilder]: For program point L1254(line 1254) no Hoare annotation was computed. [2022-10-16 14:10:51,837 INFO L899 garLoopResultBuilder]: For program point L1254-1(line 1254) no Hoare annotation was computed. [2022-10-16 14:10:51,837 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-10-16 14:10:51,837 INFO L899 garLoopResultBuilder]: For program point L1279(lines 1279 1312) no Hoare annotation was computed. [2022-10-16 14:10:51,837 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-10-16 14:10:51,837 INFO L899 garLoopResultBuilder]: For program point L1271(line 1271) no Hoare annotation was computed. [2022-10-16 14:10:51,837 INFO L899 garLoopResultBuilder]: For program point L1238(lines 1238 1247) no Hoare annotation was computed. [2022-10-16 14:10:51,837 INFO L902 garLoopResultBuilder]: At program point L1486(lines 1485 1487) the Hoare annotation is: true [2022-10-16 14:10:51,837 INFO L902 garLoopResultBuilder]: At program point L1321(lines 1220 1323) the Hoare annotation is: true [2022-10-16 14:10:51,838 INFO L902 garLoopResultBuilder]: At program point L1189(lines 1185 1191) the Hoare annotation is: true [2022-10-16 14:10:51,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-10-16 14:10:51,838 INFO L895 garLoopResultBuilder]: At program point L1214(line 1214) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,838 INFO L899 garLoopResultBuilder]: For program point L1214-1(line 1214) no Hoare annotation was computed. [2022-10-16 14:10:51,838 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1264) no Hoare annotation was computed. [2022-10-16 14:10:51,838 INFO L902 garLoopResultBuilder]: At program point L1272(line 1272) the Hoare annotation is: true [2022-10-16 14:10:51,838 INFO L895 garLoopResultBuilder]: At program point L1239(line 1239) the Hoare annotation is: (and (<= ~ref_cnt~0 0) (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (<= 0 ~ref_cnt~0) (= ~ldv_state_variable_0~0 2) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,839 INFO L899 garLoopResultBuilder]: For program point L1239-1(line 1239) no Hoare annotation was computed. [2022-10-16 14:10:51,839 INFO L899 garLoopResultBuilder]: For program point L1264(line 1264) no Hoare annotation was computed. [2022-10-16 14:10:51,839 INFO L899 garLoopResultBuilder]: For program point L1264-1(line 1264) no Hoare annotation was computed. [2022-10-16 14:10:51,839 INFO L899 garLoopResultBuilder]: For program point L1314(line 1314) no Hoare annotation was computed. [2022-10-16 14:10:51,839 INFO L899 garLoopResultBuilder]: For program point L1281(lines 1281 1309) no Hoare annotation was computed. [2022-10-16 14:10:51,839 INFO L895 garLoopResultBuilder]: At program point L1215(line 1215) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_0~0 2) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,839 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1254) no Hoare annotation was computed. [2022-10-16 14:10:51,839 INFO L895 garLoopResultBuilder]: At program point L1182(lines 1177 1184) the Hoare annotation is: (and (= ~ldv_count_1~0 0) (<= ~probed_1~0 0) (= ~ldv_state_variable_1~0 0) (= ~ref_cnt~0 0) (= ~ldv_count_2~0 0)) [2022-10-16 14:10:51,840 INFO L899 garLoopResultBuilder]: For program point L1215-1(line 1215) no Hoare annotation was computed. [2022-10-16 14:10:51,840 INFO L899 garLoopResultBuilder]: For program point L1240(lines 1240 1245) no Hoare annotation was computed. [2022-10-16 14:10:51,840 INFO L899 garLoopResultBuilder]: For program point L1298(lines 1298 1303) no Hoare annotation was computed. [2022-10-16 14:10:51,840 INFO L899 garLoopResultBuilder]: For program point L1232(lines 1232 1316) no Hoare annotation was computed. [2022-10-16 14:10:51,840 INFO L899 garLoopResultBuilder]: For program point L1290(line 1290) no Hoare annotation was computed. [2022-10-16 14:10:51,840 INFO L902 garLoopResultBuilder]: At program point L1315(line 1315) the Hoare annotation is: true [2022-10-16 14:10:51,840 INFO L899 garLoopResultBuilder]: For program point L1282(line 1282) no Hoare annotation was computed. [2022-10-16 14:10:51,840 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrEXIT(lines 1032 1039) no Hoare annotation was computed. [2022-10-16 14:10:51,841 INFO L902 garLoopResultBuilder]: At program point L1035(line 1035) the Hoare annotation is: true [2022-10-16 14:10:51,841 INFO L902 garLoopResultBuilder]: At program point s3c_hwmon_remove_attrENTRY(lines 1032 1039) the Hoare annotation is: true [2022-10-16 14:10:51,841 INFO L902 garLoopResultBuilder]: At program point L1035-1(line 1035) the Hoare annotation is: true [2022-10-16 14:10:51,841 INFO L899 garLoopResultBuilder]: For program point s3c_hwmon_remove_attrFINAL(lines 1032 1039) no Hoare annotation was computed. [2022-10-16 14:10:51,841 INFO L895 garLoopResultBuilder]: At program point ldv_device_create_fileENTRY(lines 1430 1448) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,841 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-10-16 14:10:51,841 INFO L899 garLoopResultBuilder]: For program point L1437(line 1437) no Hoare annotation was computed. [2022-10-16 14:10:51,841 INFO L899 garLoopResultBuilder]: For program point L1437-1(line 1437) no Hoare annotation was computed. [2022-10-16 14:10:51,842 INFO L895 garLoopResultBuilder]: At program point L1435(line 1435) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,842 INFO L899 garLoopResultBuilder]: For program point L1435-1(line 1435) no Hoare annotation was computed. [2022-10-16 14:10:51,842 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileFINAL(lines 1430 1448) no Hoare annotation was computed. [2022-10-16 14:10:51,842 INFO L899 garLoopResultBuilder]: For program point L1367(line 1367) no Hoare annotation was computed. [2022-10-16 14:10:51,842 INFO L895 garLoopResultBuilder]: At program point L1382(lines 1371 1384) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,842 INFO L899 garLoopResultBuilder]: For program point L1378(lines 1378 1381) no Hoare annotation was computed. [2022-10-16 14:10:51,842 INFO L899 garLoopResultBuilder]: For program point L1378-1(lines 1378 1381) no Hoare annotation was computed. [2022-10-16 14:10:51,843 INFO L895 garLoopResultBuilder]: At program point L1376(line 1376) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= ~ldv_count_2~0 0) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,843 INFO L899 garLoopResultBuilder]: For program point L1376-1(line 1376) no Hoare annotation was computed. [2022-10-16 14:10:51,843 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1437) no Hoare annotation was computed. [2022-10-16 14:10:51,843 INFO L899 garLoopResultBuilder]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2022-10-16 14:10:51,843 INFO L899 garLoopResultBuilder]: For program point ldv_device_create_fileEXIT(lines 1430 1448) no Hoare annotation was computed. [2022-10-16 14:10:51,843 INFO L899 garLoopResultBuilder]: For program point L1436(lines 1436 1446) no Hoare annotation was computed. [2022-10-16 14:10:51,843 INFO L899 garLoopResultBuilder]: For program point L1438-2(lines 1438 1441) no Hoare annotation was computed. [2022-10-16 14:10:51,844 INFO L899 garLoopResultBuilder]: For program point L1364(lines 1364 1370) no Hoare annotation was computed. [2022-10-16 14:10:51,844 INFO L895 garLoopResultBuilder]: At program point L1379(line 1379) the Hoare annotation is: (or (not (<= ~probed_1~0 0)) (not (= ~ldv_state_variable_0~0 2)) (not (= |old(~ldv_count_2~0)| 0)) (not (<= 0 ~ref_cnt~0)) (not (= ~ldv_count_1~0 0)) (= |old(~ldv_count_2~0)| ~ldv_count_2~0) (not (<= ~ref_cnt~0 0))) [2022-10-16 14:10:51,844 INFO L902 garLoopResultBuilder]: At program point IS_ERRENTRY(lines 1332 1339) the Hoare annotation is: true [2022-10-16 14:10:51,844 INFO L899 garLoopResultBuilder]: For program point IS_ERRFINAL(lines 1332 1339) no Hoare annotation was computed. [2022-10-16 14:10:51,844 INFO L902 garLoopResultBuilder]: At program point L1336(line 1336) the Hoare annotation is: true [2022-10-16 14:10:51,844 INFO L899 garLoopResultBuilder]: For program point L1336-1(line 1336) no Hoare annotation was computed. [2022-10-16 14:10:51,844 INFO L899 garLoopResultBuilder]: For program point IS_ERREXIT(lines 1332 1339) no Hoare annotation was computed. [2022-10-16 14:10:51,849 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-10-16 14:10:51,851 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-10-16 14:10:51,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:10:51 BoogieIcfgContainer [2022-10-16 14:10:51,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-10-16 14:10:51,891 INFO L158 Benchmark]: Toolchain (without parser) took 30419.40ms. Allocated memory was 167.8MB in the beginning and 449.8MB in the end (delta: 282.1MB). Free memory was 139.4MB in the beginning and 412.6MB in the end (delta: -273.2MB). Peak memory consumption was 275.1MB. Max. memory is 8.0GB. [2022-10-16 14:10:51,891 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-10-16 14:10:51,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1040.22ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 144.1MB in the end (delta: -5.0MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. [2022-10-16 14:10:51,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 116.95ms. Allocated memory is still 167.8MB. Free memory was 144.1MB in the beginning and 139.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2022-10-16 14:10:51,894 INFO L158 Benchmark]: Boogie Preprocessor took 103.93ms. Allocated memory is still 167.8MB. Free memory was 139.9MB in the beginning and 136.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-10-16 14:10:51,894 INFO L158 Benchmark]: RCFGBuilder took 1095.31ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 91.2MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. [2022-10-16 14:10:51,895 INFO L158 Benchmark]: TraceAbstraction took 28043.55ms. Allocated memory was 167.8MB in the beginning and 449.8MB in the end (delta: 282.1MB). Free memory was 90.6MB in the beginning and 412.6MB in the end (delta: -322.0MB). Peak memory consumption was 224.9MB. Max. memory is 8.0GB. [2022-10-16 14:10:51,898 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 167.8MB. Free memory is still 137.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 1040.22ms. Allocated memory is still 167.8MB. Free memory was 139.2MB in the beginning and 144.1MB in the end (delta: -5.0MB). Peak memory consumption was 33.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 116.95ms. Allocated memory is still 167.8MB. Free memory was 144.1MB in the beginning and 139.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.93ms. Allocated memory is still 167.8MB. Free memory was 139.9MB in the beginning and 136.3MB in the end (delta: 3.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1095.31ms. Allocated memory is still 167.8MB. Free memory was 136.3MB in the beginning and 91.2MB in the end (delta: 45.1MB). Peak memory consumption was 45.1MB. Max. memory is 8.0GB. * TraceAbstraction took 28043.55ms. Allocated memory was 167.8MB in the beginning and 449.8MB in the end (delta: 282.1MB). Free memory was 90.6MB in the beginning and 412.6MB in the end (delta: -322.0MB). Peak memory consumption was 224.9MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1118]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1122]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1132]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1163]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1242]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1254]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1264]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1437]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 18 procedures, 235 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4226 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4003 mSDsluCounter, 11873 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7046 mSDsCounter, 1557 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3067 IncrementalHoareTripleChecker+Invalid, 4624 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1557 mSolverCounterUnsat, 4827 mSDtfsCounter, 3067 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1713 GetRequests, 1609 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1319occurred in iteration=11, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 1587 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 89 LocationsWithAnnotation, 2777 PreInvPairs, 2957 NumberOfFragments, 1794 HoareAnnotationTreeSize, 2777 FomulaSimplifications, 134605 FormulaSimplificationTreeSizeReduction, 4.9s HoareSimplificationTime, 89 FomulaSimplificationsInter, 43914 FormulaSimplificationTreeSizeReductionInter, 4.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2487 NumberOfCodeBlocks, 2487 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2807 ConstructedInterpolants, 0 QuantifiedInterpolants, 5069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 6710 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 29 InterpolantComputations, 14 PerfectInterpolantSequences, 737/807 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 934]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1449]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 823]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || (1 <= i && i <= 2147483646)) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || !(ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 1) - InvariantResult [Line: 1185]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((0 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1506]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1371]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0) || !(ref_cnt <= 0) - InvariantResult [Line: 1469]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1356]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1397]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1220]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1479]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1462]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || ((i == 0 || (1 <= i && i < 2147483646)) && ldv_count_2 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1155]: Loop Invariant Derived loop invariant: ((((((!(ldv_state_variable_0 == 2) || i == 0) || !(ldv_state_variable_1 == 2)) || !(1 <= ref_cnt)) || (1 <= i && i < 2147483646)) || !(ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 1) - InvariantResult [Line: 876]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1499]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1455]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(ref_cnt == 0)) || ((1 <= i && i <= 2147483646) && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0) - InvariantResult [Line: 1348]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 903]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i <= 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1340]: Loop Invariant Derived loop invariant: ((((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i == 0 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || ((1 <= i && i < 2147483646) && ldv_count_2 == 0)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1115]: Loop Invariant Derived loop invariant: (((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || (i < 2147483646 && ldv_count_2 == 0)) || !(\old(ldv_count_2) == 0)) || !(0 <= ref_cnt)) || !(ldv_count_1 == 0)) || !(ref_cnt <= 0) - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1053]: Loop Invariant Derived loop invariant: ((((!(probed_1 <= 0) || !(ldv_state_variable_0 == 2)) || !(ref_cnt == 0)) || !(\old(ldv_count_2) == 0)) || !(ldv_count_1 == 0)) || ldv_count_2 == 0 - InvariantResult [Line: 1496]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1177]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1225]: Loop Invariant Derived loop invariant: (((((((ref_cnt <= 0 && ldv_count_1 == 0) && probed_1 <= 0) && 0 <= ref_cnt) && ldv_state_variable_0 == 2) && ldv_count_2 == 0) || (((((ldv_count_1 == 0 && ldv_state_variable_1 == 2) && ldv_state_variable_0 == 2) && 1 <= ref_cnt) && ldv_count_2 == 0) && ref_cnt <= 1)) || ((probed_1 <= 0 && ldv_state_variable_1 == 0) && ldv_state_variable_0 == 2)) || ((((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_1 == 0) && ref_cnt == 0) && ldv_count_2 == 0) - InvariantResult [Line: 1210]: Loop Invariant Derived loop invariant: (((ldv_count_1 == 0 && probed_1 <= 0) && ldv_state_variable_0 == 2) && ref_cnt == 0) && ldv_count_2 == 0 - InvariantResult [Line: 1485]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-10-16 14:10:51,961 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...