./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-overflow.prp --file /storage/repos/ultimate/releaseScripts/default/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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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.2.5-dev-84cfde4 [2024-10-11 21:21:16,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 21:21:16,440 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2024-10-11 21:21:16,447 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 21:21:16,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 21:21:16,486 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 21:21:16,487 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 21:21:16,487 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 21:21:16,488 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 21:21:16,488 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 21:21:16,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 21:21:16,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 21:21:16,490 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 21:21:16,490 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 21:21:16,490 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 21:21:16,491 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 21:21:16,491 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 21:21:16,492 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 21:21:16,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 21:21:16,492 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 21:21:16,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 21:21:16,493 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 21:21:16,494 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 21:21:16,494 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-10-11 21:21:16,494 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 21:21:16,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 21:21:16,495 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 21:21:16,495 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 21:21:16,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 21:21:16,496 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 21:21:16,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 21:21:16,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:16,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 21:21:16,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 21:21:16,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 21:21:16,497 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 21:21:16,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 21:21:16,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 21:21:16,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 21:21:16,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 21:21:16,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 21:21:16,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/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 [2024-10-11 21:21:16,772 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 21:21:16,798 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 21:21:16,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 21:21:16,804 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 21:21:16,804 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 21:21:16,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-commit-tester/m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i [2024-10-11 21:21:18,263 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 21:21:18,577 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 21:21:18,578 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 [2024-10-11 21:21:18,602 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b2002c97/84c938691d6740969affb737f29cd2a0/FLAG9c893d717 [2024-10-11 21:21:18,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6b2002c97/84c938691d6740969affb737f29cd2a0 [2024-10-11 21:21:18,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 21:21:18,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 21:21:18,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:18,629 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 21:21:18,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 21:21:18,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:18" (1/1) ... [2024-10-11 21:21:18,636 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1061912f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:18, skipping insertion in model container [2024-10-11 21:21:18,636 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 09:21:18" (1/1) ... [2024-10-11 21:21:18,696 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 21:21:19,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:19,193 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 21:21:19,287 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 21:21:19,328 INFO L204 MainTranslator]: Completed translation [2024-10-11 21:21:19,328 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19 WrapperNode [2024-10-11 21:21:19,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 21:21:19,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:19,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 21:21:19,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 21:21:19,338 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,468 INFO L138 Inliner]: procedures = 75, calls = 162, calls flagged for inlining = 36, calls inlined = 31, statements flattened = 552 [2024-10-11 21:21:19,472 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 21:21:19,473 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 21:21:19,473 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 21:21:19,473 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 21:21:19,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,501 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,557 INFO L175 MemorySlicer]: Split 52 memory accesses to 7 slices as follows [2, 4, 20, 3, 1, 2, 20]. 38 percent of accesses are in the largest equivalence class. The 26 initializations are split as follows [2, 4, 0, 0, 0, 0, 20]. The 12 writes are split as follows [0, 0, 12, 0, 0, 0, 0]. [2024-10-11 21:21:19,561 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,609 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 21:21:19,614 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 21:21:19,614 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 21:21:19,614 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 21:21:19,615 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (1/1) ... [2024-10-11 21:21:19,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 21:21:19,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:19,656 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 21:21:19,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 21:21:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_raw [2024-10-11 21:21:19,720 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_raw [2024-10-11 21:21:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 21:21:19,720 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 21:21:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 21:21:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 21:21:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 21:21:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 21:21:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 21:21:19,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 21:21:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-10-11 21:21:19,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 21:21:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 21:21:19,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 21:21:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 21:21:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 21:21:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 21:21:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 21:21:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 21:21:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 21:21:19,724 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 21:21:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 21:21:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 21:21:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 21:21:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-10-11 21:21:19,725 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2024-10-11 21:21:19,725 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2024-10-11 21:21:19,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2024-10-11 21:21:19,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2024-10-11 21:21:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 21:21:19,727 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 21:21:19,727 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_hwmon_remove_attr [2024-10-11 21:21:19,727 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_hwmon_remove_attr [2024-10-11 21:21:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 21:21:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 21:21:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 21:21:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 21:21:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 21:21:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 21:21:19,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 21:21:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-10-11 21:21:19,729 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2024-10-11 21:21:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2024-10-11 21:21:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-11 21:21:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-11 21:21:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2024-10-11 21:21:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2024-10-11 21:21:19,730 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 21:21:19,730 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 21:21:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 21:21:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 21:21:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 21:21:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 21:21:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 21:21:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 21:21:19,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 21:21:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure s3c_adc_release [2024-10-11 21:21:19,732 INFO L138 BoogieDeclarations]: Found implementation of procedure s3c_adc_release [2024-10-11 21:21:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 21:21:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 21:21:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 21:21:19,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 21:21:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 21:21:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 21:21:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 21:21:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_handler_precall [2024-10-11 21:21:19,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_handler_precall [2024-10-11 21:21:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 21:21:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2024-10-11 21:21:19,733 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2024-10-11 21:21:19,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 21:21:19,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 21:21:19,734 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 21:21:19,734 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 21:21:20,010 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 21:21:20,014 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 21:21:20,558 INFO L? ?]: Removed 255 outVars from TransFormulas that were not future-live. [2024-10-11 21:21:20,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 21:21:20,650 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 21:21:20,650 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-11 21:21:20,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:20 BoogieIcfgContainer [2024-10-11 21:21:20,650 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 21:21:20,654 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 21:21:20,654 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 21:21:20,657 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 21:21:20,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 09:21:18" (1/3) ... [2024-10-11 21:21:20,658 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c997bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:20, skipping insertion in model container [2024-10-11 21:21:20,658 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 09:21:19" (2/3) ... [2024-10-11 21:21:20,659 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c997bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 09:21:20, skipping insertion in model container [2024-10-11 21:21:20,660 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:20" (3/3) ... [2024-10-11 21:21:20,661 INFO L112 eAbstractionObserver]: Analyzing ICFG m0_drivers-hwmon-s3c-hwmon-ko--130_7a--af3071a-1.i [2024-10-11 21:21:20,678 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 21:21:20,679 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2024-10-11 21:21:20,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 21:21:20,764 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;@142ab4a1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 21:21:20,764 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2024-10-11 21:21:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 162 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 116 states have internal predecessors, (145), 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) [2024-10-11 21:21:20,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 21:21:20,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:20,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:20,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_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)] === [2024-10-11 21:21:20,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:20,786 INFO L85 PathProgramCache]: Analyzing trace with hash 100526988, now seen corresponding path program 1 times [2024-10-11 21:21:20,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:20,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267976199] [2024-10-11 21:21:20,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:20,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:21,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 21:21:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:21,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267976199] [2024-10-11 21:21:21,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267976199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:21,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:21,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 21:21:21,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241213231] [2024-10-11 21:21:21,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:21,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 21:21:21,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:21,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 21:21:21,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:21,264 INFO L87 Difference]: Start difference. First operand has 162 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 116 states have internal predecessors, (145), 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 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-10-11 21:21:21,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:21,432 INFO L93 Difference]: Finished difference Result 327 states and 447 transitions. [2024-10-11 21:21:21,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 21:21:21,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 18 [2024-10-11 21:21:21,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:21,444 INFO L225 Difference]: With dead ends: 327 [2024-10-11 21:21:21,444 INFO L226 Difference]: Without dead ends: 161 [2024-10-11 21:21:21,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 21:21:21,451 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 80 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:21,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 259 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-11 21:21:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2024-10-11 21:21:21,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 104 states have (on average 1.3653846153846154) internal successors, (142), 116 states have internal predecessors, (142), 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) [2024-10-11 21:21:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 210 transitions. [2024-10-11 21:21:21,547 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 210 transitions. Word has length 18 [2024-10-11 21:21:21,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:21,548 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 210 transitions. [2024-10-11 21:21:21,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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) [2024-10-11 21:21:21,549 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 210 transitions. [2024-10-11 21:21:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 21:21:21,556 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:21,556 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:21,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 21:21:21,556 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_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)] === [2024-10-11 21:21:21,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:21,557 INFO L85 PathProgramCache]: Analyzing trace with hash 637230672, now seen corresponding path program 1 times [2024-10-11 21:21:21,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:21,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565070450] [2024-10-11 21:21:21,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:21,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 21:21:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 21:21:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 21:21:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:21,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 21:21:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 21:21:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:21,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:21,826 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 21:21:21,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:21,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565070450] [2024-10-11 21:21:21,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565070450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:21,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:21,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712956023] [2024-10-11 21:21:21,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:21,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:21,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:21,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:21,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:21,832 INFO L87 Difference]: Start difference. First operand 161 states and 210 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 21:21:22,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:22,188 INFO L93 Difference]: Finished difference Result 324 states and 424 transitions. [2024-10-11 21:21:22,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:22,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 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 54 [2024-10-11 21:21:22,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:22,193 INFO L225 Difference]: With dead ends: 324 [2024-10-11 21:21:22,196 INFO L226 Difference]: Without dead ends: 163 [2024-10-11 21:21:22,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:22,198 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 29 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:22,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 487 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:22,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-11 21:21:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 159. [2024-10-11 21:21:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 115 states have internal predecessors, (140), 33 states have call successors, (33), 13 states have call predecessors, (33), 13 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2024-10-11 21:21:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 206 transitions. [2024-10-11 21:21:22,232 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 206 transitions. Word has length 54 [2024-10-11 21:21:22,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:22,233 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 206 transitions. [2024-10-11 21:21:22,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-11 21:21:22,233 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 206 transitions. [2024-10-11 21:21:22,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 21:21:22,236 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:22,237 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 21:21:22,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 21:21:22,237 INFO L396 AbstractCegarLoop]: === Iteration 3 === 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)] === [2024-10-11 21:21:22,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:22,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1947908963, now seen corresponding path program 1 times [2024-10-11 21:21:22,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:22,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043391407] [2024-10-11 21:21:22,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:22,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:22,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:22,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:22,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:21:22,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 21:21:22,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,410 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:22,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:22,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043391407] [2024-10-11 21:21:22,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043391407] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:22,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:22,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:22,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289590689] [2024-10-11 21:21:22,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:22,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:22,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:22,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:22,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:22,415 INFO L87 Difference]: Start difference. First operand 159 states and 206 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:22,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:22,730 INFO L93 Difference]: Finished difference Result 349 states and 466 transitions. [2024-10-11 21:21:22,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:22,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 2 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 54 [2024-10-11 21:21:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:22,734 INFO L225 Difference]: With dead ends: 349 [2024-10-11 21:21:22,736 INFO L226 Difference]: Without dead ends: 194 [2024-10-11 21:21:22,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:22,738 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 58 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:22,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 333 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:22,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-10-11 21:21:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 190. [2024-10-11 21:21:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 127 states have (on average 1.3622047244094488) internal successors, (173), 139 states have internal predecessors, (173), 40 states have call successors, (40), 13 states have call predecessors, (40), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 21:21:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 253 transitions. [2024-10-11 21:21:22,780 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 253 transitions. Word has length 54 [2024-10-11 21:21:22,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:22,780 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 253 transitions. [2024-10-11 21:21:22,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 253 transitions. [2024-10-11 21:21:22,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-11 21:21:22,785 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:22,786 INFO L215 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] [2024-10-11 21:21:22,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 21:21:22,786 INFO L396 AbstractCegarLoop]: === Iteration 4 === 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)] === [2024-10-11 21:21:22,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 675808830, now seen corresponding path program 1 times [2024-10-11 21:21:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528862347] [2024-10-11 21:21:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:22,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:21:22,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 21:21:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:22,926 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528862347] [2024-10-11 21:21:22,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528862347] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:22,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600717601] [2024-10-11 21:21:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:22,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:22,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:22,929 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:22,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 21:21:23,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:23,141 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:23,197 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:23,197 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:23,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600717601] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:23,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:23,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-11 21:21:23,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824918164] [2024-10-11 21:21:23,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:23,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:23,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:23,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:23,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:23,199 INFO L87 Difference]: Start difference. First operand 190 states and 253 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-11 21:21:23,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:23,319 INFO L93 Difference]: Finished difference Result 374 states and 503 transitions. [2024-10-11 21:21:23,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:23,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 58 [2024-10-11 21:21:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:23,321 INFO L225 Difference]: With dead ends: 374 [2024-10-11 21:21:23,322 INFO L226 Difference]: Without dead ends: 188 [2024-10-11 21:21:23,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:23,323 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 58 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:23,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 344 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:23,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-11 21:21:23,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2024-10-11 21:21:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 128 states have (on average 1.3359375) internal successors, (171), 137 states have internal predecessors, (171), 40 states have call successors, (40), 13 states have call predecessors, (40), 13 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 21:21:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 251 transitions. [2024-10-11 21:21:23,338 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 251 transitions. Word has length 58 [2024-10-11 21:21:23,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:23,338 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 251 transitions. [2024-10-11 21:21:23,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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) [2024-10-11 21:21:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 251 transitions. [2024-10-11 21:21:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-11 21:21:23,340 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:23,340 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:23,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 21:21:23,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:23,541 INFO L396 AbstractCegarLoop]: === Iteration 5 === 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)] === [2024-10-11 21:21:23,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:23,542 INFO L85 PathProgramCache]: Analyzing trace with hash -524762450, now seen corresponding path program 1 times [2024-10-11 21:21:23,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:23,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375842406] [2024-10-11 21:21:23,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:23,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:21:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 21:21:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,698 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:23,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375842406] [2024-10-11 21:21:23,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375842406] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:23,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938659490] [2024-10-11 21:21:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:23,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:23,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:23,711 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:23,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 21:21:23,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:23,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:23,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:23,947 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:23,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:24,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938659490] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:24,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:24,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-10-11 21:21:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957108689] [2024-10-11 21:21:24,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:24,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:21:24,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:21:24,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:24,028 INFO L87 Difference]: Start difference. First operand 188 states and 251 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:24,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:24,364 INFO L93 Difference]: Finished difference Result 229 states and 318 transitions. [2024-10-11 21:21:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 21:21:24,365 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2024-10-11 21:21:24,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:24,367 INFO L225 Difference]: With dead ends: 229 [2024-10-11 21:21:24,367 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 21:21:24,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:24,369 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 229 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:24,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 359 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:24,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 21:21:24,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 181. [2024-10-11 21:21:24,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 125 states have (on average 1.32) internal successors, (165), 131 states have internal predecessors, (165), 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) [2024-10-11 21:21:24,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 243 transitions. [2024-10-11 21:21:24,387 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 243 transitions. Word has length 59 [2024-10-11 21:21:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:24,388 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 243 transitions. [2024-10-11 21:21:24,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2024-10-11 21:21:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 243 transitions. [2024-10-11 21:21:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-11 21:21:24,392 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:24,392 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2024-10-11 21:21:24,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 21:21:24,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:24,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === 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)] === [2024-10-11 21:21:24,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:24,594 INFO L85 PathProgramCache]: Analyzing trace with hash 853653279, now seen corresponding path program 1 times [2024-10-11 21:21:24,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:24,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244834596] [2024-10-11 21:21:24,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:24,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:24,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:24,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:24,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:21:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 21:21:24,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:24,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244834596] [2024-10-11 21:21:24,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244834596] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:24,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:24,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:24,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395322138] [2024-10-11 21:21:24,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:24,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:24,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:24,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:24,848 INFO L87 Difference]: Start difference. First operand 181 states and 243 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 21:21:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:25,227 INFO L93 Difference]: Finished difference Result 365 states and 498 transitions. [2024-10-11 21:21:25,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:25,227 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 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 61 [2024-10-11 21:21:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:25,230 INFO L225 Difference]: With dead ends: 365 [2024-10-11 21:21:25,231 INFO L226 Difference]: Without dead ends: 363 [2024-10-11 21:21:25,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:25,232 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 177 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:25,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 361 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:25,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-10-11 21:21:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 353. [2024-10-11 21:21:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 246 states have (on average 1.3170731707317074) internal successors, (324), 255 states have internal predecessors, (324), 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) [2024-10-11 21:21:25,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 482 transitions. [2024-10-11 21:21:25,272 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 482 transitions. Word has length 61 [2024-10-11 21:21:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:25,273 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 482 transitions. [2024-10-11 21:21:25,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-10-11 21:21:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 482 transitions. [2024-10-11 21:21:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-11 21:21:25,275 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:25,275 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:25,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 21:21:25,276 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_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)] === [2024-10-11 21:21:25,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1446819601, now seen corresponding path program 1 times [2024-10-11 21:21:25,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:25,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232862740] [2024-10-11 21:21:25,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:25,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:25,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 21:21:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:21:25,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 21:21:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 21:21:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,432 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 21:21:25,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:25,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232862740] [2024-10-11 21:21:25,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232862740] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:25,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:25,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 21:21:25,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360660219] [2024-10-11 21:21:25,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:25,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 21:21:25,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 21:21:25,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:25,435 INFO L87 Difference]: Start difference. First operand 353 states and 482 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 21:21:25,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:25,723 INFO L93 Difference]: Finished difference Result 714 states and 977 transitions. [2024-10-11 21:21:25,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 21:21:25,724 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 63 [2024-10-11 21:21:25,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:25,727 INFO L225 Difference]: With dead ends: 714 [2024-10-11 21:21:25,727 INFO L226 Difference]: Without dead ends: 357 [2024-10-11 21:21:25,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 21:21:25,731 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 29 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:25,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 453 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:25,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2024-10-11 21:21:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 349. [2024-10-11 21:21:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 244 states have (on average 1.3114754098360655) internal successors, (320), 253 states have internal predecessors, (320), 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) [2024-10-11 21:21:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 474 transitions. [2024-10-11 21:21:25,764 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 474 transitions. Word has length 63 [2024-10-11 21:21:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:25,764 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 474 transitions. [2024-10-11 21:21:25,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-10-11 21:21:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 474 transitions. [2024-10-11 21:21:25,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-11 21:21:25,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:25,766 INFO L215 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] [2024-10-11 21:21:25,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 21:21:25,766 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)] === [2024-10-11 21:21:25,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1626617434, now seen corresponding path program 1 times [2024-10-11 21:21:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016350517] [2024-10-11 21:21:25,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:25,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 21:21:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 21:21:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:25,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:21:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:25,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016350517] [2024-10-11 21:21:25,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016350517] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:25,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933058831] [2024-10-11 21:21:25,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:25,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:25,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:25,959 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:25,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 21:21:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:26,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 21:21:26,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:26,555 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 21:21:26,557 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [933058831] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:26,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 9 [2024-10-11 21:21:26,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071493750] [2024-10-11 21:21:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:26,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 21:21:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:26,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 21:21:26,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 21:21:26,559 INFO L87 Difference]: Start difference. First operand 349 states and 474 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 21:21:26,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:26,877 INFO L93 Difference]: Finished difference Result 354 states and 476 transitions. [2024-10-11 21:21:26,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 21:21:26,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 3 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 73 [2024-10-11 21:21:26,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:26,880 INFO L225 Difference]: With dead ends: 354 [2024-10-11 21:21:26,880 INFO L226 Difference]: Without dead ends: 174 [2024-10-11 21:21:26,881 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-11 21:21:26,882 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 131 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:26,882 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 258 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 21:21:26,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-11 21:21:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-10-11 21:21:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 121 states have (on average 1.2975206611570247) internal successors, (157), 125 states have internal predecessors, (157), 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) [2024-10-11 21:21:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 233 transitions. [2024-10-11 21:21:26,909 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 233 transitions. Word has length 73 [2024-10-11 21:21:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:26,910 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 233 transitions. [2024-10-11 21:21:26,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2024-10-11 21:21:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 233 transitions. [2024-10-11 21:21:26,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-10-11 21:21:26,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:26,911 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:26,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 21:21:27,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:27,113 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_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)] === [2024-10-11 21:21:27,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1251713947, now seen corresponding path program 1 times [2024-10-11 21:21:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122101799] [2024-10-11 21:21:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:27,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-11 21:21:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 21:21:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 21:21:27,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 21:21:27,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 21:21:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,229 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-10-11 21:21:27,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:27,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122101799] [2024-10-11 21:21:27,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122101799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:27,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:27,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 21:21:27,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323729985] [2024-10-11 21:21:27,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:27,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:27,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:27,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:27,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:27,232 INFO L87 Difference]: Start difference. First operand 174 states and 233 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:21:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:27,445 INFO L93 Difference]: Finished difference Result 348 states and 468 transitions. [2024-10-11 21:21:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 2 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 80 [2024-10-11 21:21:27,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:27,448 INFO L225 Difference]: With dead ends: 348 [2024-10-11 21:21:27,448 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 21:21:27,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:27,449 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 23 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:27,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 320 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:27,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 21:21:27,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2024-10-11 21:21:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 121 states have (on average 1.2892561983471074) internal successors, (156), 124 states have internal predecessors, (156), 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) [2024-10-11 21:21:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 232 transitions. [2024-10-11 21:21:27,462 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 232 transitions. Word has length 80 [2024-10-11 21:21:27,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:27,462 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 232 transitions. [2024-10-11 21:21:27,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-10-11 21:21:27,463 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 232 transitions. [2024-10-11 21:21:27,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-10-11 21:21:27,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:27,464 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:27,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 21:21:27,464 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_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)] === [2024-10-11 21:21:27,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1553907387, now seen corresponding path program 1 times [2024-10-11 21:21:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:27,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708191006] [2024-10-11 21:21:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 21:21:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:27,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:21:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:21:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 21:21:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:21:27,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:27,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-11 21:21:27,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:27,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708191006] [2024-10-11 21:21:27,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708191006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:27,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 21:21:27,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 21:21:27,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382712985] [2024-10-11 21:21:27,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:27,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:27,594 INFO L87 Difference]: Start difference. First operand 174 states and 232 transitions. Second operand has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 21:21:27,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:27,803 INFO L93 Difference]: Finished difference Result 352 states and 474 transitions. [2024-10-11 21:21:27,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:27,804 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 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 83 [2024-10-11 21:21:27,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:27,806 INFO L225 Difference]: With dead ends: 352 [2024-10-11 21:21:27,806 INFO L226 Difference]: Without dead ends: 182 [2024-10-11 21:21:27,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 21:21:27,808 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 24 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:27,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 314 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:27,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-10-11 21:21:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 178. [2024-10-11 21:21:27,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 124 states have (on average 1.282258064516129) internal successors, (159), 127 states have internal predecessors, (159), 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) [2024-10-11 21:21:27,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 237 transitions. [2024-10-11 21:21:27,820 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 237 transitions. Word has length 83 [2024-10-11 21:21:27,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:27,820 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 237 transitions. [2024-10-11 21:21:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 21:21:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 237 transitions. [2024-10-11 21:21:27,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-10-11 21:21:27,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:27,822 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:27,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 21:21:27,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_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)] === [2024-10-11 21:21:27,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:27,822 INFO L85 PathProgramCache]: Analyzing trace with hash -1675765417, now seen corresponding path program 1 times [2024-10-11 21:21:27,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:27,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364780230] [2024-10-11 21:21:27,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:27,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:27,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:27,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 21:21:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:21:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:21:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 21:21:27,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:21:27,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:21:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:27,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 21:21:27,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:27,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364780230] [2024-10-11 21:21:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364780230] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205803411] [2024-10-11 21:21:27,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:27,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:27,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:28,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:28,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 21:21:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,243 INFO L255 TraceCheckSpWp]: Trace formula consists of 588 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:28,247 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 21:21:28,278 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 21:21:28,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205803411] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 21:21:28,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 21:21:28,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-11 21:21:28,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67999011] [2024-10-11 21:21:28,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 21:21:28,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 21:21:28,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:28,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 21:21:28,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:28,281 INFO L87 Difference]: Start difference. First operand 178 states and 237 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-10-11 21:21:28,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:28,369 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2024-10-11 21:21:28,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 21:21:28,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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 96 [2024-10-11 21:21:28,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:28,371 INFO L225 Difference]: With dead ends: 178 [2024-10-11 21:21:28,371 INFO L226 Difference]: Without dead ends: 177 [2024-10-11 21:21:28,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 21:21:28,372 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:28,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 436 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 21:21:28,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-11 21:21:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-10-11 21:21:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 124 states have (on average 1.2741935483870968) internal successors, (158), 126 states have internal predecessors, (158), 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) [2024-10-11 21:21:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 236 transitions. [2024-10-11 21:21:28,384 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 236 transitions. Word has length 96 [2024-10-11 21:21:28,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:28,385 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 236 transitions. [2024-10-11 21:21:28,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 states have internal predecessors, (48), 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) [2024-10-11 21:21:28,385 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 236 transitions. [2024-10-11 21:21:28,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-11 21:21:28,386 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 21:21:28,387 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 21:21:28,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 21:21:28,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-10-11 21:21:28,588 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_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)] === [2024-10-11 21:21:28,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 21:21:28,588 INFO L85 PathProgramCache]: Analyzing trace with hash -409120019, now seen corresponding path program 1 times [2024-10-11 21:21:28,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 21:21:28,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011443478] [2024-10-11 21:21:28,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:28,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 21:21:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 21:21:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 21:21:28,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 21:21:28,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 21:21:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-10-11 21:21:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 21:21:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 21:21:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 21:21:28,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 21:21:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 21:21:28,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 21:21:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 21:21:28,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:28,771 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 21:21:28,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 21:21:28,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011443478] [2024-10-11 21:21:28,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011443478] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 21:21:28,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [415509065] [2024-10-11 21:21:28,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 21:21:28,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 21:21:28,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 21:21:28,774 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 21:21:28,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 21:21:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 21:21:29,042 INFO L255 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 21:21:29,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 21:21:29,077 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 21:21:29,078 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 21:21:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-10-11 21:21:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [415509065] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 21:21:29,199 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 21:21:29,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 7 [2024-10-11 21:21:29,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639170755] [2024-10-11 21:21:29,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 21:21:29,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 21:21:29,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 21:21:29,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 21:21:29,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:29,201 INFO L87 Difference]: Start difference. First operand 177 states and 236 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 6 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 21:21:29,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 21:21:29,447 INFO L93 Difference]: Finished difference Result 186 states and 252 transitions. [2024-10-11 21:21:29,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 21:21:29,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 6 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) Word has length 97 [2024-10-11 21:21:29,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 21:21:29,449 INFO L225 Difference]: With dead ends: 186 [2024-10-11 21:21:29,449 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 21:21:29,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-10-11 21:21:29,450 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 23 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 21:21:29,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 414 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 21:21:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 21:21:29,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 21:21:29,450 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) [2024-10-11 21:21:29,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 21:21:29,451 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 97 [2024-10-11 21:21:29,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 21:21:29,451 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 21:21:29,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 7 states have internal predecessors, (62), 6 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (18), 6 states have call predecessors, (18), 6 states have call successors, (18) [2024-10-11 21:21:29,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 21:21:29,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 21:21:29,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2024-10-11 21:21:29,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_device_create_file_dev_attr_of_sensor_device_attributeErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2024-10-11 21:21:29,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2024-10-11 21:21:29,455 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2024-10-11 21:21:29,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2024-10-11 21:21:29,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2024-10-11 21:21:29,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2024-10-11 21:21:29,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2024-10-11 21:21:29,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2024-10-11 21:21:29,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2024-10-11 21:21:29,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2024-10-11 21:21:29,457 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2024-10-11 21:21:29,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 21:21:29,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 21:21:29,660 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 21:21:29,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 21:21:30,532 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 21:21:30,549 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:21:30,550 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2024-10-11 21:21:30,550 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:21:30,550 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:21:30,550 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2024-10-11 21:21:30,553 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:21:30,553 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2024-10-11 21:21:30,553 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:21:30,553 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~i~0 [2024-10-11 21:21:30,553 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2024-10-11 21:21:30,554 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2024-10-11 21:21:30,554 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: ~ldv_s_s3c_hwmon_driver_platform_driver~0 [2024-10-11 21:21:30,560 WARN L155 FloydHoareUtils]: Requires clause for platform_get_drvdata contained old-variable. Original clause: (and (= |old(#length)| |#length|) (<= ~ldv_count_1~0 0) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (= ~ldv_count_2~0 0)) [2024-10-11 21:21:30,561 WARN L155 FloydHoareUtils]: Requires clause for ldv_device_create_file_dev_attr_of_sensor_device_attribute contained old-variable. Original clause: (and (<= ~ldv_count_1~0 0) (= |old(~ldv_count_2~0)| 0) (= ~ldv_count_2~0 0)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (= ~ldv_count_2~0 0)) [2024-10-11 21:21:30,565 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (<= ~ldv_count_1~0 0) (= ~ldv_count_2~0 0) (= |old(#valid)| |#valid|)) Eliminated clause: (and (<= ~ldv_count_1~0 0) (= ~ldv_count_2~0 0)) [2024-10-11 21:21:30,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 09:21:30 BoogieIcfgContainer [2024-10-11 21:21:30,568 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 21:21:30,568 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 21:21:30,569 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 21:21:30,569 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 21:21:30,569 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 09:21:20" (3/4) ... [2024-10-11 21:21:30,571 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_raw [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure platform_get_drvdata [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_handler_precall [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure PTR_ERR [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_is_err [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure hwmon_device_unregister [2024-10-11 21:21:30,575 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2024-10-11 21:21:30,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-11 21:21:30,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure device_remove_file [2024-10-11 21:21:30,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_adc_release [2024-10-11 21:21:30,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure s3c_hwmon_remove_attr [2024-10-11 21:21:30,576 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2024-10-11 21:21:30,587 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2024-10-11 21:21:30,588 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2024-10-11 21:21:30,589 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-11 21:21:30,590 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 21:21:30,591 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 21:21:30,762 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 21:21:30,763 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 21:21:30,763 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 21:21:30,764 INFO L158 Benchmark]: Toolchain (without parser) took 12139.29ms. Allocated memory was 159.4MB in the beginning and 251.7MB in the end (delta: 92.3MB). Free memory was 102.5MB in the beginning and 207.4MB in the end (delta: -104.9MB). Peak memory consumption was 134.0MB. Max. memory is 16.1GB. [2024-10-11 21:21:30,764 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 21:21:30,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 701.22ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 70.9MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 21:21:30,765 INFO L158 Benchmark]: Boogie Procedure Inliner took 142.72ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 70.9MB in the beginning and 173.9MB in the end (delta: -103.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-10-11 21:21:30,765 INFO L158 Benchmark]: Boogie Preprocessor took 136.41ms. Allocated memory is still 205.5MB. Free memory was 173.9MB in the beginning and 165.3MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 21:21:30,765 INFO L158 Benchmark]: RCFGBuilder took 1036.74ms. Allocated memory is still 205.5MB. Free memory was 165.3MB in the beginning and 97.4MB in the end (delta: 67.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-10-11 21:21:30,766 INFO L158 Benchmark]: TraceAbstraction took 9914.38ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 97.4MB in the beginning and 74.0MB in the end (delta: 23.4MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. [2024-10-11 21:21:30,766 INFO L158 Benchmark]: Witness Printer took 195.25ms. Allocated memory is still 251.7MB. Free memory was 74.0MB in the beginning and 207.4MB in the end (delta: -133.4MB). Peak memory consumption was 11.3MB. Max. memory is 16.1GB. [2024-10-11 21:21:30,768 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.19ms. Allocated memory is still 159.4MB. Free memory is still 119.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 701.22ms. Allocated memory is still 159.4MB. Free memory was 102.3MB in the beginning and 70.9MB in the end (delta: 31.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 142.72ms. Allocated memory was 159.4MB in the beginning and 205.5MB in the end (delta: 46.1MB). Free memory was 70.9MB in the beginning and 173.9MB in the end (delta: -103.0MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.41ms. Allocated memory is still 205.5MB. Free memory was 173.9MB in the beginning and 165.3MB in the end (delta: 8.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1036.74ms. Allocated memory is still 205.5MB. Free memory was 165.3MB in the beginning and 97.4MB in the end (delta: 67.9MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9914.38ms. Allocated memory was 205.5MB in the beginning and 251.7MB in the end (delta: 46.1MB). Free memory was 97.4MB in the beginning and 74.0MB in the end (delta: 23.4MB). Peak memory consumption was 69.5MB. Max. memory is 16.1GB. * Witness Printer took 195.25ms. Allocated memory is still 251.7MB. Free memory was 74.0MB in the beginning and 207.4MB in the end (delta: -133.4MB). Peak memory consumption was 11.3MB. 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: ~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: ~ldv_s_s3c_hwmon_driver_platform_driver~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: 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 - 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: 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: 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: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 14 procedures, 162 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 993 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 862 mSDsluCounter, 4338 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2577 mSDsCounter, 405 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2162 IncrementalHoareTripleChecker+Invalid, 2567 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 405 mSolverCounterUnsat, 1761 mSDtfsCounter, 2162 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 818 GetRequests, 772 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=353occurred in iteration=6, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 79 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1179 NumberOfCodeBlocks, 1179 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1316 ConstructedInterpolants, 0 QuantifiedInterpolants, 2230 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2727 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 399/430 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 980]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0) && (ldv_count_2 == 0)) || ((ldv_count_1 <= 0) && (ldv_count_2 == 0))) - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: (((ldv_count_1 <= 0) && (ldv_count_2 == 0)) || ((ldv_count_1 <= 0) && (ldv_count_2 == 0))) - InvariantResult [Line: 1236]: Location Invariant Derived location invariant: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - InvariantResult [Line: 1031]: Location Invariant Derived location invariant: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - InvariantResult [Line: 1228]: Location Invariant Derived location invariant: 1 - InvariantResult [Line: 1091]: Location Invariant Derived location invariant: ((((ldv_count_1 <= 0) && (0 <= i)) && (ldv_count_2 == 0)) && (i <= 2147483645)) - InvariantResult [Line: 1131]: Location Invariant Derived location invariant: (((((ldv_count_1 <= 0) && (1 <= i)) && (i <= 2147483645)) && (ldv_count_2 == 0)) || (((ldv_count_1 <= 0) && (i == 0)) && (ldv_count_2 == 0))) - ProcedureContractResult [Line: 918]: Procedure Contract for s3c_hwmon_remove_raw Derived contract for procedure s3c_hwmon_remove_raw. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 873]: Procedure Contract for platform_get_drvdata Derived contract for procedure platform_get_drvdata. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1327]: Procedure Contract for ldv_device_create_file_dev_attr_of_sensor_device_attribute Derived contract for procedure ldv_device_create_file_dev_attr_of_sensor_device_attribute. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: (((ldv_count_1 <= 0) && (\old(ldv_count_2) == 0)) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1236]: Procedure Contract for PTR_ERR Derived contract for procedure PTR_ERR. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1281]: Procedure Contract for ldv_is_err Derived contract for procedure ldv_is_err. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1375]: Procedure Contract for hwmon_device_unregister Derived contract for procedure hwmon_device_unregister. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 837]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1369]: Procedure Contract for device_remove_file Derived contract for procedure device_remove_file. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1411]: Procedure Contract for s3c_adc_release Derived contract for procedure s3c_adc_release. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1010]: Procedure Contract for s3c_hwmon_remove_attr Derived contract for procedure s3c_hwmon_remove_attr. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) - ProcedureContractResult [Line: 1244]: Procedure Contract for IS_ERR Derived contract for procedure IS_ERR. Requires: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) Ensures: ((ldv_count_1 <= 0) && (ldv_count_2 == 0)) RESULT: Ultimate proved your program to be correct! [2024-10-11 21:21:30,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE