./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 4083bfcd7db6f77d1df429f19c85907b2c08abb35764175570b1e2ec14e31561 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:53,516 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:53,578 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2025-03-04 11:35:53,584 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:53,584 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:53,608 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:53,609 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:53,609 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:53,610 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:53,610 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:53,610 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:53,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:53,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:53,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:53,611 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:53,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:53,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:53,611 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:53,611 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:53,612 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:53,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:53,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:53,613 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4083bfcd7db6f77d1df429f19c85907b2c08abb35764175570b1e2ec14e31561 [2025-03-04 11:35:53,830 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:53,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:53,839 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:53,839 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:53,840 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:53,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i [2025-03-04 11:35:54,988 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003401597/4ee4f18728c9400592ef2fbca9c8faba/FLAG2de712ddd [2025-03-04 11:35:55,247 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:55,249 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i [2025-03-04 11:35:55,263 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003401597/4ee4f18728c9400592ef2fbca9c8faba/FLAG2de712ddd [2025-03-04 11:35:55,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/003401597/4ee4f18728c9400592ef2fbca9c8faba [2025-03-04 11:35:55,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:55,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:55,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:55,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:55,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:55,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:55,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@658be099 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55, skipping insertion in model container [2025-03-04 11:35:55,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:55,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:55,819 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:55,827 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:55,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:55,931 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:55,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55 WrapperNode [2025-03-04 11:35:55,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:55,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:55,932 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:55,932 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:55,936 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:55,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:55,974 INFO L138 Inliner]: procedures = 76, calls = 162, calls flagged for inlining = 36, calls inlined = 31, statements flattened = 534 [2025-03-04 11:35:55,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:55,975 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:55,975 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:55,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:55,981 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:55,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:55,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,015 INFO L175 MemorySlicer]: Split 54 memory accesses to 7 slices as follows [2, 4, 2, 20, 1, 3, 22]. 41 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4, 0, 0, 0, 0, 0]. The 34 writes are split as follows [0, 0, 0, 12, 0, 0, 22]. [2025-03-04 11:35:56,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,033 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:56,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:56,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:56,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:56,058 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (1/1) ... [2025-03-04 11:35:56,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:56,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:56,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 11:35:56,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 11:35:56,103 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2025-03-04 11:35:56,105 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2025-03-04 11:35:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:56,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 11:35:56,106 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2025-03-04 11:35:56,107 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-03-04 11:35:56,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 11:35:56,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2025-03-04 11:35:56,107 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2025-03-04 11:35:56,107 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2025-03-04 11:35:56,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-03-04 11:35:56,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-03-04 11:35:56,108 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-03-04 11:35:56,109 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-03-04 11:35:56,109 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2025-03-04 11:35:56,109 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:35:56,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2025-03-04 11:35:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-03-04 11:35:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:56,110 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-03-04 11:35:56,110 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-03-04 11:35:56,305 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:56,306 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:56,367 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L839: havoc ~res~0#1.base, ~res~0#1.offset; [2025-03-04 11:35:56,384 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1356: havoc dev_get_drvdata_#t~ret121#1.base, dev_get_drvdata_#t~ret121#1.offset; [2025-03-04 11:35:56,406 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1353: havoc #t~nondet120; [2025-03-04 11:35:57,435 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1373: havoc hwmon_device_register_#t~ret124#1.base, hwmon_device_register_#t~ret124#1.offset; [2025-03-04 11:35:57,435 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1409: havoc s3c_adc_register_#t~ret128#1.base, s3c_adc_register_#t~ret128#1.offset; [2025-03-04 11:35:57,436 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L849: havoc __kmalloc_#t~ret27#1.base, __kmalloc_#t~ret27#1.offset; [2025-03-04 11:35:57,436 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1399: havoc platform_driver_register_#t~nondet126#1; [2025-03-04 11:35:57,436 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1367: havoc dev_warn_#t~nondet123#1; [2025-03-04 11:35:57,436 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1025: call ULTIMATE.dealloc(s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset);havoc s3c_hwmon_probe_~#__key~0#1.base, s3c_hwmon_probe_~#__key~0#1.offset; [2025-03-04 11:35:57,487 INFO L? ?]: Removed 251 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:57,487 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:57,500 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:57,500 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:57,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:57 BoogieIcfgContainer [2025-03-04 11:35:57,501 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:57,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:57,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:57,507 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:57,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:55" (1/3) ... [2025-03-04 11:35:57,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603c61f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:57, skipping insertion in model container [2025-03-04 11:35:57,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:55" (2/3) ... [2025-03-04 11:35:57,508 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@603c61f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:57, skipping insertion in model container [2025-03-04 11:35:57,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:57" (3/3) ... [2025-03-04 11:35:57,508 INFO L128 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i [2025-03-04 11:35:57,521 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:57,522 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i that has 14 procedures, 204 locations, 1 initial locations, 2 loop locations, and 12 error locations. [2025-03-04 11:35:57,557 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:57,566 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@22199b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:57,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-04 11:35:57,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 158 states have internal predecessors, (187), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2025-03-04 11:35:57,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-04 11:35:57,577 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:57,577 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:57,578 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:35:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:57,582 INFO L85 PathProgramCache]: Analyzing trace with hash -178709059, now seen corresponding path program 1 times [2025-03-04 11:35:57,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:57,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867582671] [2025-03-04 11:35:57,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:57,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:57,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-04 11:35:57,765 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-04 11:35:57,765 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:57,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:57,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:57,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:57,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867582671] [2025-03-04 11:35:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867582671] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:57,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:57,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970549832] [2025-03-04 11:35:57,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:57,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:57,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:57,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:57,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:57,993 INFO L87 Difference]: Start difference. First operand has 204 states, 143 states have (on average 1.3076923076923077) internal successors, (187), 158 states have internal predecessors, (187), 35 states have call successors, (35), 13 states have call predecessors, (35), 13 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:35:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:58,055 INFO L93 Difference]: Finished difference Result 412 states and 532 transitions. [2025-03-04 11:35:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:58,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-03-04 11:35:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:58,065 INFO L225 Difference]: With dead ends: 412 [2025-03-04 11:35:58,066 INFO L226 Difference]: Without dead ends: 198 [2025-03-04 11:35:58,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:58,070 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 99 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:58,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 366 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:58,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2025-03-04 11:35:58,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2025-03-04 11:35:58,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 141 states have (on average 1.2695035460992907) internal successors, (179), 153 states have internal predecessors, (179), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2025-03-04 11:35:58,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 247 transitions. [2025-03-04 11:35:58,111 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 247 transitions. Word has length 26 [2025-03-04 11:35:58,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:58,112 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 247 transitions. [2025-03-04 11:35:58,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-04 11:35:58,113 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 247 transitions. [2025-03-04 11:35:58,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:35:58,116 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:58,116 INFO L218 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, 1, 1] [2025-03-04 11:35:58,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:35:58,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:35:58,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1743121787, now seen corresponding path program 1 times [2025-03-04 11:35:58,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:58,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382943849] [2025-03-04 11:35:58,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:58,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:58,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-04 11:35:58,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-04 11:35:58,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:58,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-04 11:35:58,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:58,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382943849] [2025-03-04 11:35:58,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382943849] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:58,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:58,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:58,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292691098] [2025-03-04 11:35:58,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:58,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:58,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:58,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:58,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:58,358 INFO L87 Difference]: Start difference. First operand 198 states and 247 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:35:58,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:58,414 INFO L93 Difference]: Finished difference Result 392 states and 489 transitions. [2025-03-04 11:35:58,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:58,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 68 [2025-03-04 11:35:58,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:58,417 INFO L225 Difference]: With dead ends: 392 [2025-03-04 11:35:58,418 INFO L226 Difference]: Without dead ends: 194 [2025-03-04 11:35:58,419 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:58,420 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 0 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:58,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 689 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:58,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-03-04 11:35:58,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-03-04 11:35:58,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 139 states have (on average 1.2589928057553956) internal successors, (175), 151 states have internal predecessors, (175), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-03-04 11:35:58,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 239 transitions. [2025-03-04 11:35:58,437 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 239 transitions. Word has length 68 [2025-03-04 11:35:58,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:58,438 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 239 transitions. [2025-03-04 11:35:58,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-04 11:35:58,438 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 239 transitions. [2025-03-04 11:35:58,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-03-04 11:35:58,441 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:58,441 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 11:35:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 11:35:58,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:35:58,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2014987646, now seen corresponding path program 1 times [2025-03-04 11:35:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824999174] [2025-03-04 11:35:58,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:58,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-04 11:35:58,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-04 11:35:58,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:58,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:58,648 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:35:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:58,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824999174] [2025-03-04 11:35:58,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824999174] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:58,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:58,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467113242] [2025-03-04 11:35:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:58,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:58,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:58,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:58,649 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:58,649 INFO L87 Difference]: Start difference. First operand 194 states and 239 transitions. Second operand has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:35:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:58,707 INFO L93 Difference]: Finished difference Result 414 states and 524 transitions. [2025-03-04 11:35:58,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:58,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 73 [2025-03-04 11:35:58,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:58,710 INFO L225 Difference]: With dead ends: 414 [2025-03-04 11:35:58,710 INFO L226 Difference]: Without dead ends: 228 [2025-03-04 11:35:58,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:58,711 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 31 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:58,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 426 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:58,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2025-03-04 11:35:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2025-03-04 11:35:58,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 166 states have (on average 1.2710843373493976) internal successors, (211), 178 states have internal predecessors, (211), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 11:35:58,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 289 transitions. [2025-03-04 11:35:58,733 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 289 transitions. Word has length 73 [2025-03-04 11:35:58,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:58,734 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 289 transitions. [2025-03-04 11:35:58,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.0) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:35:58,734 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 289 transitions. [2025-03-04 11:35:58,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-04 11:35:58,736 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:58,736 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 11:35:58,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 11:35:58,736 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:35:58,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:58,736 INFO L85 PathProgramCache]: Analyzing trace with hash -397407411, now seen corresponding path program 1 times [2025-03-04 11:35:58,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:58,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049384352] [2025-03-04 11:35:58,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:58,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:58,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:35:58,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:35:58,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:58,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:58,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:35:58,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:58,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049384352] [2025-03-04 11:35:58,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049384352] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:58,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [282168558] [2025-03-04 11:35:58,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:58,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:58,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:58,953 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) [2025-03-04 11:35:58,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 11:35:59,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-04 11:35:59,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-04 11:35:59,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:59,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:59,239 INFO L256 TraceCheckSpWp]: Trace formula consists of 708 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:59,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:35:59,280 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:59,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [282168558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:59,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:59,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:35:59,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2185083] [2025-03-04 11:35:59,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:59,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:59,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:59,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:59,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:59,281 INFO L87 Difference]: Start difference. First operand 228 states and 289 transitions. Second operand has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:35:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:59,367 INFO L93 Difference]: Finished difference Result 446 states and 571 transitions. [2025-03-04 11:35:59,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:59,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 78 [2025-03-04 11:35:59,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:59,370 INFO L225 Difference]: With dead ends: 446 [2025-03-04 11:35:59,371 INFO L226 Difference]: Without dead ends: 226 [2025-03-04 11:35:59,371 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:59,372 INFO L435 NwaCegarLoop]: 251 mSDtfsCounter, 63 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:59,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 455 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:59,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-03-04 11:35:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-03-04 11:35:59,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 167 states have (on average 1.251497005988024) internal successors, (209), 176 states have internal predecessors, (209), 39 states have call successors, (39), 13 states have call predecessors, (39), 13 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-04 11:35:59,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 287 transitions. [2025-03-04 11:35:59,395 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 287 transitions. Word has length 78 [2025-03-04 11:35:59,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:59,395 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 287 transitions. [2025-03-04 11:35:59,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.0) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:35:59,396 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 287 transitions. [2025-03-04 11:35:59,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-04 11:35:59,398 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:59,398 INFO L218 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] [2025-03-04 11:35:59,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:59,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:59,599 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:35:59,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:59,600 INFO L85 PathProgramCache]: Analyzing trace with hash 565272250, now seen corresponding path program 1 times [2025-03-04 11:35:59,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:59,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728685739] [2025-03-04 11:35:59,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:59,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 11:35:59,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 11:35:59,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:59,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:59,769 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:35:59,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728685739] [2025-03-04 11:35:59,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728685739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:59,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575646571] [2025-03-04 11:35:59,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:59,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:59,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:59,772 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) [2025-03-04 11:35:59,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 11:35:59,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-03-04 11:36:00,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-03-04 11:36:00,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:00,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:00,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 709 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:00,030 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:00,058 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:36:00,058 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:36:00,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575646571] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:00,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:00,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177805953] [2025-03-04 11:36:00,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:00,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:00,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:00,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:00,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:00,117 INFO L87 Difference]: Start difference. First operand 226 states and 287 transitions. Second operand has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:36:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:00,221 INFO L93 Difference]: Finished difference Result 266 states and 350 transitions. [2025-03-04 11:36:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:36:00,222 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 79 [2025-03-04 11:36:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:00,223 INFO L225 Difference]: With dead ends: 266 [2025-03-04 11:36:00,224 INFO L226 Difference]: Without dead ends: 263 [2025-03-04 11:36:00,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:00,224 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 252 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:00,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 465 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:36:00,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-03-04 11:36:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 219. [2025-03-04 11:36:00,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 164 states have (on average 1.2378048780487805) internal successors, (203), 170 states have internal predecessors, (203), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 11:36:00,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 279 transitions. [2025-03-04 11:36:00,236 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 279 transitions. Word has length 79 [2025-03-04 11:36:00,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:00,236 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 279 transitions. [2025-03-04 11:36:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.5) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2025-03-04 11:36:00,236 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 279 transitions. [2025-03-04 11:36:00,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-03-04 11:36:00,237 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:00,237 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 11:36:00,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 11:36:00,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:00,438 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:36:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1600019788, now seen corresponding path program 1 times [2025-03-04 11:36:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691349964] [2025-03-04 11:36:00,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:00,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:00,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 11:36:00,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 11:36:00,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:00,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:36:00,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:00,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691349964] [2025-03-04 11:36:00,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691349964] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:00,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:00,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:00,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886528701] [2025-03-04 11:36:00,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:00,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:00,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:00,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:00,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:00,630 INFO L87 Difference]: Start difference. First operand 219 states and 279 transitions. Second operand has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:36:00,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:00,642 INFO L93 Difference]: Finished difference Result 219 states and 279 transitions. [2025-03-04 11:36:00,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:00,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 80 [2025-03-04 11:36:00,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:00,645 INFO L225 Difference]: With dead ends: 219 [2025-03-04 11:36:00,646 INFO L226 Difference]: Without dead ends: 218 [2025-03-04 11:36:00,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:00,648 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 170 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:00,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 215 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:00,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2025-03-04 11:36:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2025-03-04 11:36:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 164 states have (on average 1.2317073170731707) internal successors, (202), 169 states have internal predecessors, (202), 38 states have call successors, (38), 13 states have call predecessors, (38), 13 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 11:36:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 278 transitions. [2025-03-04 11:36:00,657 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 278 transitions. Word has length 80 [2025-03-04 11:36:00,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:00,657 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 278 transitions. [2025-03-04 11:36:00,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.0) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:36:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 278 transitions. [2025-03-04 11:36:00,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-03-04 11:36:00,658 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:00,658 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-04 11:36:00,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 11:36:00,658 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:36:00,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1938994117, now seen corresponding path program 1 times [2025-03-04 11:36:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:00,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055725301] [2025-03-04 11:36:00,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:00,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-04 11:36:00,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-04 11:36:00,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:00,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:00,847 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:36:00,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:00,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055725301] [2025-03-04 11:36:00,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055725301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:00,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:00,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:00,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081129694] [2025-03-04 11:36:00,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:00,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:00,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:00,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:00,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:00,849 INFO L87 Difference]: Start difference. First operand 218 states and 278 transitions. Second operand has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:36:00,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:00,873 INFO L93 Difference]: Finished difference Result 427 states and 550 transitions. [2025-03-04 11:36:00,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:00,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 81 [2025-03-04 11:36:00,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:00,877 INFO L225 Difference]: With dead ends: 427 [2025-03-04 11:36:00,877 INFO L226 Difference]: Without dead ends: 426 [2025-03-04 11:36:00,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:00,878 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 167 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:00,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 439 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-03-04 11:36:00,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 424. [2025-03-04 11:36:00,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 320 states have (on average 1.234375) internal successors, (395), 328 states have internal predecessors, (395), 75 states have call successors, (75), 26 states have call predecessors, (75), 26 states have return successors, (79), 75 states have call predecessors, (79), 75 states have call successors, (79) [2025-03-04 11:36:00,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 549 transitions. [2025-03-04 11:36:00,895 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 549 transitions. Word has length 81 [2025-03-04 11:36:00,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:00,895 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 549 transitions. [2025-03-04 11:36:00,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 26.5) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-04 11:36:00,895 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 549 transitions. [2025-03-04 11:36:00,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-03-04 11:36:00,896 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:00,896 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2025-03-04 11:36:00,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 11:36:00,896 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:36:00,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:00,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1783701698, now seen corresponding path program 1 times [2025-03-04 11:36:00,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:00,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324357891] [2025-03-04 11:36:00,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:00,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:00,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-04 11:36:00,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-04 11:36:00,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:00,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:01,043 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-04 11:36:01,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:01,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324357891] [2025-03-04 11:36:01,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324357891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:01,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:01,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:36:01,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801262064] [2025-03-04 11:36:01,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:01,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:01,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:01,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:01,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:01,044 INFO L87 Difference]: Start difference. First operand 424 states and 549 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 11:36:01,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:01,856 INFO L93 Difference]: Finished difference Result 633 states and 819 transitions. [2025-03-04 11:36:01,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:01,857 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 95 [2025-03-04 11:36:01,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:01,859 INFO L225 Difference]: With dead ends: 633 [2025-03-04 11:36:01,859 INFO L226 Difference]: Without dead ends: 423 [2025-03-04 11:36:01,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:01,861 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 197 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:01,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 621 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-04 11:36:01,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2025-03-04 11:36:01,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 421. [2025-03-04 11:36:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 318 states have (on average 1.229559748427673) internal successors, (391), 325 states have internal predecessors, (391), 75 states have call successors, (75), 26 states have call predecessors, (75), 26 states have return successors, (79), 75 states have call predecessors, (79), 75 states have call successors, (79) [2025-03-04 11:36:01,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 545 transitions. [2025-03-04 11:36:01,885 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 545 transitions. Word has length 95 [2025-03-04 11:36:01,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:01,885 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 545 transitions. [2025-03-04 11:36:01,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2025-03-04 11:36:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 545 transitions. [2025-03-04 11:36:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-04 11:36:01,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:01,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:01,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:36:01,887 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:36:01,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:01,887 INFO L85 PathProgramCache]: Analyzing trace with hash 670780109, now seen corresponding path program 1 times [2025-03-04 11:36:01,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:01,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040465922] [2025-03-04 11:36:01,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:01,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:01,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 11:36:01,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 11:36:01,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:01,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-04 11:36:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040465922] [2025-03-04 11:36:01,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040465922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:01,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:01,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:36:01,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033500601] [2025-03-04 11:36:01,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:01,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:01,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:36:01,990 INFO L87 Difference]: Start difference. First operand 421 states and 545 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:36:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:02,038 INFO L93 Difference]: Finished difference Result 834 states and 1081 transitions. [2025-03-04 11:36:02,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:02,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 105 [2025-03-04 11:36:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:02,041 INFO L225 Difference]: With dead ends: 834 [2025-03-04 11:36:02,041 INFO L226 Difference]: Without dead ends: 421 [2025-03-04 11:36:02,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:36:02,042 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:02,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 637 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2025-03-04 11:36:02,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2025-03-04 11:36:02,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 318 states have (on average 1.2232704402515724) internal successors, (389), 323 states have internal predecessors, (389), 75 states have call successors, (75), 26 states have call predecessors, (75), 26 states have return successors, (79), 75 states have call predecessors, (79), 75 states have call successors, (79) [2025-03-04 11:36:02,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 543 transitions. [2025-03-04 11:36:02,061 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 543 transitions. Word has length 105 [2025-03-04 11:36:02,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:02,061 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 543 transitions. [2025-03-04 11:36:02,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-04 11:36:02,061 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 543 transitions. [2025-03-04 11:36:02,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-04 11:36:02,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:02,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:02,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 11:36:02,063 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:36:02,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:02,063 INFO L85 PathProgramCache]: Analyzing trace with hash -193136607, now seen corresponding path program 1 times [2025-03-04 11:36:02,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:02,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165733331] [2025-03-04 11:36:02,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:02,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:02,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-04 11:36:02,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-04 11:36:02,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:02,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:02,176 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-04 11:36:02,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:02,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165733331] [2025-03-04 11:36:02,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165733331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:02,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:36:02,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:36:02,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388112037] [2025-03-04 11:36:02,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:02,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:36:02,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:02,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:36:02,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:02,178 INFO L87 Difference]: Start difference. First operand 421 states and 543 transitions. Second operand has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 11:36:02,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:02,215 INFO L93 Difference]: Finished difference Result 842 states and 1093 transitions. [2025-03-04 11:36:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:36:02,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2025-03-04 11:36:02,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:02,219 INFO L225 Difference]: With dead ends: 842 [2025-03-04 11:36:02,219 INFO L226 Difference]: Without dead ends: 429 [2025-03-04 11:36:02,221 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:36:02,221 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:02,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-04 11:36:02,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-03-04 11:36:02,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 324 states have (on average 1.2191358024691359) internal successors, (395), 329 states have internal predecessors, (395), 77 states have call successors, (77), 26 states have call predecessors, (77), 26 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) [2025-03-04 11:36:02,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 553 transitions. [2025-03-04 11:36:02,240 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 553 transitions. Word has length 109 [2025-03-04 11:36:02,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:02,240 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 553 transitions. [2025-03-04 11:36:02,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 34.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-04 11:36:02,240 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 553 transitions. [2025-03-04 11:36:02,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-04 11:36:02,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:02,242 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:02,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:36:02,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:36:02,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:02,243 INFO L85 PathProgramCache]: Analyzing trace with hash 622350909, now seen corresponding path program 1 times [2025-03-04 11:36:02,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:02,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361671389] [2025-03-04 11:36:02,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:02,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:02,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:36:02,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:36:02,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:02,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:02,377 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 11:36:02,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361671389] [2025-03-04 11:36:02,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361671389] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:02,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322019991] [2025-03-04 11:36:02,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:02,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:02,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:02,379 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) [2025-03-04 11:36:02,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 11:36:02,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-04 11:36:02,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-04 11:36:02,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:02,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:02,720 INFO L256 TraceCheckSpWp]: Trace formula consists of 907 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:02,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 11:36:02,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:36:02,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322019991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:36:02,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:36:02,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:36:02,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048321379] [2025-03-04 11:36:02,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:36:02,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:36:02,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:02,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:36:02,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:02,757 INFO L87 Difference]: Start difference. First operand 429 states and 553 transitions. Second operand has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 11:36:02,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:02,810 INFO L93 Difference]: Finished difference Result 429 states and 553 transitions. [2025-03-04 11:36:02,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:36:02,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-03-04 11:36:02,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:02,813 INFO L225 Difference]: With dead ends: 429 [2025-03-04 11:36:02,813 INFO L226 Difference]: Without dead ends: 428 [2025-03-04 11:36:02,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:36:02,814 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:02,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 629 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:02,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-03-04 11:36:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-03-04 11:36:02,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 324 states have (on average 1.212962962962963) internal successors, (393), 328 states have internal predecessors, (393), 77 states have call successors, (77), 26 states have call predecessors, (77), 26 states have return successors, (81), 77 states have call predecessors, (81), 77 states have call successors, (81) [2025-03-04 11:36:02,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 551 transitions. [2025-03-04 11:36:02,835 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 551 transitions. Word has length 124 [2025-03-04 11:36:02,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:02,835 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 551 transitions. [2025-03-04 11:36:02,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 24.0) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 11:36:02,835 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 551 transitions. [2025-03-04 11:36:02,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-04 11:36:02,837 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:02,838 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:02,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 11:36:03,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:03,038 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 11:36:03,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:03,039 INFO L85 PathProgramCache]: Analyzing trace with hash 2113009052, now seen corresponding path program 1 times [2025-03-04 11:36:03,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:03,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763681801] [2025-03-04 11:36:03,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:03,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:03,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 11:36:03,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 11:36:03,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:03,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:03,172 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 11:36:03,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:36:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763681801] [2025-03-04 11:36:03,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763681801] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:36:03,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429433271] [2025-03-04 11:36:03,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:03,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:03,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:36:03,175 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) [2025-03-04 11:36:03,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:36:03,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-04 11:36:03,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-04 11:36:03,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:03,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:36:03,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 908 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:36:03,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:36:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 11:36:03,542 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:36:03,634 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-03-04 11:36:03,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429433271] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:36:03,634 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:36:03,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2025-03-04 11:36:03,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290764193] [2025-03-04 11:36:03,635 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:36:03,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:36:03,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:36:03,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:36:03,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:03,636 INFO L87 Difference]: Start difference. First operand 428 states and 551 transitions. Second operand has 7 states, 6 states have (on average 14.0) internal successors, (84), 7 states have internal predecessors, (84), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:36:03,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:03,677 INFO L93 Difference]: Finished difference Result 438 states and 569 transitions. [2025-03-04 11:36:03,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:36:03,678 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 7 states have internal predecessors, (84), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 125 [2025-03-04 11:36:03,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:03,678 INFO L225 Difference]: With dead ends: 438 [2025-03-04 11:36:03,678 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 11:36:03,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 246 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:36:03,679 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:03,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1039 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:36:03,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 11:36:03,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 11:36:03,680 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) [2025-03-04 11:36:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 11:36:03,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 125 [2025-03-04 11:36:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 11:36:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.0) internal successors, (84), 7 states have internal predecessors, (84), 6 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2025-03-04 11:36:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 11:36:03,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 11:36:03,682 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2025-03-04 11:36:03,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2025-03-04 11:36:03,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 11:36:03,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:36:03,886 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:03,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 11:36:05,150 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:36:05,157 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,159 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2025-03-04 11:36:05,162 WARN L970 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2025-03-04 11:36:05,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:36:05 BoogieIcfgContainer [2025-03-04 11:36:05,162 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:36:05,163 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:36:05,163 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:36:05,163 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:36:05,164 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:57" (3/4) ... [2025-03-04 11:36:05,165 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2025-03-04 11:36:05,169 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-03-04 11:36:05,179 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 64 nodes and edges [2025-03-04 11:36:05,181 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-03-04 11:36:05,181 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-04 11:36:05,182 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-04 11:36:05,182 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 11:36:05,276 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:36:05,276 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:36:05,276 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:36:05,277 INFO L158 Benchmark]: Toolchain (without parser) took 9724.52ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 111.8MB in the beginning and 331.0MB in the end (delta: -219.2MB). Peak memory consumption was 61.6MB. Max. memory is 16.1GB. [2025-03-04 11:36:05,277 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:05,278 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.80ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 83.3MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:05,278 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:05,278 INFO L158 Benchmark]: Boogie Preprocessor took 82.22ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 71.1MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:05,279 INFO L158 Benchmark]: IcfgBuilder took 1443.48ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 85.4MB in the end (delta: -14.3MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. [2025-03-04 11:36:05,279 INFO L158 Benchmark]: TraceAbstraction took 7659.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.7MB in the beginning and 343.3MB in the end (delta: -258.6MB). Peak memory consumption was 229.9MB. Max. memory is 16.1GB. [2025-03-04 11:36:05,279 INFO L158 Benchmark]: Witness Printer took 113.09ms. Allocated memory is still 427.8MB. Free memory was 343.3MB in the beginning and 331.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:05,281 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.48ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.80ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 83.3MB in the end (delta: 28.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.31ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 79.0MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.22ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 71.1MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1443.48ms. Allocated memory is still 142.6MB. Free memory was 71.1MB in the beginning and 85.4MB in the end (delta: -14.3MB). Peak memory consumption was 43.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7659.76ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 84.7MB in the beginning and 343.3MB in the end (delta: -258.6MB). Peak memory consumption was 229.9MB. Max. memory is 16.1GB. * Witness Printer took 113.09ms. Allocated memory is still 427.8MB. Free memory was 343.3MB in the beginning and 331.0MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~i~0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 * 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: 1331]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1331]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1139]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1139]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1206]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1206]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1098]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1098]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1094]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1094]: 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 14 procedures, 204 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1048 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 981 mSDsluCounter, 6403 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3534 mSDsCounter, 81 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 277 IncrementalHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 81 mSolverCounterUnsat, 2869 mSDtfsCounter, 277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 640 GetRequests, 614 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=429occurred in iteration=10, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 48 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1449 NumberOfCodeBlocks, 1449 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1635 ConstructedInterpolants, 0 QuantifiedInterpolants, 2097 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3232 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 447/481 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 993]: Location Invariant Derived location invariant: ((((ldv_count_2 == 0) || (ldv_count_2 == 0)) || ((0 <= ldv_count_2) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) || ((0 <= ldv_count_2) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) - InvariantResult [Line: 980]: Location Invariant Derived location invariant: ((((ldv_count_2 == 0) || (ldv_count_2 == 0)) || ((0 <= ldv_count_2) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) || ((0 <= ldv_count_2) && (ldv_call_dev_attr_of_sensor_device_attribute == 1))) RESULT: Ultimate proved your program to be correct! [2025-03-04 11:36:05,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE