./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.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-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.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 aa00a102435cd9be2574d2e777aad2e91126f080f8422a74b94328a4b8d020d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 18:39:11,003 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 18:39:11,067 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:39:11,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 18:39:11,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 18:39:11,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 18:39:11,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 18:39:11,096 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 18:39:11,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 18:39:11,097 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 18:39:11,097 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 18:39:11,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 18:39:11,098 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 18:39:11,098 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 18:39:11,098 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 18:39:11,099 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 18:39:11,099 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 18:39:11,099 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:39:11,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:39:11,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:39:11,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:39:11,100 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 18:39:11,100 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 18:39:11,100 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 18:39:11,100 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 18:39:11,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:39:11,101 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 18:39:11,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 18:39:11,101 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 -> aa00a102435cd9be2574d2e777aad2e91126f080f8422a74b94328a4b8d020d8 [2025-01-09 18:39:11,330 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 18:39:11,344 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 18:39:11,346 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 18:39:11,347 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 18:39:11,347 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 18:39:11,348 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-01-09 18:39:12,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50c784df1/5d7e922f8edd4579b7242f80297a67df/FLAGec30b7932 [2025-01-09 18:39:12,948 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 18:39:12,949 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-01-09 18:39:12,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50c784df1/5d7e922f8edd4579b7242f80297a67df/FLAGec30b7932 [2025-01-09 18:39:13,059 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/50c784df1/5d7e922f8edd4579b7242f80297a67df [2025-01-09 18:39:13,061 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 18:39:13,062 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 18:39:13,063 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 18:39:13,063 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 18:39:13,068 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 18:39:13,068 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:39:13" (1/1) ... [2025-01-09 18:39:13,069 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b4583ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:13, skipping insertion in model container [2025-01-09 18:39:13,069 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 06:39:13" (1/1) ... [2025-01-09 18:39:13,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 18:39:13,784 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-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] [2025-01-09 18:39:13,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:39:13,835 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 18:39:13,891 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapl %0": "=r" (val): "0" (val)); [2762] [2025-01-09 18:39:13,892 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("bswapq %0": "=r" (val): "0" (val)); [2769] [2025-01-09 18:39:13,956 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-validator-v0.8/linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i[120657,120670] [2025-01-09 18:39:13,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 18:39:14,018 INFO L204 MainTranslator]: Completed translation [2025-01-09 18:39:14,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14 WrapperNode [2025-01-09 18:39:14,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 18:39:14,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 18:39:14,021 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 18:39:14,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 18:39:14,025 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:39:14" (1/1) ... [2025-01-09 18:39:14,051 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:39:14" (1/1) ... [2025-01-09 18:39:14,100 INFO L138 Inliner]: procedures = 150, calls = 795, calls flagged for inlining = 63, calls inlined = 45, statements flattened = 1727 [2025-01-09 18:39:14,101 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 18:39:14,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 18:39:14,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 18:39:14,101 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 18:39:14,107 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,117 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,274 INFO L175 MemorySlicer]: Split 400 memory accesses to 11 slices as follows [2, 54, 4, 4, 14, 27, 1, 8, 9, 267, 10]. 67 percent of accesses are in the largest equivalence class. The 84 initializations are split as follows [2, 9, 4, 0, 14, 8, 0, 8, 3, 26, 10]. The 187 writes are split as follows [0, 41, 0, 2, 0, 14, 0, 0, 0, 130, 0]. [2025-01-09 18:39:14,274 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,275 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,303 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,315 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 18:39:14,327 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 18:39:14,327 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 18:39:14,327 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 18:39:14,327 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (1/1) ... [2025-01-09 18:39:14,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 18:39:14,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:14,355 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:39:14,360 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:39:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2025-01-09 18:39:14,374 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2025-01-09 18:39:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-01-09 18:39:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-01-09 18:39:14,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure _dev_info [2025-01-09 18:39:14,375 INFO L138 BoogieDeclarations]: Found implementation of procedure _dev_info [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2025-01-09 18:39:14,375 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-01-09 18:39:14,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-01-09 18:39:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2025-01-09 18:39:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure aem_init_ipmi_data [2025-01-09 18:39:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_init_ipmi_data [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure wait_for_completion_timeout [2025-01-09 18:39:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure wait_for_completion_timeout [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-01-09 18:39:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-01-09 18:39:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2025-01-09 18:39:14,376 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 18:39:14,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2025-01-09 18:39:14,377 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2025-01-09 18:39:14,377 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2025-01-09 18:39:14,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2025-01-09 18:39:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 18:39:14,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 18:39:14,379 INFO L130 BoogieDeclarations]: Found specification of procedure aem_delete [2025-01-09 18:39:14,379 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_delete [2025-01-09 18:39:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 18:39:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2025-01-09 18:39:14,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2025-01-09 18:39:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_device_create_file [2025-01-09 18:39:14,380 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_device_create_file [2025-01-09 18:39:14,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_get [2025-01-09 18:39:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_get [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_destroy_user [2025-01-09 18:39:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_destroy_user [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2025-01-09 18:39:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2025-01-09 18:39:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2025-01-09 18:39:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2025-01-09 18:39:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_kzalloc_6 [2025-01-09 18:39:14,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_kzalloc_6 [2025-01-09 18:39:14,381 INFO L130 BoogieDeclarations]: Found specification of procedure aem_send_message [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_send_message [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure driver_unregister [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure driver_unregister [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure aem_register_sensors [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_register_sensors [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure aem_idr_put [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_idr_put [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2025-01-09 18:39:14,382 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 18:39:14,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure ipmi_free_recv_msg [2025-01-09 18:39:14,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ipmi_free_recv_msg [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-01-09 18:39:14,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2025-01-09 18:39:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 18:39:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure aem_remove_sensors [2025-01-09 18:39:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure aem_remove_sensors [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2025-01-09 18:39:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2025-01-09 18:39:14,386 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2025-01-09 18:39:14,386 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2025-01-09 18:39:14,688 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 18:39:14,691 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 18:39:14,735 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-01-09 18:39:21,024 INFO L? ?]: Removed 609 outVars from TransFormulas that were not future-live. [2025-01-09 18:39:21,025 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 18:39:21,036 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 18:39:21,037 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 18:39:21,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:39:21 BoogieIcfgContainer [2025-01-09 18:39:21,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 18:39:21,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 18:39:21,043 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 18:39:21,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 18:39:21,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 06:39:13" (1/3) ... [2025-01-09 18:39:21,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bba0004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:39:21, skipping insertion in model container [2025-01-09 18:39:21,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 06:39:14" (2/3) ... [2025-01-09 18:39:21,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bba0004 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 06:39:21, skipping insertion in model container [2025-01-09 18:39:21,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 06:39:21" (3/3) ... [2025-01-09 18:39:21,048 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i [2025-01-09 18:39:21,057 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 18:39:21,060 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-stable-4ee267b-1-130_7a-drivers--hwmon--ibmaem.ko-entry_point_ldv-val-v0.8.cil.out.i that has 39 procedures, 500 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 18:39:21,098 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 18:39:21,106 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;@6c5b5018, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 18:39:21,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 18:39:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 499 states, 347 states have (on average 1.2708933717579252) internal successors, (441), 360 states have internal predecessors, (441), 113 states have call successors, (113), 38 states have call predecessors, (113), 37 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) [2025-01-09 18:39:21,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-01-09 18:39:21,129 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:21,129 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:21,130 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:21,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1973896858, now seen corresponding path program 1 times [2025-01-09 18:39:21,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:21,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967843978] [2025-01-09 18:39:21,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:21,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:21,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 18:39:22,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 18:39:22,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:22,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2025-01-09 18:39:22,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:22,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967843978] [2025-01-09 18:39:22,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967843978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:39:22,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328216190] [2025-01-09 18:39:22,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:22,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:22,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:22,347 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:39:22,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 18:39:23,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-01-09 18:39:23,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-01-09 18:39:23,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:23,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:23,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 3498 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 18:39:23,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:39:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2025-01-09 18:39:23,819 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:39:23,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328216190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:23,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:39:23,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 18:39:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100624721] [2025-01-09 18:39:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:23,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 18:39:23,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:23,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 18:39:23,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:39:23,840 INFO L87 Difference]: Start difference. First operand has 499 states, 347 states have (on average 1.2708933717579252) internal successors, (441), 360 states have internal predecessors, (441), 113 states have call successors, (113), 38 states have call predecessors, (113), 37 states have return successors, (107), 107 states have call predecessors, (107), 107 states have call successors, (107) Second operand has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:39:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:23,892 INFO L93 Difference]: Finished difference Result 994 states and 1348 transitions. [2025-01-09 18:39:23,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 18:39:23,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 297 [2025-01-09 18:39:23,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:23,900 INFO L225 Difference]: With dead ends: 994 [2025-01-09 18:39:23,901 INFO L226 Difference]: Without dead ends: 479 [2025-01-09 18:39:23,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 18:39:23,912 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:23,915 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:39:23,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2025-01-09 18:39:23,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 479. [2025-01-09 18:39:23,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 336 states have (on average 1.2470238095238095) internal successors, (419), 342 states have internal predecessors, (419), 105 states have call successors, (105), 37 states have call predecessors, (105), 37 states have return successors, (105), 105 states have call predecessors, (105), 105 states have call successors, (105) [2025-01-09 18:39:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 629 transitions. [2025-01-09 18:39:23,962 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 629 transitions. Word has length 297 [2025-01-09 18:39:23,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:23,963 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 629 transitions. [2025-01-09 18:39:23,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 62.0) internal successors, (124), 2 states have internal predecessors, (124), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:39:23,964 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 629 transitions. [2025-01-09 18:39:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-01-09 18:39:23,973 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:23,973 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:23,988 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 18:39:24,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 18:39:24,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:24,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:24,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1602422449, now seen corresponding path program 1 times [2025-01-09 18:39:24,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:24,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838351746] [2025-01-09 18:39:24,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:24,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:24,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-01-09 18:39:24,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-01-09 18:39:24,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:24,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2025-01-09 18:39:25,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:25,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838351746] [2025-01-09 18:39:25,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838351746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:25,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:39:25,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:39:25,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74392433] [2025-01-09 18:39:25,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:25,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:39:25,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:25,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:39:25,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:39:25,087 INFO L87 Difference]: Start difference. First operand 479 states and 629 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:39:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:25,226 INFO L93 Difference]: Finished difference Result 996 states and 1306 transitions. [2025-01-09 18:39:25,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:39:25,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 296 [2025-01-09 18:39:25,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:25,235 INFO L225 Difference]: With dead ends: 996 [2025-01-09 18:39:25,236 INFO L226 Difference]: Without dead ends: 554 [2025-01-09 18:39:25,237 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:39:25,238 INFO L435 NwaCegarLoop]: 643 mSDtfsCounter, 138 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1211 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:25,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1211 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:39:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2025-01-09 18:39:25,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 554. [2025-01-09 18:39:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 554 states, 396 states have (on average 1.2601010101010102) internal successors, (499), 402 states have internal predecessors, (499), 113 states have call successors, (113), 44 states have call predecessors, (113), 44 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-01-09 18:39:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 725 transitions. [2025-01-09 18:39:25,284 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 725 transitions. Word has length 296 [2025-01-09 18:39:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:25,284 INFO L471 AbstractCegarLoop]: Abstraction has 554 states and 725 transitions. [2025-01-09 18:39:25,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:39:25,285 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 725 transitions. [2025-01-09 18:39:25,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2025-01-09 18:39:25,291 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:25,291 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:25,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 18:39:25,292 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:25,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:25,292 INFO L85 PathProgramCache]: Analyzing trace with hash -542274140, now seen corresponding path program 1 times [2025-01-09 18:39:25,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:25,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354613939] [2025-01-09 18:39:25,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:25,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:25,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 18:39:25,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 18:39:25,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:25,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 523 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 523 trivial. 0 not checked. [2025-01-09 18:39:26,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:26,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354613939] [2025-01-09 18:39:26,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354613939] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:26,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:39:26,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:39:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897861936] [2025-01-09 18:39:26,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:39:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:26,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:39:26,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:39:26,320 INFO L87 Difference]: Start difference. First operand 554 states and 725 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:39:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:26,378 INFO L93 Difference]: Finished difference Result 1070 states and 1402 transitions. [2025-01-09 18:39:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:39:26,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 308 [2025-01-09 18:39:26,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:26,382 INFO L225 Difference]: With dead ends: 1070 [2025-01-09 18:39:26,382 INFO L226 Difference]: Without dead ends: 556 [2025-01-09 18:39:26,383 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:39:26,384 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:26,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:39:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2025-01-09 18:39:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 555. [2025-01-09 18:39:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 397 states have (on average 1.2594458438287153) internal successors, (500), 403 states have internal predecessors, (500), 113 states have call successors, (113), 44 states have call predecessors, (113), 44 states have return successors, (113), 113 states have call predecessors, (113), 113 states have call successors, (113) [2025-01-09 18:39:26,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 726 transitions. [2025-01-09 18:39:26,403 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 726 transitions. Word has length 308 [2025-01-09 18:39:26,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:26,404 INFO L471 AbstractCegarLoop]: Abstraction has 555 states and 726 transitions. [2025-01-09 18:39:26,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-01-09 18:39:26,404 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 726 transitions. [2025-01-09 18:39:26,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2025-01-09 18:39:26,408 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:26,408 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:26,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 18:39:26,408 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:26,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:26,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1280992752, now seen corresponding path program 1 times [2025-01-09 18:39:26,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517076546] [2025-01-09 18:39:26,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:26,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 311 statements into 1 equivalence classes. [2025-01-09 18:39:27,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 311 of 311 statements. [2025-01-09 18:39:27,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:27,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:27,932 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 524 trivial. 0 not checked. [2025-01-09 18:39:27,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:27,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517076546] [2025-01-09 18:39:27,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517076546] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:27,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:39:27,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:39:27,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399832776] [2025-01-09 18:39:27,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:27,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:39:27,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:27,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:39:27,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:39:27,934 INFO L87 Difference]: Start difference. First operand 555 states and 726 transitions. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-01-09 18:39:31,957 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:39:36,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:39:38,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:38,320 INFO L93 Difference]: Finished difference Result 1585 states and 2089 transitions. [2025-01-09 18:39:38,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:39:38,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) Word has length 311 [2025-01-09 18:39:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:38,328 INFO L225 Difference]: With dead ends: 1585 [2025-01-09 18:39:38,328 INFO L226 Difference]: Without dead ends: 1583 [2025-01-09 18:39:38,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:39:38,329 INFO L435 NwaCegarLoop]: 675 mSDtfsCounter, 1119 mSDsluCounter, 1432 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 2107 SdHoareTripleChecker+Invalid, 461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:38,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 2107 Invalid, 461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 459 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2025-01-09 18:39:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2025-01-09 18:39:38,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1583. [2025-01-09 18:39:38,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1142 states have (on average 1.2670753064798599) internal successors, (1447), 1160 states have internal predecessors, (1447), 313 states have call successors, (313), 127 states have call predecessors, (313), 127 states have return successors, (327), 313 states have call predecessors, (327), 313 states have call successors, (327) [2025-01-09 18:39:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2087 transitions. [2025-01-09 18:39:38,375 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2087 transitions. Word has length 311 [2025-01-09 18:39:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:38,376 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2087 transitions. [2025-01-09 18:39:38,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (30), 3 states have call predecessors, (30), 3 states have call successors, (30) [2025-01-09 18:39:38,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2087 transitions. [2025-01-09 18:39:38,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-09 18:39:38,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:38,387 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:38,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 18:39:38,387 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:38,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1943521491, now seen corresponding path program 1 times [2025-01-09 18:39:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40359192] [2025-01-09 18:39:38,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:38,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-09 18:39:38,972 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-09 18:39:38,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:38,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:39,330 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2025-01-09 18:39:39,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:39,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40359192] [2025-01-09 18:39:39,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40359192] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:39,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:39:39,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 18:39:39,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714146852] [2025-01-09 18:39:39,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:39,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:39:39,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:39,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:39:39,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:39:39,332 INFO L87 Difference]: Start difference. First operand 1583 states and 2087 transitions. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:39:39,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:39,432 INFO L93 Difference]: Finished difference Result 3134 states and 4138 transitions. [2025-01-09 18:39:39,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 18:39:39,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 329 [2025-01-09 18:39:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:39,439 INFO L225 Difference]: With dead ends: 3134 [2025-01-09 18:39:39,439 INFO L226 Difference]: Without dead ends: 1595 [2025-01-09 18:39:39,443 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:39:39,486 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1873 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:39,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2500 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 18:39:39,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1595 states. [2025-01-09 18:39:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1595 to 1595. [2025-01-09 18:39:39,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1595 states, 1151 states have (on average 1.26498696785404) internal successors, (1456), 1169 states have internal predecessors, (1456), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:39:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 2102 transitions. [2025-01-09 18:39:39,533 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 2102 transitions. Word has length 329 [2025-01-09 18:39:39,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:39,534 INFO L471 AbstractCegarLoop]: Abstraction has 1595 states and 2102 transitions. [2025-01-09 18:39:39,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 4 states have internal predecessors, (141), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-01-09 18:39:39,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 2102 transitions. [2025-01-09 18:39:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 18:39:39,538 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:39,538 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:39,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 18:39:39,538 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:39,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:39,539 INFO L85 PathProgramCache]: Analyzing trace with hash -222880935, now seen corresponding path program 1 times [2025-01-09 18:39:39,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:39,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758947011] [2025-01-09 18:39:39,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:39,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:40,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 18:39:40,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 18:39:40,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:40,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:40,414 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2025-01-09 18:39:40,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:40,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758947011] [2025-01-09 18:39:40,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758947011] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:40,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:39:40,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:39:40,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081823295] [2025-01-09 18:39:40,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:40,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:39:40,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:40,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:39:40,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:39:40,415 INFO L87 Difference]: Start difference. First operand 1595 states and 2102 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 18:39:40,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:40,504 INFO L93 Difference]: Finished difference Result 3152 states and 4159 transitions. [2025-01-09 18:39:40,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:39:40,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 346 [2025-01-09 18:39:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:40,515 INFO L225 Difference]: With dead ends: 3152 [2025-01-09 18:39:40,515 INFO L226 Difference]: Without dead ends: 1601 [2025-01-09 18:39:40,520 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:39:40,521 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:40,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:39:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2025-01-09 18:39:40,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1598. [2025-01-09 18:39:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1598 states, 1154 states have (on average 1.2642980935875217) internal successors, (1459), 1172 states have internal predecessors, (1459), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:39:40,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1598 states to 1598 states and 2105 transitions. [2025-01-09 18:39:40,602 INFO L78 Accepts]: Start accepts. Automaton has 1598 states and 2105 transitions. Word has length 346 [2025-01-09 18:39:40,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:40,602 INFO L471 AbstractCegarLoop]: Abstraction has 1598 states and 2105 transitions. [2025-01-09 18:39:40,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 18:39:40,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1598 states and 2105 transitions. [2025-01-09 18:39:40,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 18:39:40,609 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:40,609 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:40,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 18:39:40,609 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:40,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:40,610 INFO L85 PathProgramCache]: Analyzing trace with hash 831068044, now seen corresponding path program 1 times [2025-01-09 18:39:40,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:40,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048771245] [2025-01-09 18:39:40,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:40,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:41,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 18:39:41,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 18:39:41,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:41,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:42,360 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:39:42,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048771245] [2025-01-09 18:39:42,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048771245] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:39:42,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958650246] [2025-01-09 18:39:42,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:42,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:42,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:42,364 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:39:42,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 18:39:43,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 18:39:43,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 18:39:43,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:43,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:43,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 3760 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:39:43,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:39:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:39:43,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:39:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [958650246] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:43,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:39:43,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-01-09 18:39:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441547448] [2025-01-09 18:39:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:43,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:39:43,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:43,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:39:43,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:39:43,816 INFO L87 Difference]: Start difference. First operand 1598 states and 2105 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 18:39:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:44,455 INFO L93 Difference]: Finished difference Result 3158 states and 4165 transitions. [2025-01-09 18:39:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:39:44,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 353 [2025-01-09 18:39:44,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:44,461 INFO L225 Difference]: With dead ends: 3158 [2025-01-09 18:39:44,462 INFO L226 Difference]: Without dead ends: 1604 [2025-01-09 18:39:44,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 354 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:39:44,465 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:44,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1871 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 18:39:44,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1604 states. [2025-01-09 18:39:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1604 to 1604. [2025-01-09 18:39:44,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1604 states, 1160 states have (on average 1.2629310344827587) internal successors, (1465), 1178 states have internal predecessors, (1465), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:39:44,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 2111 transitions. [2025-01-09 18:39:44,506 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 2111 transitions. Word has length 353 [2025-01-09 18:39:44,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:44,506 INFO L471 AbstractCegarLoop]: Abstraction has 1604 states and 2111 transitions. [2025-01-09 18:39:44,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 18:39:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 2111 transitions. [2025-01-09 18:39:44,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-01-09 18:39:44,512 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:44,513 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:44,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 18:39:44,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:44,714 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:44,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:44,714 INFO L85 PathProgramCache]: Analyzing trace with hash 672402133, now seen corresponding path program 1 times [2025-01-09 18:39:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044386306] [2025-01-09 18:39:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:45,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 18:39:45,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 18:39:45,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:45,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:39:45,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:45,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044386306] [2025-01-09 18:39:45,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044386306] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:39:45,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726674239] [2025-01-09 18:39:45,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:45,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:45,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:45,518 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:39:45,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 18:39:46,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 18:39:46,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 18:39:46,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:46,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:47,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 3901 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:39:47,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:39:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-01-09 18:39:47,112 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:39:47,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726674239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:47,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:39:47,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 18:39:47,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095039669] [2025-01-09 18:39:47,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:47,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:39:47,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:47,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:39:47,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:39:47,113 INFO L87 Difference]: Start difference. First operand 1604 states and 2111 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:39:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:47,389 INFO L93 Difference]: Finished difference Result 3170 states and 4177 transitions. [2025-01-09 18:39:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:39:47,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 346 [2025-01-09 18:39:47,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:47,397 INFO L225 Difference]: With dead ends: 3170 [2025-01-09 18:39:47,397 INFO L226 Difference]: Without dead ends: 1610 [2025-01-09 18:39:47,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 345 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:39:47,401 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:47,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1872 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:39:47,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1610 states. [2025-01-09 18:39:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1610 to 1610. [2025-01-09 18:39:47,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1166 states have (on average 1.2615780445969125) internal successors, (1471), 1184 states have internal predecessors, (1471), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:39:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2025-01-09 18:39:47,440 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 346 [2025-01-09 18:39:47,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:47,440 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2025-01-09 18:39:47,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:39:47,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2025-01-09 18:39:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-01-09 18:39:47,443 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:47,443 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:47,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 18:39:47,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:47,644 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:47,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:47,645 INFO L85 PathProgramCache]: Analyzing trace with hash 756519901, now seen corresponding path program 1 times [2025-01-09 18:39:47,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:47,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225481120] [2025-01-09 18:39:47,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:47,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:48,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 18:39:48,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 18:39:48,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:48,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:39:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225481120] [2025-01-09 18:39:48,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225481120] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:39:48,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922182505] [2025-01-09 18:39:48,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:48,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:48,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:48,561 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:39:48,565 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 18:39:49,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-01-09 18:39:50,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-01-09 18:39:50,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:50,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:50,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 3905 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:39:50,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:39:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2025-01-09 18:39:50,264 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:39:50,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922182505] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:50,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:39:50,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-09 18:39:50,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506256455] [2025-01-09 18:39:50,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:50,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:39:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:50,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:39:50,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:39:50,266 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:39:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:50,962 INFO L93 Difference]: Finished difference Result 3182 states and 4189 transitions. [2025-01-09 18:39:50,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:39:50,963 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 348 [2025-01-09 18:39:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:50,971 INFO L225 Difference]: With dead ends: 3182 [2025-01-09 18:39:50,971 INFO L226 Difference]: Without dead ends: 1616 [2025-01-09 18:39:50,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 18:39:50,974 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:50,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1872 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 18:39:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-01-09 18:39:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1610. [2025-01-09 18:39:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1166 states have (on average 1.2615780445969125) internal successors, (1471), 1184 states have internal predecessors, (1471), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:39:51,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2025-01-09 18:39:51,015 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 348 [2025-01-09 18:39:51,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:51,016 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2025-01-09 18:39:51,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2025-01-09 18:39:51,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2025-01-09 18:39:51,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 18:39:51,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:51,019 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:51,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 18:39:51,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 18:39:51,223 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:51,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:51,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1235233364, now seen corresponding path program 1 times [2025-01-09 18:39:51,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:51,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895417851] [2025-01-09 18:39:51,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:51,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:51,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 18:39:51,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 18:39:51,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:51,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:52,962 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:39:52,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895417851] [2025-01-09 18:39:52,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895417851] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:39:52,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448951555] [2025-01-09 18:39:52,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:52,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:52,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:52,964 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:39:52,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 18:39:54,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 18:39:54,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 18:39:54,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:54,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:54,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 3764 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 18:39:54,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:39:54,628 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:39:54,628 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 18:39:54,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448951555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:54,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 18:39:54,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2025-01-09 18:39:54,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680902904] [2025-01-09 18:39:54,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:54,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 18:39:54,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:54,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 18:39:54,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:39:54,632 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 18:39:55,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:55,398 INFO L93 Difference]: Finished difference Result 3182 states and 4189 transitions. [2025-01-09 18:39:55,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:39:55,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 355 [2025-01-09 18:39:55,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:55,407 INFO L225 Difference]: With dead ends: 3182 [2025-01-09 18:39:55,407 INFO L226 Difference]: Without dead ends: 1616 [2025-01-09 18:39:55,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-01-09 18:39:55,410 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 0 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:55,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1871 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 18:39:55,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1616 states. [2025-01-09 18:39:55,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1616 to 1610. [2025-01-09 18:39:55,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1166 states have (on average 1.2615780445969125) internal successors, (1471), 1184 states have internal predecessors, (1471), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:39:55,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2117 transitions. [2025-01-09 18:39:55,457 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2117 transitions. Word has length 355 [2025-01-09 18:39:55,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:55,457 INFO L471 AbstractCegarLoop]: Abstraction has 1610 states and 2117 transitions. [2025-01-09 18:39:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2025-01-09 18:39:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2117 transitions. [2025-01-09 18:39:55,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2025-01-09 18:39:55,460 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:55,460 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:55,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 18:39:55,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 18:39:55,660 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:55,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash 327359364, now seen corresponding path program 1 times [2025-01-09 18:39:55,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:55,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286982786] [2025-01-09 18:39:55,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:55,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:56,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 350 statements into 1 equivalence classes. [2025-01-09 18:39:56,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 350 of 350 statements. [2025-01-09 18:39:56,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:56,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:56,337 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 537 trivial. 0 not checked. [2025-01-09 18:39:56,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:56,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286982786] [2025-01-09 18:39:56,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286982786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:39:56,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:39:56,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:39:56,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627039732] [2025-01-09 18:39:56,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:39:56,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:39:56,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:39:56,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:39:56,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:39:56,340 INFO L87 Difference]: Start difference. First operand 1610 states and 2117 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 18:39:56,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:39:56,784 INFO L93 Difference]: Finished difference Result 3179 states and 4186 transitions. [2025-01-09 18:39:56,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:39:56,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 350 [2025-01-09 18:39:56,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:39:56,822 INFO L225 Difference]: With dead ends: 3179 [2025-01-09 18:39:56,823 INFO L226 Difference]: Without dead ends: 1613 [2025-01-09 18:39:56,830 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:39:56,831 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 0 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 18:39:56,831 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 18:39:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2025-01-09 18:39:56,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1613. [2025-01-09 18:39:56,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1169 states have (on average 1.260906757912746) internal successors, (1474), 1187 states have internal predecessors, (1474), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:39:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 2120 transitions. [2025-01-09 18:39:56,886 INFO L78 Accepts]: Start accepts. Automaton has 1613 states and 2120 transitions. Word has length 350 [2025-01-09 18:39:56,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:39:56,887 INFO L471 AbstractCegarLoop]: Abstraction has 1613 states and 2120 transitions. [2025-01-09 18:39:56,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 2 states have call successors, (36), 2 states have call predecessors, (36), 1 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2025-01-09 18:39:56,887 INFO L276 IsEmpty]: Start isEmpty. Operand 1613 states and 2120 transitions. [2025-01-09 18:39:56,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 18:39:56,889 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:39:56,890 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:39:56,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 18:39:56,890 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:39:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:39:56,890 INFO L85 PathProgramCache]: Analyzing trace with hash -685579314, now seen corresponding path program 1 times [2025-01-09 18:39:56,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:39:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309887393] [2025-01-09 18:39:56,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:39:57,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 18:39:57,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 18:39:57,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:57,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-01-09 18:39:57,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:39:57,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309887393] [2025-01-09 18:39:57,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309887393] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:39:57,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [353488808] [2025-01-09 18:39:57,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:39:57,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:39:57,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:39:57,902 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:39:57,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 18:39:59,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 18:39:59,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 18:39:59,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:39:59,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:39:59,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 3978 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 18:39:59,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:39:59,681 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:39:59,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:40:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 538 trivial. 0 not checked. [2025-01-09 18:40:00,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [353488808] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:40:00,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:40:00,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-01-09 18:40:00,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090474491] [2025-01-09 18:40:00,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:40:00,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 18:40:00,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:40:00,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 18:40:00,675 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:40:00,676 INFO L87 Difference]: Start difference. First operand 1613 states and 2120 transitions. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 2 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 18:40:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:40:00,727 INFO L93 Difference]: Finished difference Result 3188 states and 4195 transitions. [2025-01-09 18:40:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 18:40:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 2 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 353 [2025-01-09 18:40:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:40:00,736 INFO L225 Difference]: With dead ends: 3188 [2025-01-09 18:40:00,736 INFO L226 Difference]: Without dead ends: 1619 [2025-01-09 18:40:00,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 704 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-09 18:40:00,768 INFO L435 NwaCegarLoop]: 627 mSDtfsCounter, 1 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 18:40:00,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1250 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 18:40:00,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2025-01-09 18:40:00,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2025-01-09 18:40:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1619 states, 1175 states have (on average 1.2595744680851064) internal successors, (1480), 1193 states have internal predecessors, (1480), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:40:00,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 2126 transitions. [2025-01-09 18:40:00,807 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 2126 transitions. Word has length 353 [2025-01-09 18:40:00,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:40:00,808 INFO L471 AbstractCegarLoop]: Abstraction has 1619 states and 2126 transitions. [2025-01-09 18:40:00,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 2 states have call successors, (49), 2 states have call predecessors, (49), 2 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2025-01-09 18:40:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 2126 transitions. [2025-01-09 18:40:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-01-09 18:40:00,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:40:00,810 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:00,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 18:40:01,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-09 18:40:01,014 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:40:01,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:40:01,014 INFO L85 PathProgramCache]: Analyzing trace with hash -529602121, now seen corresponding path program 1 times [2025-01-09 18:40:01,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:40:01,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774981569] [2025-01-09 18:40:01,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:40:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:40:01,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-01-09 18:40:01,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-01-09 18:40:01,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:40:01,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:40:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 541 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:40:01,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:40:01,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774981569] [2025-01-09 18:40:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774981569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 18:40:01,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 18:40:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 18:40:01,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925290061] [2025-01-09 18:40:01,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 18:40:01,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 18:40:01,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:40:01,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 18:40:01,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 18:40:01,769 INFO L87 Difference]: Start difference. First operand 1619 states and 2126 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 18:40:01,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 18:40:01,960 INFO L93 Difference]: Finished difference Result 3197 states and 4204 transitions. [2025-01-09 18:40:01,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 18:40:01,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 353 [2025-01-09 18:40:01,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 18:40:01,967 INFO L225 Difference]: With dead ends: 3197 [2025-01-09 18:40:01,967 INFO L226 Difference]: Without dead ends: 1622 [2025-01-09 18:40:01,969 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:40:01,970 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 0 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1250 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 18:40:01,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1250 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 18:40:01,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-01-09 18:40:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2025-01-09 18:40:02,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1622 states, 1178 states have (on average 1.2589134125636672) internal successors, (1483), 1196 states have internal predecessors, (1483), 313 states have call successors, (313), 127 states have call predecessors, (313), 130 states have return successors, (333), 316 states have call predecessors, (333), 313 states have call successors, (333) [2025-01-09 18:40:02,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2129 transitions. [2025-01-09 18:40:02,012 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2129 transitions. Word has length 353 [2025-01-09 18:40:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 18:40:02,012 INFO L471 AbstractCegarLoop]: Abstraction has 1622 states and 2129 transitions. [2025-01-09 18:40:02,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 2 states have call successors, (38), 2 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 18:40:02,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2129 transitions. [2025-01-09 18:40:02,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2025-01-09 18:40:02,015 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 18:40:02,016 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:02,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 18:40:02,016 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_device_create_fileErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 18:40:02,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 18:40:02,016 INFO L85 PathProgramCache]: Analyzing trace with hash 821074877, now seen corresponding path program 1 times [2025-01-09 18:40:02,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 18:40:02,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745628219] [2025-01-09 18:40:02,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:40:02,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 18:40:02,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 18:40:02,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 18:40:02,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:40:02,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:40:03,649 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:40:03,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 18:40:03,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745628219] [2025-01-09 18:40:03,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745628219] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 18:40:03,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2083775287] [2025-01-09 18:40:03,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 18:40:03,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 18:40:03,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 18:40:03,656 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 18:40:03,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 18:40:05,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 355 statements into 1 equivalence classes. [2025-01-09 18:40:05,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 355 of 355 statements. [2025-01-09 18:40:05,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 18:40:05,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 18:40:05,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 3798 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 18:40:05,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 18:40:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2025-01-09 18:40:09,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 18:40:10,216 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 536 trivial. 0 not checked. [2025-01-09 18:40:10,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2083775287] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 18:40:10,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 18:40:10,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 18 [2025-01-09 18:40:10,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935299938] [2025-01-09 18:40:10,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 18:40:10,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 18:40:10,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 18:40:10,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 18:40:10,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2025-01-09 18:40:10,219 INFO L87 Difference]: Start difference. First operand 1622 states and 2129 transitions. Second operand has 18 states, 18 states have (on average 21.38888888888889) internal successors, (385), 18 states have internal predecessors, (385), 12 states have call successors, (102), 11 states have call predecessors, (102), 8 states have return successors, (97), 12 states have call predecessors, (97), 12 states have call successors, (97) [2025-01-09 18:40:14,238 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:40:18,266 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:40:22,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:40:26,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:40:30,389 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:40:34,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:40:38,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 18:40:42,555 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []