./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../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 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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.3.0-?-551b009-m [2025-01-09 18:22:58,410 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:22:58,477 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 18:22:58,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:22:58,481 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:22:58,495 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:22:58,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:22:58,496 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:22:58,496 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:22:58,496 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:22:58,496 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:22:58,496 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:22:58,496 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:22:58,496 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:22:58,496 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:22:58,497 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:22:58,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:22:58,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:22:58,498 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:22:58,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:22:58,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:22:58,499 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 [2025-01-09 18:22:58,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:22:58,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:22:58,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:22:58,723 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:22:58,723 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:22:58,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-01-09 18:22:59,886 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37b4b2fbc/fb7eaa31ed584021aeebbbc3e4e1459c/FLAGc7fb2ba5a [2025-01-09 18:23:00,278 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:23:00,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-01-09 18:23:00,301 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37b4b2fbc/fb7eaa31ed584021aeebbbc3e4e1459c/FLAGc7fb2ba5a [2025-01-09 18:23:00,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/37b4b2fbc/fb7eaa31ed584021aeebbbc3e4e1459c [2025-01-09 18:23:00,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:23:00,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:23:00,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:23:00,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:23:00,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:23:00,469 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:23:00" (1/1) ... [2025-01-09 18:23:00,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e92ffca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:00, skipping insertion in model container [2025-01-09 18:23:00,470 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:23:00" (1/1) ... [2025-01-09 18:23:00,512 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:23:00,873 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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] [2025-01-09 18:23:00,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:23:00,943 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:23:01,017 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/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] [2025-01-09 18:23:01,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:23:01,076 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:23:01,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01 WrapperNode [2025-01-09 18:23:01,079 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:23:01,080 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:23:01,080 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:23:01,080 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:23:01,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,102 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,145 INFO L138 Inliner]: procedures = 100, calls = 348, calls flagged for inlining = 40, calls inlined = 32, statements flattened = 802 [2025-01-09 18:23:01,145 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:23:01,146 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:23:01,146 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:23:01,146 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:23:01,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,162 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,231 INFO L175 MemorySlicer]: Split 228 memory accesses to 6 slices as follows [2, 12, 14, 65, 103, 32]. 45 percent of accesses are in the largest equivalence class. The 12 initializations are split as follows [2, 0, 0, 0, 10, 0]. The 204 writes are split as follows [0, 12, 2, 65, 93, 32]. [2025-01-09 18:23:01,233 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,233 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,257 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,259 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:23:01,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:23:01,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:23:01,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:23:01,284 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (1/1) ... [2025-01-09 18:23:01,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:23:01,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:23:01,314 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 18:23:01,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 18:23:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:23:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:23:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_list_voltage_linear [2025-01-09 18:23:01,340 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_list_voltage_linear [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:23:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:23:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:23:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:23:01,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2025-01-09 18:23:01,342 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2025-01-09 18:23:01,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-01-09 18:23:01,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure regulator_unregister [2025-01-09 18:23:01,343 INFO L138 BoogieDeclarations]: Found implementation of procedure regulator_unregister [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2025-01-09 18:23:01,343 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:23:01,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure rdev_get_drvdata [2025-01-09 18:23:01,344 INFO L138 BoogieDeclarations]: Found implementation of procedure rdev_get_drvdata [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:23:01,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-01-09 18:23:01,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 18:23:01,345 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-01-09 18:23:01,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:23:01,345 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:23:01,345 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:23:01,345 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:23:01,558 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:23:01,560 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:23:07,961 INFO L? ?]: Removed 261 outVars from TransFormulas that were not future-live. [2025-01-09 18:23:07,962 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:23:07,971 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:23:07,971 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 18:23:07,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:23:07 BoogieIcfgContainer [2025-01-09 18:23:07,971 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:23:07,973 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:23:07,973 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:23:07,976 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:23:07,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:23:00" (1/3) ... [2025-01-09 18:23:07,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53072629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:23:07, skipping insertion in model container [2025-01-09 18:23:07,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:23:01" (2/3) ... [2025-01-09 18:23:07,977 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53072629 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:23:07, skipping insertion in model container [2025-01-09 18:23:07,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:23:07" (3/3) ... [2025-01-09 18:23:07,978 INFO L128 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i [2025-01-09 18:23:07,986 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:23:07,989 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 32_7a_cilled_linux-3.8-rc1-drivers--regulator--isl6271a-regulator.ko-main.cil.out.i that has 12 procedures, 186 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 18:23:08,047 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:23:08,062 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;@1552cbc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:23:08,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:23:08,069 INFO L276 IsEmpty]: Start isEmpty. Operand has 186 states, 144 states have (on average 1.375) internal successors, (198), 152 states have internal predecessors, (198), 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) [2025-01-09 18:23:08,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-01-09 18:23:08,073 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:08,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:08,074 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:08,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:08,077 INFO L85 PathProgramCache]: Analyzing trace with hash 889455037, now seen corresponding path program 1 times [2025-01-09 18:23:08,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:08,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071559087] [2025-01-09 18:23:08,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:08,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:10,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-09 18:23:10,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-09 18:23:10,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:10,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:10,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:23:10,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:10,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071559087] [2025-01-09 18:23:10,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071559087] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:10,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:10,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:10,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708178126] [2025-01-09 18:23:10,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:10,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:10,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:10,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:10,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:10,742 INFO L87 Difference]: Start difference. First operand has 186 states, 144 states have (on average 1.375) internal successors, (198), 152 states have internal predecessors, (198), 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 4.666666666666667) internal successors, (14), 3 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) [2025-01-09 18:23:14,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:23:15,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:15,369 INFO L93 Difference]: Finished difference Result 530 states and 754 transitions. [2025-01-09 18:23:15,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:15,371 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 [2025-01-09 18:23:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:15,376 INFO L225 Difference]: With dead ends: 530 [2025-01-09 18:23:15,376 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 18:23:15,379 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:15,380 INFO L435 NwaCegarLoop]: 247 mSDtfsCounter, 216 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:15,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 480 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 18:23:15,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 18:23:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 339. [2025-01-09 18:23:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.3571428571428572) internal successors, (361), 273 states have internal predecessors, (361), 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) [2025-01-09 18:23:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 459 transitions. [2025-01-09 18:23:15,439 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 459 transitions. Word has length 15 [2025-01-09 18:23:15,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:15,439 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 459 transitions. [2025-01-09 18:23:15,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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) [2025-01-09 18:23:15,440 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 459 transitions. [2025-01-09 18:23:15,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 18:23:15,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:15,441 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:15,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 18:23:15,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:15,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash -480061528, now seen corresponding path program 1 times [2025-01-09 18:23:15,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:15,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696358448] [2025-01-09 18:23:15,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:15,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:17,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 18:23:17,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 18:23:17,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:17,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:17,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:23:17,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:17,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696358448] [2025-01-09 18:23:17,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696358448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:17,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:17,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:17,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12697230] [2025-01-09 18:23:17,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:17,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:17,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:17,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:17,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:17,328 INFO L87 Difference]: Start difference. First operand 339 states and 459 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-01-09 18:23:17,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:17,420 INFO L93 Difference]: Finished difference Result 361 states and 485 transitions. [2025-01-09 18:23:17,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:17,421 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2025-01-09 18:23:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:17,424 INFO L225 Difference]: With dead ends: 361 [2025-01-09 18:23:17,424 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 18:23:17,424 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:17,425 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 238 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:17,425 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 268 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:23:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 18:23:17,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 339. [2025-01-09 18:23:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 266 states have (on average 1.3533834586466165) internal successors, (360), 273 states have internal predecessors, (360), 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) [2025-01-09 18:23:17,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 458 transitions. [2025-01-09 18:23:17,441 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 458 transitions. Word has length 18 [2025-01-09 18:23:17,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:17,441 INFO L471 AbstractCegarLoop]: Abstraction has 339 states and 458 transitions. [2025-01-09 18:23:17,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-01-09 18:23:17,442 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 458 transitions. [2025-01-09 18:23:17,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-01-09 18:23:17,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:17,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:17,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:23:17,443 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:17,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash -422803226, now seen corresponding path program 1 times [2025-01-09 18:23:17,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:17,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528945974] [2025-01-09 18:23:17,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:19,155 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-09 18:23:19,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-09 18:23:19,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:19,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:19,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:23:19,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:19,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528945974] [2025-01-09 18:23:19,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528945974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:19,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:19,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:19,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020105578] [2025-01-09 18:23:19,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:19,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:19,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:19,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:19,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:19,353 INFO L87 Difference]: Start difference. First operand 339 states and 458 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-01-09 18:23:23,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:23:23,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:23,796 INFO L93 Difference]: Finished difference Result 341 states and 459 transitions. [2025-01-09 18:23:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:23,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 18 [2025-01-09 18:23:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:23,798 INFO L225 Difference]: With dead ends: 341 [2025-01-09 18:23:23,798 INFO L226 Difference]: Without dead ends: 338 [2025-01-09 18:23:23,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:23,803 INFO L435 NwaCegarLoop]: 240 mSDtfsCounter, 226 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:23,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 240 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 18:23:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2025-01-09 18:23:23,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2025-01-09 18:23:23,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 266 states have (on average 1.349624060150376) internal successors, (359), 272 states have internal predecessors, (359), 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) [2025-01-09 18:23:23,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 456 transitions. [2025-01-09 18:23:23,827 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 456 transitions. Word has length 18 [2025-01-09 18:23:23,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:23,827 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 456 transitions. [2025-01-09 18:23:23,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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) [2025-01-09 18:23:23,827 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 456 transitions. [2025-01-09 18:23:23,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 18:23:23,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:23,830 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:23,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:23:23,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:23,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:23,831 INFO L85 PathProgramCache]: Analyzing trace with hash -222115821, now seen corresponding path program 1 times [2025-01-09 18:23:23,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:23,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973130702] [2025-01-09 18:23:23,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:23,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:25,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 18:23:25,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 18:23:25,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:25,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:25,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:23:25,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:25,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973130702] [2025-01-09 18:23:25,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973130702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:25,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:25,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:25,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729957202] [2025-01-09 18:23:25,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:25,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:25,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:25,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:25,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:25,681 INFO L87 Difference]: Start difference. First operand 338 states and 456 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2025-01-09 18:23:29,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:23:30,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:30,122 INFO L93 Difference]: Finished difference Result 340 states and 457 transitions. [2025-01-09 18:23:30,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:30,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 19 [2025-01-09 18:23:30,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:30,124 INFO L225 Difference]: With dead ends: 340 [2025-01-09 18:23:30,124 INFO L226 Difference]: Without dead ends: 337 [2025-01-09 18:23:30,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:30,127 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:30,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 238 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2025-01-09 18:23:30,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-01-09 18:23:30,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-01-09 18:23:30,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.3458646616541354) internal successors, (358), 271 states have internal predecessors, (358), 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) [2025-01-09 18:23:30,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 454 transitions. [2025-01-09 18:23:30,144 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 454 transitions. Word has length 19 [2025-01-09 18:23:30,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:30,144 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 454 transitions. [2025-01-09 18:23:30,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2025-01-09 18:23:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 454 transitions. [2025-01-09 18:23:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-01-09 18:23:30,145 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:30,145 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:30,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:23:30,145 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1704231305, now seen corresponding path program 1 times [2025-01-09 18:23:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:30,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464629599] [2025-01-09 18:23:30,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:31,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-01-09 18:23:31,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-01-09 18:23:31,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:31,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:23:31,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:31,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464629599] [2025-01-09 18:23:31,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464629599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:31,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:31,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:31,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27997294] [2025-01-09 18:23:31,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:31,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:31,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:31,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:31,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:31,881 INFO L87 Difference]: Start difference. First operand 337 states and 454 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-01-09 18:23:35,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:23:36,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:36,398 INFO L93 Difference]: Finished difference Result 347 states and 460 transitions. [2025-01-09 18:23:36,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:36,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 20 [2025-01-09 18:23:36,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:36,401 INFO L225 Difference]: With dead ends: 347 [2025-01-09 18:23:36,401 INFO L226 Difference]: Without dead ends: 343 [2025-01-09 18:23:36,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:36,402 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 185 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:36,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 267 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 18:23:36,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2025-01-09 18:23:36,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2025-01-09 18:23:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 270 states have (on average 1.3296296296296297) internal successors, (359), 273 states have internal predecessors, (359), 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) [2025-01-09 18:23:36,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 453 transitions. [2025-01-09 18:23:36,420 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 453 transitions. Word has length 20 [2025-01-09 18:23:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:36,420 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 453 transitions. [2025-01-09 18:23:36,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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) [2025-01-09 18:23:36,421 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 453 transitions. [2025-01-09 18:23:36,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 18:23:36,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:36,421 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:36,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:23:36,422 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:36,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:36,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1291454934, now seen corresponding path program 1 times [2025-01-09 18:23:36,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675073580] [2025-01-09 18:23:36,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:36,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:38,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 18:23:38,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 18:23:38,061 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:38,061 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:38,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:23:38,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:38,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675073580] [2025-01-09 18:23:38,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675073580] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:38,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:38,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:38,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820350382] [2025-01-09 18:23:38,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:38,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:38,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:38,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:38,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:38,231 INFO L87 Difference]: Start difference. First operand 341 states and 453 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2025-01-09 18:23:42,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:23:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:42,269 INFO L93 Difference]: Finished difference Result 343 states and 454 transitions. [2025-01-09 18:23:42,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:42,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 21 [2025-01-09 18:23:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:42,661 INFO L225 Difference]: With dead ends: 343 [2025-01-09 18:23:42,661 INFO L226 Difference]: Without dead ends: 333 [2025-01-09 18:23:42,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:42,662 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 215 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:42,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 233 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 18:23:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2025-01-09 18:23:42,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2025-01-09 18:23:42,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 265 states have internal predecessors, (350), 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) [2025-01-09 18:23:42,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 443 transitions. [2025-01-09 18:23:42,673 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 443 transitions. Word has length 21 [2025-01-09 18:23:42,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:42,674 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 443 transitions. [2025-01-09 18:23:42,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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) [2025-01-09 18:23:42,674 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 443 transitions. [2025-01-09 18:23:42,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-01-09 18:23:42,675 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:42,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:42,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:23:42,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:42,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:42,675 INFO L85 PathProgramCache]: Analyzing trace with hash -311253703, now seen corresponding path program 1 times [2025-01-09 18:23:42,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:42,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501397429] [2025-01-09 18:23:42,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:42,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:44,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 18:23:44,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 18:23:44,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:44,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:44,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 18:23:44,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:44,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501397429] [2025-01-09 18:23:44,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501397429] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:44,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:44,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819192061] [2025-01-09 18:23:44,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:44,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:44,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:44,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:44,417 INFO L87 Difference]: Start difference. First operand 333 states and 443 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 18:23:44,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:44,654 INFO L93 Difference]: Finished difference Result 859 states and 1150 transitions. [2025-01-09 18:23:44,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:44,654 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 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 42 [2025-01-09 18:23:44,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:44,656 INFO L225 Difference]: With dead ends: 859 [2025-01-09 18:23:44,656 INFO L226 Difference]: Without dead ends: 529 [2025-01-09 18:23:44,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:44,657 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 132 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:44,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 436 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:23:44,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2025-01-09 18:23:44,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 529. [2025-01-09 18:23:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 431 states have (on average 1.3433874709976799) internal successors, (579), 435 states have internal predecessors, (579), 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) [2025-01-09 18:23:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 708 transitions. [2025-01-09 18:23:44,674 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 708 transitions. Word has length 42 [2025-01-09 18:23:44,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:44,674 INFO L471 AbstractCegarLoop]: Abstraction has 529 states and 708 transitions. [2025-01-09 18:23:44,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 18:23:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 708 transitions. [2025-01-09 18:23:44,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-09 18:23:44,676 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:23:44,676 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:44,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 18:23:44,676 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:23:44,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:23:44,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1030371787, now seen corresponding path program 1 times [2025-01-09 18:23:44,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:23:44,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785648874] [2025-01-09 18:23:44,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:23:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:23:46,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 18:23:46,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 18:23:46,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:23:46,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:23:46,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 18:23:46,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:23:46,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785648874] [2025-01-09 18:23:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785648874] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:23:46,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:23:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:23:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914343112] [2025-01-09 18:23:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:23:46,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:23:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:23:46,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:23:46,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:46,577 INFO L87 Difference]: Start difference. First operand 529 states and 708 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 18:23:50,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:23:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:23:51,069 INFO L93 Difference]: Finished difference Result 529 states and 708 transitions. [2025-01-09 18:23:51,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:23:51,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 3 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 53 [2025-01-09 18:23:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:23:51,070 INFO L225 Difference]: With dead ends: 529 [2025-01-09 18:23:51,070 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 18:23:51,071 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:23:51,071 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 22 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-09 18:23:51,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 409 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.5s Time] [2025-01-09 18:23:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 18:23:51,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 18:23:51,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 18:23:51,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 18:23:51,072 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2025-01-09 18:23:51,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:23:51,072 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 18:23:51,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-09 18:23:51,072 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 18:23:51,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 18:23:51,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 18:23:51,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 18:23:51,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 18:23:51,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-09 18:24:22,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 18:24:23,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 06:24:23 BoogieIcfgContainer [2025-01-09 18:24:23,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 18:24:23,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 18:24:23,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 18:24:23,009 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 18:24:23,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:23:07" (3/4) ... [2025-01-09 18:24:23,013 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 18:24:23,017 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_unlock [2025-01-09 18:24:23,017 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_lock_mtx_of_isl_pmic [2025-01-09 18:24:23,017 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-01-09 18:24:23,017 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-01-09 18:24:23,017 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_unregister [2025-01-09 18:24:23,017 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure mutex_lock [2025-01-09 18:24:23,018 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_mutex_unlock_mtx_of_isl_pmic [2025-01-09 18:24:23,018 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure rdev_get_drvdata [2025-01-09 18:24:23,018 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure regulator_list_voltage_linear [2025-01-09 18:24:23,021 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_err [2025-01-09 18:24:23,021 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure IS_ERR [2025-01-09 18:24:23,029 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 68 nodes and edges [2025-01-09 18:24:23,030 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-01-09 18:24:23,031 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-01-09 18:24:23,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 18:24:23,032 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 18:24:23,150 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 18:24:23,150 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 18:24:23,150 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 18:24:23,151 INFO L158 Benchmark]: Toolchain (without parser) took 82685.68ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 108.4MB in the beginning and 947.7MB in the end (delta: -839.3MB). Peak memory consumption was 678.1MB. Max. memory is 16.1GB. [2025-01-09 18:24:23,151 INFO L158 Benchmark]: CDTParser took 0.80ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 18:24:23,151 INFO L158 Benchmark]: CACSL2BoogieTranslator took 613.06ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 50.8MB in the end (delta: 57.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 18:24:23,152 INFO L158 Benchmark]: Boogie Procedure Inliner took 65.64ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 45.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 18:24:23,152 INFO L158 Benchmark]: Boogie Preprocessor took 136.54ms. Allocated memory is still 142.6MB. Free memory was 45.1MB in the beginning and 99.8MB in the end (delta: -54.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2025-01-09 18:24:23,153 INFO L158 Benchmark]: RCFGBuilder took 6688.74ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 80.5MB in the end (delta: 19.3MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. [2025-01-09 18:24:23,153 INFO L158 Benchmark]: TraceAbstraction took 75035.94ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 79.6MB in the beginning and 964.5MB in the end (delta: -884.8MB). Peak memory consumption was 631.5MB. Max. memory is 16.1GB. [2025-01-09 18:24:23,153 INFO L158 Benchmark]: Witness Printer took 141.02ms. Allocated memory is still 1.7GB. Free memory was 964.5MB in the beginning and 947.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 18:24:23,154 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.80ms. Allocated memory is still 201.3MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 613.06ms. Allocated memory is still 142.6MB. Free memory was 108.4MB in the beginning and 50.8MB in the end (delta: 57.6MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 65.64ms. Allocated memory is still 142.6MB. Free memory was 50.8MB in the beginning and 45.1MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 136.54ms. Allocated memory is still 142.6MB. Free memory was 45.1MB in the beginning and 99.8MB in the end (delta: -54.7MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * RCFGBuilder took 6688.74ms. Allocated memory is still 142.6MB. Free memory was 99.8MB in the beginning and 80.5MB in the end (delta: 19.3MB). Peak memory consumption was 70.0MB. Max. memory is 16.1GB. * TraceAbstraction took 75035.94ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 79.6MB in the beginning and 964.5MB in the end (delta: -884.8MB). Peak memory consumption was 631.5MB. Max. memory is 16.1GB. * Witness Printer took 141.02ms. Allocated memory is still 1.7GB. Free memory was 964.5MB in the beginning and 947.7MB in the end (delta: 16.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, 186 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.1s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 1457 SdHoareTripleChecker+Valid, 26.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1457 mSDsluCounter, 2571 SdHoareTripleChecker+Invalid, 24.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 673 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 42 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1898 mSDtfsCounter, 42 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=529occurred in iteration=7, InterpolantAutomatonStates: 24, 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, 17 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 366 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 18:24:23,289 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE