./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 47d4461f591f5c9a52c15dff47d7e2157d1252b7ce09c2294e271b7cda5a7338 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 19:24:56,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 19:24:56,196 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-08 19:24:56,200 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 19:24:56,200 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 19:24:56,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 19:24:56,213 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 19:24:56,214 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 19:24:56,214 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 19:24:56,214 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 19:24:56,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 19:24:56,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 19:24:56,214 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 19:24:56,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 19:24:56,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 19:24:56,215 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 19:24:56,216 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:24:56,216 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 19:24:56,216 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 19:24:56,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 19:24:56,217 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 19:24:56,217 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 19:24:56,217 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 47d4461f591f5c9a52c15dff47d7e2157d1252b7ce09c2294e271b7cda5a7338 [2025-03-08 19:24:56,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 19:24:56,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 19:24:56,430 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 19:24:56,431 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 19:24:56,431 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 19:24:56,433 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i [2025-03-08 19:24:57,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e204f4a9/933a67bac17e45ac9cbd0a90ad594e07/FLAG32134e0e2 [2025-03-08 19:24:58,135 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 19:24:58,136 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i [2025-03-08 19:24:58,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e204f4a9/933a67bac17e45ac9cbd0a90ad594e07/FLAG32134e0e2 [2025-03-08 19:24:58,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e204f4a9/933a67bac17e45ac9cbd0a90ad594e07 [2025-03-08 19:24:58,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 19:24:58,187 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 19:24:58,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 19:24:58,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 19:24:58,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 19:24:58,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:24:58" (1/1) ... [2025-03-08 19:24:58,193 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d6b090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:58, skipping insertion in model container [2025-03-08 19:24:58,193 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 07:24:58" (1/1) ... [2025-03-08 19:24:58,255 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 19:24:58,972 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i[193157,193170] [2025-03-08 19:24:59,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:24:59,043 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 19:24:59,147 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movb %1,%0": "=q" (ret): "m" (*((unsigned char volatile *)addr)): "memory"); [5420] [2025-03-08 19:24:59,149 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("movb %0,%1": : "q" (val), "m" (*((unsigned char volatile *)addr)): "memory"); [5427] [2025-03-08 19:24:59,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5458] [2025-03-08 19:24:59,150 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5466] [2025-03-08 19:24:59,232 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i[193157,193170] [2025-03-08 19:24:59,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 19:24:59,256 INFO L204 MainTranslator]: Completed translation [2025-03-08 19:24:59,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59 WrapperNode [2025-03-08 19:24:59,257 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 19:24:59,258 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 19:24:59,258 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 19:24:59,258 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 19:24:59,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,290 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,343 INFO L138 Inliner]: procedures = 99, calls = 572, calls flagged for inlining = 31, calls inlined = 25, statements flattened = 2018 [2025-03-08 19:24:59,344 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 19:24:59,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 19:24:59,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 19:24:59,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 19:24:59,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,476 INFO L175 MemorySlicer]: Split 281 memory accesses to 11 slices as follows [2, 2, 143, 2, 29, 2, 18, 10, 69, 2, 2]. 51 percent of accesses are in the largest equivalence class. The 188 initializations are split as follows [2, 2, 143, 2, 0, 2, 16, 9, 8, 2, 2]. The 31 writes are split as follows [0, 0, 0, 0, 10, 0, 1, 0, 20, 0, 0]. [2025-03-08 19:24:59,476 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,477 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,503 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,506 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,511 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,521 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 19:24:59,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 19:24:59,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 19:24:59,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 19:24:59,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (1/1) ... [2025-03-08 19:24:59,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 19:24:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 19:24:59,559 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 19:24:59,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 19:24:59,578 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-08 19:24:59,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2025-03-08 19:24:59,579 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2025-03-08 19:24:59,579 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-08 19:24:59,579 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-08 19:24:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure check_mirror [2025-03-08 19:24:59,580 INFO L138 BoogieDeclarations]: Found implementation of procedure check_mirror [2025-03-08 19:24:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2025-03-08 19:24:59,580 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2025-03-08 19:24:59,580 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-08 19:24:59,580 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2025-03-08 19:24:59,581 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-08 19:24:59,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2025-03-08 19:24:59,581 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 19:24:59,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 19:24:59,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2025-03-08 19:24:59,582 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2025-03-08 19:24:59,582 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-08 19:24:59,582 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure ioremap [2025-03-08 19:24:59,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ioremap [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure iounmap [2025-03-08 19:24:59,583 INFO L138 BoogieDeclarations]: Found implementation of procedure iounmap [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-08 19:24:59,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2025-03-08 19:24:59,584 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-08 19:24:59,584 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2025-03-08 19:24:59,584 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_priv [2025-03-08 19:24:59,584 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_priv [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2025-03-08 19:24:59,584 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 19:24:59,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2025-03-08 19:24:59,585 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2025-03-08 19:24:59,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2025-03-08 19:24:59,585 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2025-03-08 19:24:59,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 19:24:59,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 19:24:59,826 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 19:24:59,829 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 19:24:59,883 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6955: havoc arcnet_interrupt_#t~nondet308#1; [2025-03-08 19:24:59,886 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-08 19:24:59,898 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6964: havoc ioremap_nocache_#t~ret309#1.base, ioremap_nocache_#t~ret309#1.offset; [2025-03-08 19:24:59,940 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6974: havoc #t~nondet310; [2025-03-08 19:24:59,980 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5474: havoc __kmalloc_#t~ret24#1.base, __kmalloc_#t~ret24#1.offset; [2025-03-08 19:24:59,992 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6948: havoc #t~ret306.base, #t~ret306.offset; [2025-03-08 19:25:00,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6978: havoc probe_irq_off_#t~nondet311#1; [2025-03-08 19:25:00,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L5659: call ULTIMATE.dealloc(com90xx_probe_~#ports~0#1.base, com90xx_probe_~#ports~0#1.offset);havoc com90xx_probe_~#ports~0#1.base, com90xx_probe_~#ports~0#1.offset; [2025-03-08 19:25:00,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6982: havoc probe_irq_on_#t~nondet312#1; [2025-03-08 19:25:00,943 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6986: havoc register_netdev_#t~nondet313#1; [2025-03-08 19:25:00,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6990: havoc request_threaded_irq_#t~nondet314#1; [2025-03-08 19:25:00,944 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6951: havoc alloc_arcdev_#t~ret307#1.base, alloc_arcdev_#t~ret307#1.offset; [2025-03-08 19:25:01,152 INFO L? ?]: Removed 404 outVars from TransFormulas that were not future-live. [2025-03-08 19:25:01,152 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 19:25:01,221 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 19:25:01,223 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 19:25:01,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:25:01 BoogieIcfgContainer [2025-03-08 19:25:01,223 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 19:25:01,225 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 19:25:01,225 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 19:25:01,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 19:25:01,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 07:24:58" (1/3) ... [2025-03-08 19:25:01,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0c7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:25:01, skipping insertion in model container [2025-03-08 19:25:01,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 07:24:59" (2/3) ... [2025-03-08 19:25:01,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67a0c7b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 07:25:01, skipping insertion in model container [2025-03-08 19:25:01,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:25:01" (3/3) ... [2025-03-08 19:25:01,232 INFO L128 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i [2025-03-08 19:25:01,242 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 19:25:01,247 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG linux-4.2-rc1.tar.xz-08_1a-drivers--net--arcnet--com90xx.ko-entry_point.cil.out.i that has 23 procedures, 741 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 19:25:01,305 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 19:25:01,316 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;@16c65575, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 19:25:01,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 19:25:01,322 INFO L276 IsEmpty]: Start isEmpty. Operand has 740 states, 579 states have (on average 1.4818652849740932) internal successors, (858), 592 states have internal predecessors, (858), 138 states have call successors, (138), 22 states have call predecessors, (138), 21 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) [2025-03-08 19:25:01,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-08 19:25:01,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:25:01,330 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:25:01,330 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:25:01,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:25:01,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1270194240, now seen corresponding path program 1 times [2025-03-08 19:25:01,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:25:01,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618605490] [2025-03-08 19:25:01,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:25:01,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:25:01,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-08 19:25:01,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-08 19:25:01,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:25:01,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:25:01,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:25:01,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:25:01,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618605490] [2025-03-08 19:25:01,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618605490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:25:01,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:25:01,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:25:01,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559131581] [2025-03-08 19:25:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:25:01,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:25:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:25:01,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:25:01,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:01,792 INFO L87 Difference]: Start difference. First operand has 740 states, 579 states have (on average 1.4818652849740932) internal successors, (858), 592 states have internal predecessors, (858), 138 states have call successors, (138), 22 states have call predecessors, (138), 21 states have return successors, (134), 134 states have call predecessors, (134), 134 states have call successors, (134) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:25:02,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:25:02,036 INFO L93 Difference]: Finished difference Result 1541 states and 2361 transitions. [2025-03-08 19:25:02,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:25:02,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-08 19:25:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:25:02,052 INFO L225 Difference]: With dead ends: 1541 [2025-03-08 19:25:02,052 INFO L226 Difference]: Without dead ends: 790 [2025-03-08 19:25:02,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:02,062 INFO L435 NwaCegarLoop]: 1082 mSDtfsCounter, 1078 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 1195 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:25:02,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 1195 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:25:02,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-08 19:25:02,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-03-08 19:25:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 624 states have (on average 1.4599358974358974) internal successors, (911), 631 states have internal predecessors, (911), 138 states have call successors, (138), 28 states have call predecessors, (138), 27 states have return successors, (137), 137 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 19:25:02,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1186 transitions. [2025-03-08 19:25:02,163 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1186 transitions. Word has length 15 [2025-03-08 19:25:02,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:25:02,164 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1186 transitions. [2025-03-08 19:25:02,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:25:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1186 transitions. [2025-03-08 19:25:02,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 19:25:02,167 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:25:02,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:25:02,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 19:25:02,167 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:25:02,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:25:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash -373213002, now seen corresponding path program 1 times [2025-03-08 19:25:02,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:25:02,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156612329] [2025-03-08 19:25:02,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:25:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:25:02,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 19:25:02,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 19:25:02,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:25:02,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:25:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:25:02,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:25:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156612329] [2025-03-08 19:25:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156612329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:25:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:25:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 19:25:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505863072] [2025-03-08 19:25:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:25:02,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:25:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:25:02,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:25:02,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:02,359 INFO L87 Difference]: Start difference. First operand 790 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:25:02,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:25:02,503 INFO L93 Difference]: Finished difference Result 1577 states and 2369 transitions. [2025-03-08 19:25:02,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:25:02,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 19:25:02,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:25:02,507 INFO L225 Difference]: With dead ends: 1577 [2025-03-08 19:25:02,507 INFO L226 Difference]: Without dead ends: 790 [2025-03-08 19:25:02,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:02,511 INFO L435 NwaCegarLoop]: 1045 mSDtfsCounter, 1099 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:25:02,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1045 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:25:02,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-08 19:25:02,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-03-08 19:25:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 624 states have (on average 1.4567307692307692) internal successors, (909), 631 states have internal predecessors, (909), 138 states have call successors, (138), 28 states have call predecessors, (138), 27 states have return successors, (137), 137 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 19:25:02,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1184 transitions. [2025-03-08 19:25:02,557 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1184 transitions. Word has length 25 [2025-03-08 19:25:02,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:25:02,557 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1184 transitions. [2025-03-08 19:25:02,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:25:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1184 transitions. [2025-03-08 19:25:02,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 19:25:02,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:25:02,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:25:02,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 19:25:02,559 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:25:02,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:25:02,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1134338807, now seen corresponding path program 1 times [2025-03-08 19:25:02,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:25:02,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315764437] [2025-03-08 19:25:02,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:25:02,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:25:02,578 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 19:25:02,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 19:25:02,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:25:02,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:25:02,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:25:02,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:25:02,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315764437] [2025-03-08 19:25:02,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315764437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:25:02,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:25:02,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 19:25:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311106438] [2025-03-08 19:25:02,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:25:02,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:25:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:25:02,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:25:02,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:02,648 INFO L87 Difference]: Start difference. First operand 790 states and 1184 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:25:02,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:25:02,754 INFO L93 Difference]: Finished difference Result 1577 states and 2365 transitions. [2025-03-08 19:25:02,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:25:02,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-03-08 19:25:02,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:25:02,764 INFO L225 Difference]: With dead ends: 1577 [2025-03-08 19:25:02,764 INFO L226 Difference]: Without dead ends: 790 [2025-03-08 19:25:02,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:02,768 INFO L435 NwaCegarLoop]: 1046 mSDtfsCounter, 1093 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1093 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:25:02,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1093 Valid, 1046 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:25:02,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-08 19:25:02,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-03-08 19:25:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 624 states have (on average 1.455128205128205) internal successors, (908), 631 states have internal predecessors, (908), 138 states have call successors, (138), 28 states have call predecessors, (138), 27 states have return successors, (137), 137 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 19:25:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1183 transitions. [2025-03-08 19:25:02,819 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1183 transitions. Word has length 25 [2025-03-08 19:25:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:25:02,819 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 1183 transitions. [2025-03-08 19:25:02,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:25:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1183 transitions. [2025-03-08 19:25:02,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 19:25:02,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:25:02,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:25:02,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 19:25:02,822 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:25:02,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:25:02,823 INFO L85 PathProgramCache]: Analyzing trace with hash 999364849, now seen corresponding path program 1 times [2025-03-08 19:25:02,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:25:02,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324991245] [2025-03-08 19:25:02,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:25:02,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:25:02,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 19:25:02,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 19:25:02,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:25:02,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:25:02,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:25:02,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:25:02,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324991245] [2025-03-08 19:25:02,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324991245] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:25:02,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:25:02,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 19:25:02,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066154608] [2025-03-08 19:25:02,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:25:02,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 19:25:02,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:25:02,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 19:25:02,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:25:02,974 INFO L87 Difference]: Start difference. First operand 790 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 19:25:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:25:03,151 INFO L93 Difference]: Finished difference Result 1585 states and 2372 transitions. [2025-03-08 19:25:03,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 19:25:03,151 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 41 [2025-03-08 19:25:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:25:03,155 INFO L225 Difference]: With dead ends: 1585 [2025-03-08 19:25:03,155 INFO L226 Difference]: Without dead ends: 798 [2025-03-08 19:25:03,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 19:25:03,158 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 6 mSDsluCounter, 2082 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3126 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:25:03,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3126 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:25:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2025-03-08 19:25:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 793. [2025-03-08 19:25:03,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 793 states, 627 states have (on average 1.452950558213716) internal successors, (911), 634 states have internal predecessors, (911), 138 states have call successors, (138), 28 states have call predecessors, (138), 27 states have return successors, (137), 137 states have call predecessors, (137), 137 states have call successors, (137) [2025-03-08 19:25:03,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 1186 transitions. [2025-03-08 19:25:03,188 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 1186 transitions. Word has length 41 [2025-03-08 19:25:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:25:03,189 INFO L471 AbstractCegarLoop]: Abstraction has 793 states and 1186 transitions. [2025-03-08 19:25:03,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-03-08 19:25:03,189 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1186 transitions. [2025-03-08 19:25:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 19:25:03,191 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 19:25:03,191 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 19:25:03,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 19:25:03,192 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 19:25:03,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 19:25:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1027994000, now seen corresponding path program 1 times [2025-03-08 19:25:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 19:25:03,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446849782] [2025-03-08 19:25:03,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 19:25:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 19:25:03,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 19:25:03,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 19:25:03,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 19:25:03,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 19:25:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 19:25:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 19:25:03,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446849782] [2025-03-08 19:25:03,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446849782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 19:25:03,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 19:25:03,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 19:25:03,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490934259] [2025-03-08 19:25:03,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 19:25:03,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 19:25:03,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 19:25:03,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 19:25:03,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:03,307 INFO L87 Difference]: Start difference. First operand 793 states and 1186 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 19:25:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 19:25:03,403 INFO L93 Difference]: Finished difference Result 793 states and 1186 transitions. [2025-03-08 19:25:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 19:25:03,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2025-03-08 19:25:03,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 19:25:03,405 INFO L225 Difference]: With dead ends: 793 [2025-03-08 19:25:03,405 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 19:25:03,406 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 19:25:03,406 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 1080 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1044 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 19:25:03,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1044 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 19:25:03,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 19:25:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 19:25:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 19:25:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 19:25:03,408 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2025-03-08 19:25:03,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 19:25:03,408 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 19:25:03,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 19:25:03,408 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 19:25:03,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 19:25:03,410 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 19:25:03,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 19:25:03,412 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-03-08 19:25:03,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 19:25:04,812 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 19:25:04,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 07:25:04 BoogieIcfgContainer [2025-03-08 19:25:04,822 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 19:25:04,823 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 19:25:04,823 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 19:25:04,823 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 19:25:04,824 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 07:25:01" (3/4) ... [2025-03-08 19:25:04,825 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 19:25:04,829 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure netdev_priv [2025-03-08 19:25:04,829 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outb [2025-03-08 19:25:04,829 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure check_mirror [2025-03-08 19:25:04,829 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure iounmap [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __release_region [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kfree [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure free_irq [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure printk [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure writeb [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __const_udelay [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ioremap [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __request_region [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_error [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_irq_1 [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure disable_suitable_irq_1 [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure kzalloc [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_stop [2025-03-08 19:25:04,830 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure readb [2025-03-08 19:25:04,832 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure inb [2025-03-08 19:25:04,832 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure free_netdev [2025-03-08 19:25:04,859 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 188 nodes and edges [2025-03-08 19:25:04,861 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 85 nodes and edges [2025-03-08 19:25:04,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-03-08 19:25:04,865 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-03-08 19:25:04,867 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-03-08 19:25:04,868 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 19:25:04,870 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-03-08 19:25:04,872 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 19:25:05,039 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 19:25:05,039 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 19:25:05,039 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 19:25:05,040 INFO L158 Benchmark]: Toolchain (without parser) took 6852.86ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 97.4MB in the beginning and 275.4MB in the end (delta: -178.0MB). Peak memory consumption was 221.8MB. Max. memory is 16.1GB. [2025-03-08 19:25:05,042 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 19:25:05,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1068.42ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 56.0MB in the end (delta: 41.4MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. [2025-03-08 19:25:05,042 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.82ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 45.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 19:25:05,042 INFO L158 Benchmark]: Boogie Preprocessor took 188.16ms. Allocated memory is still 142.6MB. Free memory was 45.7MB in the beginning and 80.2MB in the end (delta: -34.5MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2025-03-08 19:25:05,042 INFO L158 Benchmark]: IcfgBuilder took 1689.69ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 80.2MB in the beginning and 211.8MB in the end (delta: -131.6MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. [2025-03-08 19:25:05,042 INFO L158 Benchmark]: TraceAbstraction took 3597.24ms. Allocated memory is still 360.7MB. Free memory was 210.9MB in the beginning and 107.4MB in the end (delta: 103.5MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-03-08 19:25:05,042 INFO L158 Benchmark]: Witness Printer took 216.12ms. Allocated memory is still 360.7MB. Free memory was 107.4MB in the beginning and 275.4MB in the end (delta: -168.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 19:25:05,044 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58ms. Allocated memory is still 201.3MB. Free memory was 126.3MB in the beginning and 126.0MB in the end (delta: 307.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1068.42ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 56.0MB in the end (delta: 41.4MB). Peak memory consumption was 84.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.82ms. Allocated memory is still 142.6MB. Free memory was 56.0MB in the beginning and 45.7MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 188.16ms. Allocated memory is still 142.6MB. Free memory was 45.7MB in the beginning and 80.2MB in the end (delta: -34.5MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. * IcfgBuilder took 1689.69ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 80.2MB in the beginning and 211.8MB in the end (delta: -131.6MB). Peak memory consumption was 92.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3597.24ms. Allocated memory is still 360.7MB. Free memory was 210.9MB in the beginning and 107.4MB in the end (delta: 103.5MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * Witness Printer took 216.12ms. Allocated memory is still 360.7MB. Free memory was 107.4MB in the beginning and 275.4MB in the end (delta: -168.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 5420]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("movb %1,%0": "=q" (ret): "m" (*((unsigned char volatile *)addr)): "memory"); [5420] - GenericResultAtLocation [Line: 5427]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("movb %0,%1": : "q" (val), "m" (*((unsigned char volatile *)addr)): "memory"); [5427] - GenericResultAtLocation [Line: 5458]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("outb %b0, %w1": : "a" (value), "Nd" (port)); [5458] - GenericResultAtLocation [Line: 5466]: Unsoundness Warning Ignoring inline assembler instruction C: __asm__ volatile ("inb %w1, %b0": "=a" (value): "Nd" (port)); [5466] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 6836]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 23 procedures, 741 locations, 1272 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4356 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4356 mSDsluCounter, 7456 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2195 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 458 IncrementalHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 5261 mSDtfsCounter, 458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=793occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 262 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5704]: Location Invariant Derived location invariant: ((((ldv_module_refcounter == 1) && (com90xx_skip_probe == 0)) && (ldv_state_variable_0 == 1)) && (irq == 0)) RESULT: Ultimate proved your program to be correct! [2025-03-08 19:25:05,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE