./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 15:18:42,512 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 15:18:42,583 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 15:18:42,588 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 15:18:42,590 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 15:18:42,615 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 15:18:42,615 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 15:18:42,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 15:18:42,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 15:18:42,617 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 15:18:42,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 15:18:42,618 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 15:18:42,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 15:18:42,620 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 15:18:42,621 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 15:18:42,621 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 15:18:42,622 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 15:18:42,623 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 15:18:42,623 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 15:18:42,623 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 15:18:42,623 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 15:18:42,624 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 15:18:42,624 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 15:18:42,624 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 15:18:42,625 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 15:18:42,625 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 15:18:42,625 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 15:18:42,626 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 15:18:42,626 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 15:18:42,626 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:18:42,627 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 15:18:42,627 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 15:18:42,627 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 15:18:42,627 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 15:18:42,628 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 15:18:42,628 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 15:18:42,628 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 15:18:42,628 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 15:18:42,628 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 15:18:42,628 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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b42d40a01333bd7cf600d1931e5c326b61c631d3a1040aaad3e0a3658ee3cf [2024-10-11 15:18:42,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 15:18:42,930 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 15:18:42,933 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 15:18:42,934 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 15:18:42,934 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 15:18:42,936 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-10-11 15:18:44,330 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 15:18:44,700 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 15:18:44,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-10-11 15:18:44,733 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8f450d0cc/46e6506d8ef5426f9966b9a8f840b215/FLAG97ea741f0 [2024-10-11 15:18:44,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8f450d0cc/46e6506d8ef5426f9966b9a8f840b215 [2024-10-11 15:18:44,754 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 15:18:44,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 15:18:44,758 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 15:18:44,759 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 15:18:44,765 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 15:18:44,765 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:18:44" (1/1) ... [2024-10-11 15:18:44,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60ddc507 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:44, skipping insertion in model container [2024-10-11 15:18:44,767 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:18:44" (1/1) ... [2024-10-11 15:18:44,849 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 15:18:45,398 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2024-10-11 15:18:45,517 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:18:45,554 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 15:18:45,671 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i[73128,73141] [2024-10-11 15:18:45,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 15:18:45,751 INFO L204 MainTranslator]: Completed translation [2024-10-11 15:18:45,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45 WrapperNode [2024-10-11 15:18:45,751 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 15:18:45,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 15:18:45,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 15:18:45,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 15:18:45,760 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:45,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:45,860 INFO L138 Inliner]: procedures = 99, calls = 348, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 784 [2024-10-11 15:18:45,860 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 15:18:45,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 15:18:45,861 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 15:18:45,861 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 15:18:45,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:45,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:45,891 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:45,957 INFO L175 MemorySlicer]: Split 221 memory accesses to 6 slices as follows [2, 14, 12, 63, 30, 100]. 45 percent of accesses are in the largest equivalence class. The 195 initializations are split as follows [2, 0, 0, 63, 30, 100]. The 14 writes are split as follows [0, 2, 12, 0, 0, 0]. [2024-10-11 15:18:45,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:45,962 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:45,998 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:46,001 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:46,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:46,019 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:46,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 15:18:46,033 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 15:18:46,033 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 15:18:46,033 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 15:18:46,034 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (1/1) ... [2024-10-11 15:18:46,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 15:18:46,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 15:18:46,067 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 15:18:46,073 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 15:18:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2024-10-11 15:18:46,117 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2024-10-11 15:18:46,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2024-10-11 15:18:46,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2024-10-11 15:18:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 15:18:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 15:18:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 15:18:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 15:18:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 15:18:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 15:18:46,118 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2024-10-11 15:18:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2024-10-11 15:18:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2024-10-11 15:18:46,120 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2024-10-11 15:18:46,120 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2024-10-11 15:18:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2024-10-11 15:18:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 15:18:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2024-10-11 15:18:46,121 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2024-10-11 15:18:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 15:18:46,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 15:18:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 15:18:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 15:18:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 15:18:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-10-11 15:18:46,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-10-11 15:18:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 15:18:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 15:18:46,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 15:18:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 15:18:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 15:18:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-11 15:18:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-10-11 15:18:46,124 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2024-10-11 15:18:46,125 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2024-10-11 15:18:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 15:18:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-11 15:18:46,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-11 15:18:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 15:18:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 15:18:46,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-11 15:18:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-10-11 15:18:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-10-11 15:18:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-10-11 15:18:46,126 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2024-10-11 15:18:46,127 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2024-10-11 15:18:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 15:18:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 15:18:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 15:18:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 15:18:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 15:18:46,127 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 15:18:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-11 15:18:46,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-11 15:18:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 15:18:46,128 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 15:18:46,128 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2024-10-11 15:18:46,128 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2024-10-11 15:18:46,403 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 15:18:46,405 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 15:18:47,112 INFO L? ?]: Removed 263 outVars from TransFormulas that were not future-live. [2024-10-11 15:18:47,113 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 15:18:47,227 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 15:18:47,228 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 15:18:47,228 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:18:47 BoogieIcfgContainer [2024-10-11 15:18:47,228 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 15:18:47,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 15:18:47,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 15:18:47,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 15:18:47,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:18:44" (1/3) ... [2024-10-11 15:18:47,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bafb73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:18:47, skipping insertion in model container [2024-10-11 15:18:47,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:18:45" (2/3) ... [2024-10-11 15:18:47,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bafb73a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:18:47, skipping insertion in model container [2024-10-11 15:18:47,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:18:47" (3/3) ... [2024-10-11 15:18:47,236 INFO L112 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2024-10-11 15:18:47,278 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 15:18:47,279 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 15:18:47,351 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 15:18:47,358 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;@6a0fe144, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 15:18:47,359 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 15:18:47,363 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 97 states have (on average 1.556701030927835) internal successors, (151), 105 states have internal predecessors, (151), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 15:18:47,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 15:18:47,372 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:47,372 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:47,372 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:47,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:47,376 INFO L85 PathProgramCache]: Analyzing trace with hash -963144185, now seen corresponding path program 1 times [2024-10-11 15:18:47,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:47,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140649706] [2024-10-11 15:18:47,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:47,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:47,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:47,843 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 15:18:47,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:47,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140649706] [2024-10-11 15:18:47,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140649706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:47,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:47,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:18:47,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011998340] [2024-10-11 15:18:47,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:47,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:18:47,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:47,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:18:47,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:47,874 INFO L87 Difference]: Start difference. First operand has 139 states, 97 states have (on average 1.556701030927835) internal successors, (151), 105 states have internal predecessors, (151), 29 states have call successors, (29), 11 states have call predecessors, (29), 11 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:48,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:48,155 INFO L93 Difference]: Finished difference Result 401 states and 625 transitions. [2024-10-11 15:18:48,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:18:48,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-11 15:18:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:48,167 INFO L225 Difference]: With dead ends: 401 [2024-10-11 15:18:48,167 INFO L226 Difference]: Without dead ends: 261 [2024-10-11 15:18:48,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:48,174 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 176 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:48,174 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 324 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 15:18:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2024-10-11 15:18:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 257. [2024-10-11 15:18:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 184 states have (on average 1.516304347826087) internal successors, (279), 191 states have internal predecessors, (279), 52 states have call successors, (52), 21 states have call predecessors, (52), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:18:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 377 transitions. [2024-10-11 15:18:48,233 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 377 transitions. Word has length 11 [2024-10-11 15:18:48,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:48,233 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 377 transitions. [2024-10-11 15:18:48,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:48,234 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 377 transitions. [2024-10-11 15:18:48,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 15:18:48,238 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:48,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:48,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 15:18:48,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:48,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:48,240 INFO L85 PathProgramCache]: Analyzing trace with hash 780998210, now seen corresponding path program 1 times [2024-10-11 15:18:48,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:48,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229336603] [2024-10-11 15:18:48,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:48,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:48,327 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 15:18:48,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229336603] [2024-10-11 15:18:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229336603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 15:18:48,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146523614] [2024-10-11 15:18:48,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:48,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:18:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:48,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:18:48,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:48,332 INFO L87 Difference]: Start difference. First operand 257 states and 377 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:48,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:48,514 INFO L93 Difference]: Finished difference Result 279 states and 403 transitions. [2024-10-11 15:18:48,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:18:48,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 15:18:48,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:48,518 INFO L225 Difference]: With dead ends: 279 [2024-10-11 15:18:48,521 INFO L226 Difference]: Without dead ends: 268 [2024-10-11 15:18:48,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:48,523 INFO L432 NwaCegarLoop]: 176 mSDtfsCounter, 194 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:48,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 189 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:18:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-10-11 15:18:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 257. [2024-10-11 15:18:48,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 184 states have (on average 1.5108695652173914) internal successors, (278), 191 states have internal predecessors, (278), 52 states have call successors, (52), 21 states have call predecessors, (52), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:18:48,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 376 transitions. [2024-10-11 15:18:48,561 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 376 transitions. Word has length 14 [2024-10-11 15:18:48,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:48,561 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 376 transitions. [2024-10-11 15:18:48,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 376 transitions. [2024-10-11 15:18:48,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 15:18:48,563 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:48,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:48,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 15:18:48,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:48,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:48,564 INFO L85 PathProgramCache]: Analyzing trace with hash 838256512, now seen corresponding path program 1 times [2024-10-11 15:18:48,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:48,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771733476] [2024-10-11 15:18:48,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:48,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:48,677 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 15:18:48,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:48,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771733476] [2024-10-11 15:18:48,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771733476] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:48,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:48,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:18:48,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373707172] [2024-10-11 15:18:48,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:48,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:18:48,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:48,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:18:48,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:48,679 INFO L87 Difference]: Start difference. First operand 257 states and 376 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:48,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:48,790 INFO L93 Difference]: Finished difference Result 259 states and 377 transitions. [2024-10-11 15:18:48,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:18:48,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 15:18:48,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:48,793 INFO L225 Difference]: With dead ends: 259 [2024-10-11 15:18:48,795 INFO L226 Difference]: Without dead ends: 256 [2024-10-11 15:18:48,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:48,799 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:48,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 161 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:18:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-10-11 15:18:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-10-11 15:18:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 184 states have (on average 1.5054347826086956) internal successors, (277), 190 states have internal predecessors, (277), 51 states have call successors, (51), 21 states have call predecessors, (51), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:18:48,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 374 transitions. [2024-10-11 15:18:48,836 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 374 transitions. Word has length 14 [2024-10-11 15:18:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:48,836 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 374 transitions. [2024-10-11 15:18:48,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 374 transitions. [2024-10-11 15:18:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 15:18:48,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:48,840 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:48,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 15:18:48,841 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:48,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:48,841 INFO L85 PathProgramCache]: Analyzing trace with hash 216028979, now seen corresponding path program 1 times [2024-10-11 15:18:48,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:48,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200762318] [2024-10-11 15:18:48,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:48,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:48,939 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 15:18:48,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:48,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200762318] [2024-10-11 15:18:48,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200762318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:48,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:48,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:18:48,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308357880] [2024-10-11 15:18:48,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:48,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:18:48,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:48,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:18:48,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:48,942 INFO L87 Difference]: Start difference. First operand 256 states and 374 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:49,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:49,081 INFO L93 Difference]: Finished difference Result 258 states and 375 transitions. [2024-10-11 15:18:49,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:18:49,081 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 15:18:49,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:49,083 INFO L225 Difference]: With dead ends: 258 [2024-10-11 15:18:49,083 INFO L226 Difference]: Without dead ends: 255 [2024-10-11 15:18:49,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:49,085 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 183 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:49,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 159 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:18:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-10-11 15:18:49,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2024-10-11 15:18:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 184 states have (on average 1.5) internal successors, (276), 189 states have internal predecessors, (276), 50 states have call successors, (50), 21 states have call predecessors, (50), 20 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:18:49,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 372 transitions. [2024-10-11 15:18:49,114 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 372 transitions. Word has length 15 [2024-10-11 15:18:49,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:49,115 INFO L471 AbstractCegarLoop]: Abstraction has 255 states and 372 transitions. [2024-10-11 15:18:49,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 372 transitions. [2024-10-11 15:18:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 15:18:49,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:49,119 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:49,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 15:18:49,119 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:49,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1893150493, now seen corresponding path program 1 times [2024-10-11 15:18:49,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:49,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803549653] [2024-10-11 15:18:49,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:49,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:49,195 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 15:18:49,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:49,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803549653] [2024-10-11 15:18:49,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803549653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:49,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:49,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:18:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757604317] [2024-10-11 15:18:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:49,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:18:49,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:49,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:18:49,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:49,200 INFO L87 Difference]: Start difference. First operand 255 states and 372 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:49,348 INFO L93 Difference]: Finished difference Result 263 states and 376 transitions. [2024-10-11 15:18:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:18:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-11 15:18:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:49,350 INFO L225 Difference]: With dead ends: 263 [2024-10-11 15:18:49,352 INFO L226 Difference]: Without dead ends: 259 [2024-10-11 15:18:49,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:49,353 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:49,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 177 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:18:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-10-11 15:18:49,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2024-10-11 15:18:49,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 186 states have (on average 1.478494623655914) internal successors, (275), 189 states have internal predecessors, (275), 48 states have call successors, (48), 23 states have call predecessors, (48), 22 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:18:49,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 369 transitions. [2024-10-11 15:18:49,384 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 369 transitions. Word has length 16 [2024-10-11 15:18:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:49,384 INFO L471 AbstractCegarLoop]: Abstraction has 257 states and 369 transitions. [2024-10-11 15:18:49,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 369 transitions. [2024-10-11 15:18:49,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 15:18:49,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:49,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:49,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 15:18:49,389 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:49,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1441767478, now seen corresponding path program 1 times [2024-10-11 15:18:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073825811] [2024-10-11 15:18:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:49,473 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 15:18:49,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:49,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073825811] [2024-10-11 15:18:49,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073825811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:49,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:49,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 15:18:49,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896166482] [2024-10-11 15:18:49,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:49,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 15:18:49,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:49,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 15:18:49,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:49,477 INFO L87 Difference]: Start difference. First operand 257 states and 369 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:49,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:49,587 INFO L93 Difference]: Finished difference Result 259 states and 370 transitions. [2024-10-11 15:18:49,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 15:18:49,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 15:18:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:49,589 INFO L225 Difference]: With dead ends: 259 [2024-10-11 15:18:49,589 INFO L226 Difference]: Without dead ends: 251 [2024-10-11 15:18:49,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 15:18:49,590 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:49,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 154 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 15:18:49,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-10-11 15:18:49,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2024-10-11 15:18:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 181 states have (on average 1.4806629834254144) internal successors, (268), 183 states have internal predecessors, (268), 47 states have call successors, (47), 23 states have call predecessors, (47), 22 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 15:18:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 361 transitions. [2024-10-11 15:18:49,611 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 361 transitions. Word has length 17 [2024-10-11 15:18:49,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:49,611 INFO L471 AbstractCegarLoop]: Abstraction has 251 states and 361 transitions. [2024-10-11 15:18:49,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 15:18:49,612 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 361 transitions. [2024-10-11 15:18:49,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-11 15:18:49,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:49,613 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:49,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 15:18:49,614 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:49,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:49,614 INFO L85 PathProgramCache]: Analyzing trace with hash -468234048, now seen corresponding path program 1 times [2024-10-11 15:18:49,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:49,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589492712] [2024-10-11 15:18:49,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:49,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:49,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:49,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-10-11 15:18:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:18:49,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:49,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 15:18:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:49,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 15:18:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:49,737 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 15:18:49,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:49,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589492712] [2024-10-11 15:18:49,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589492712] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:49,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:49,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:18:49,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782114963] [2024-10-11 15:18:49,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:49,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:18:49,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:49,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:18:49,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:18:49,742 INFO L87 Difference]: Start difference. First operand 251 states and 361 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 15:18:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:50,283 INFO L93 Difference]: Finished difference Result 653 states and 956 transitions. [2024-10-11 15:18:50,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:18:50,284 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 37 [2024-10-11 15:18:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:50,288 INFO L225 Difference]: With dead ends: 653 [2024-10-11 15:18:50,288 INFO L226 Difference]: Without dead ends: 403 [2024-10-11 15:18:50,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:18:50,291 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 153 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:50,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 408 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 15:18:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-10-11 15:18:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 391. [2024-10-11 15:18:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 293 states have (on average 1.5051194539249146) internal successors, (441), 297 states have internal predecessors, (441), 65 states have call successors, (65), 33 states have call predecessors, (65), 32 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 15:18:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 570 transitions. [2024-10-11 15:18:50,347 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 570 transitions. Word has length 37 [2024-10-11 15:18:50,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:50,347 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 570 transitions. [2024-10-11 15:18:50,347 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 15:18:50,348 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 570 transitions. [2024-10-11 15:18:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 15:18:50,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 15:18:50,349 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 15:18:50,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 15:18:50,350 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 15:18:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 15:18:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1861036521, now seen corresponding path program 1 times [2024-10-11 15:18:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 15:18:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927052484] [2024-10-11 15:18:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 15:18:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 15:18:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:50,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 15:18:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:50,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 15:18:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 15:18:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:50,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 15:18:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 15:18:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 15:18:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 15:18:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927052484] [2024-10-11 15:18:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927052484] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 15:18:50,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 15:18:50,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 15:18:50,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875837373] [2024-10-11 15:18:50,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 15:18:50,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 15:18:50,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 15:18:50,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 15:18:50,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 15:18:50,599 INFO L87 Difference]: Start difference. First operand 391 states and 570 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 15:18:51,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 15:18:51,034 INFO L93 Difference]: Finished difference Result 403 states and 594 transitions. [2024-10-11 15:18:51,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 15:18:51,035 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 45 [2024-10-11 15:18:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 15:18:51,035 INFO L225 Difference]: With dead ends: 403 [2024-10-11 15:18:51,036 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 15:18:51,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 15:18:51,037 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 56 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 15:18:51,038 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 395 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 15:18:51,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 15:18:51,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 15:18:51,038 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 15:18:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 15:18:51,039 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2024-10-11 15:18:51,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 15:18:51,039 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 15:18:51,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 3 states have internal predecessors, (33), 3 states have call successors, (6), 5 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 15:18:51,039 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 15:18:51,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 15:18:51,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 15:18:51,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 15:18:51,045 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 15:18:51,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 15:18:52,807 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 15:18:52,833 WARN L155 FloydHoareUtils]: Requires clause for ldv_mutex_lock_mtx_of_isl_pmic contained old-variable. Original clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= 1 |old(~ldv_mutex_mtx_of_isl_pmic~0)|) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2024-10-11 15:18:52,837 WARN L155 FloydHoareUtils]: Requires clause for ldv_malloc contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= |old(#valid)| |#valid|) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2024-10-11 15:18:52,842 WARN L155 FloydHoareUtils]: Requires clause for ldv_mutex_unlock_mtx_of_isl_pmic contained old-variable. Original clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= 2 |old(~ldv_mutex_mtx_of_isl_pmic~0)|) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_mtx_of_isl_pmic~0 2) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1)) [2024-10-11 15:18:52,846 WARN L155 FloydHoareUtils]: Requires clause for rdev_get_drvdata contained old-variable. Original clause: (and (= |old(#length)| |#length|) (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= |old(#valid)| |#valid|) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) Eliminated clause: (and (= 1 ~ldv_mutex_mutex_of_device~0) (= ~ldv_retval_1~0 0) (= ~ldv_mutex_lock~0 1) (= ~ldv_mutex_cred_guard_mutex_of_signal_struct~0 1) (= ~ldv_mutex_mtx_of_isl_pmic~0 1)) [2024-10-11 15:18:52,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:18:52 BoogieIcfgContainer [2024-10-11 15:18:52,861 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 15:18:52,865 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 15:18:52,866 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 15:18:52,866 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 15:18:52,866 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:18:47" (3/4) ... [2024-10-11 15:18:52,868 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 15:18:52,873 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2024-10-11 15:18:52,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2024-10-11 15:18:52,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2024-10-11 15:18:52,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2024-10-11 15:18:52,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2024-10-11 15:18:52,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2024-10-11 15:18:52,874 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2024-10-11 15:18:52,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2024-10-11 15:18:52,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2024-10-11 15:18:52,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2024-10-11 15:18:52,875 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2024-10-11 15:18:52,894 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 94 nodes and edges [2024-10-11 15:18:52,895 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2024-10-11 15:18:52,897 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-11 15:18:52,898 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 15:18:52,899 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 15:18:53,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 15:18:53,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 15:18:53,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 15:18:53,084 INFO L158 Benchmark]: Toolchain (without parser) took 8328.40ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 143.5MB in the beginning and 119.5MB in the end (delta: 23.9MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2024-10-11 15:18:53,084 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 15:18:53,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 993.39ms. Allocated memory is still 182.5MB. Free memory was 143.5MB in the beginning and 81.6MB in the end (delta: 61.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. [2024-10-11 15:18:53,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.79ms. Allocated memory is still 182.5MB. Free memory was 81.6MB in the beginning and 75.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 15:18:53,085 INFO L158 Benchmark]: Boogie Preprocessor took 171.03ms. Allocated memory is still 182.5MB. Free memory was 75.3MB in the beginning and 63.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 15:18:53,085 INFO L158 Benchmark]: RCFGBuilder took 1195.79ms. Allocated memory is still 182.5MB. Free memory was 63.8MB in the beginning and 64.2MB in the end (delta: -414.9kB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 15:18:53,086 INFO L158 Benchmark]: TraceAbstraction took 5630.55ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 64.2MB in the beginning and 137.4MB in the end (delta: -73.2MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. [2024-10-11 15:18:53,086 INFO L158 Benchmark]: Witness Printer took 218.14ms. Allocated memory is still 239.1MB. Free memory was 137.4MB in the beginning and 119.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 15:18:53,090 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.16ms. Allocated memory is still 119.5MB. Free memory is still 93.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 993.39ms. Allocated memory is still 182.5MB. Free memory was 143.5MB in the beginning and 81.6MB in the end (delta: 61.9MB). Peak memory consumption was 60.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.79ms. Allocated memory is still 182.5MB. Free memory was 81.6MB in the beginning and 75.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 171.03ms. Allocated memory is still 182.5MB. Free memory was 75.3MB in the beginning and 63.8MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1195.79ms. Allocated memory is still 182.5MB. Free memory was 63.8MB in the beginning and 64.2MB in the end (delta: -414.9kB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 5630.55ms. Allocated memory was 182.5MB in the beginning and 239.1MB in the end (delta: 56.6MB). Free memory was 64.2MB in the beginning and 137.4MB in the end (delta: -73.2MB). Peak memory consumption was 65.4MB. Max. memory is 16.1GB. * Witness Printer took 218.14ms. Allocated memory is still 239.1MB. Free memory was 137.4MB in the beginning and 119.5MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * 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: 2687]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 139 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1288 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1272 mSDsluCounter, 1967 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 739 mSDsCounter, 124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 731 IncrementalHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 124 mSolverCounterUnsat, 1228 mSDtfsCounter, 731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=391occurred in iteration=7, InterpolantAutomatonStates: 34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 329 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 3/3 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 1 specifications checked. All of them hold - InvariantResult [Line: 2172]: Location Invariant Derived location invariant: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3197]: Procedure Contract for mutex_unlock Derived contract for procedure mutex_unlock. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 2942]: Procedure Contract for ldv_mutex_lock_mtx_of_isl_pmic Derived contract for procedure ldv_mutex_lock_mtx_of_isl_pmic. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (1 == \old(ldv_mutex_mtx_of_isl_pmic))) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) - ProcedureContractResult [Line: 3158]: Procedure Contract for ldv_malloc Derived contract for procedure ldv_malloc. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 2684]: Procedure Contract for ldv_error Derived contract for procedure ldv_error. Requires: 0 Ensures: 0 - ProcedureContractResult [Line: 3214]: Procedure Contract for regulator_unregister Derived contract for procedure regulator_unregister. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3190]: Procedure Contract for mutex_lock Derived contract for procedure mutex_lock. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) - ProcedureContractResult [Line: 3000]: Procedure Contract for ldv_mutex_unlock_mtx_of_isl_pmic Derived contract for procedure ldv_mutex_unlock_mtx_of_isl_pmic. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (2 == \old(ldv_mutex_mtx_of_isl_pmic))) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3200]: Procedure Contract for rdev_get_drvdata Derived contract for procedure rdev_get_drvdata. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3204]: Procedure Contract for regulator_list_voltage_linear Derived contract for procedure regulator_list_voltage_linear. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) - ProcedureContractResult [Line: 3149]: Procedure Contract for dev_err Derived contract for procedure dev_err. Requires: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) || (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1))) Ensures: ((((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) || (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_mtx_of_isl_pmic == 2)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1))) - ProcedureContractResult [Line: 2172]: Procedure Contract for IS_ERR Derived contract for procedure IS_ERR. Requires: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) Ensures: (((((1 == ldv_mutex_mutex_of_device) && (ldv_retval_1 == 0)) && (ldv_mutex_lock == 1)) && (ldv_mutex_cred_guard_mutex_of_signal_struct == 1)) && (ldv_mutex_mtx_of_isl_pmic == 1)) RESULT: Ultimate proved your program to be correct! [2024-10-11 15:18:53,120 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