./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.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 037f6e8e4bd200c248573cc05d02b8c7bc97a7f8cca3135a2970ec46958bec59 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 04:00:50,169 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 04:00:50,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-04 04:00:50,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 04:00:50,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 04:00:50,231 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 04:00:50,232 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 04:00:50,232 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 04:00:50,232 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 04:00:50,232 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 04:00:50,233 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 04:00:50,233 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 04:00:50,233 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 04:00:50,233 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 04:00:50,234 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 04:00:50,234 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 04:00:50,234 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 04:00:50,234 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 04:00:50,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 04:00:50,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 04:00:50,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 04:00:50,234 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 04:00:50,235 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:50,235 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 04:00:50,235 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 04:00:50,236 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 04:00:50,236 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 -> 037f6e8e4bd200c248573cc05d02b8c7bc97a7f8cca3135a2970ec46958bec59 [2025-03-04 04:00:50,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 04:00:50,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 04:00:50,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 04:00:50,467 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 04:00:50,467 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 04:00:50,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2025-03-04 04:00:51,642 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611e9e6a3/1965fba9f1a44151ad46f9457f38c286/FLAG5d225718a [2025-03-04 04:00:52,154 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 04:00:52,156 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2025-03-04 04:00:52,193 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611e9e6a3/1965fba9f1a44151ad46f9457f38c286/FLAG5d225718a [2025-03-04 04:00:52,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611e9e6a3/1965fba9f1a44151ad46f9457f38c286 [2025-03-04 04:00:52,214 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 04:00:52,215 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 04:00:52,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:52,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 04:00:52,220 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 04:00:52,221 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:52" (1/1) ... [2025-03-04 04:00:52,221 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51d833 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:52, skipping insertion in model container [2025-03-04 04:00:52,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 04:00:52" (1/1) ... [2025-03-04 04:00:52,299 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 04:00:53,084 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] [2025-03-04 04:00:53,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:53,615 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 04:00:53,726 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-3.16-rc1/205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i[190557,190570] [2025-03-04 04:00:53,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 04:00:53,910 INFO L204 MainTranslator]: Completed translation [2025-03-04 04:00:53,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53 WrapperNode [2025-03-04 04:00:53,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 04:00:53,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:53,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 04:00:53,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 04:00:53,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:53,947 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,010 INFO L138 Inliner]: procedures = 175, calls = 763, calls flagged for inlining = 71, calls inlined = 62, statements flattened = 1972 [2025-03-04 04:00:54,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 04:00:54,011 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 04:00:54,011 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 04:00:54,011 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 04:00:54,021 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,023 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,040 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,279 INFO L175 MemorySlicer]: Split 365 memory accesses to 15 slices as follows [2, 261, 2, 2, 3, 3, 3, 3, 4, 3, 3, 44, 10, 20, 2]. 72 percent of accesses are in the largest equivalence class. The 61 initializations are split as follows [2, 26, 0, 0, 3, 3, 3, 3, 0, 3, 3, 0, 0, 15, 0]. The 159 writes are split as follows [0, 100, 1, 1, 0, 0, 0, 0, 1, 0, 0, 44, 9, 2, 1]. [2025-03-04 04:00:54,279 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,344 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,379 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,401 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 04:00:54,405 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 04:00:54,405 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 04:00:54,405 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 04:00:54,406 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (1/1) ... [2025-03-04 04:00:54,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 04:00:54,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:00:54,432 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-04 04:00:54,436 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-04 04:00:54,453 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_cleanup_scatter [2025-03-04 04:00:54,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_cleanup_scatter [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure __raw_spin_lock_init [2025-03-04 04:00:54,454 INFO L138 BoogieDeclarations]: Found implementation of procedure __raw_spin_lock_init [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_submit_ctrl_out [2025-03-04 04:00:54,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_submit_ctrl_out [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2025-03-04 04:00:54,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#12 [2025-03-04 04:00:54,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#13 [2025-03-04 04:00:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#14 [2025-03-04 04:00:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2025-03-04 04:00:54,456 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2025-03-04 04:00:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2025-03-04 04:00:54,456 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2025-03-04 04:00:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2025-03-04 04:00:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2025-03-04 04:00:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2025-03-04 04:00:54,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#12 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#13 [2025-03-04 04:00:54,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#14 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#12 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#13 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#14 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2025-03-04 04:00:54,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 04:00:54,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure usb_put_dev [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_put_dev [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_diag_write32 [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_diag_write32 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_destroy [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_destroy [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_free [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_free [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_get_default_pipe [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_get_default_pipe [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_skb_alloc [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_skb_alloc [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_power_off [2025-03-04 04:00:54,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_power_off [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 04:00:54,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_bmi_read [2025-03-04 04:00:54,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_bmi_read [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_bulk_urb [2025-03-04 04:00:54,460 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_bulk_urb [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2025-03-04 04:00:54,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2025-03-04 04:00:54,460 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_stop [2025-03-04 04:00:54,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_stop [2025-03-04 04:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_get_free_queue_number [2025-03-04 04:00:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_get_free_queue_number [2025-03-04 04:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_free_urb_to_pipe [2025-03-04 04:00:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_free_urb_to_pipe [2025-03-04 04:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_flush_all [2025-03-04 04:00:54,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_flush_all [2025-03-04 04:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2025-03-04 04:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2025-03-04 04:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2025-03-04 04:00:54,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#3 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#4 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#5 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#6 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#7 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#8 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#9 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#10 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#11 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#12 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#13 [2025-03-04 04:00:54,463 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#14 [2025-03-04 04:00:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2025-03-04 04:00:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2025-03-04 04:00:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2025-03-04 04:00:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#3 [2025-03-04 04:00:54,463 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#4 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#5 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#6 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#7 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#8 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#9 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#10 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#11 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#12 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#13 [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#14 [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_warn [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_warn [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_ctrl_msg_exchange [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_ctrl_msg_exchange [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_cleanup_recv_urb [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_cleanup_recv_urb [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure spinlock_check [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure spinlock_check [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_submit_ctrl_in [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_submit_ctrl_in [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_power_on [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_power_on [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_priv [2025-03-04 04:00:54,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_priv [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 04:00:54,464 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2025-03-04 04:00:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_err [2025-03-04 04:00:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_err [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2025-03-04 04:00:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_set_remove [2025-03-04 04:00:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_set_remove [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_alloc_urb_from_pipe [2025-03-04 04:00:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_alloc_urb_from_pipe [2025-03-04 04:00:54,465 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_remove [2025-03-04 04:00:54,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_remove [2025-03-04 04:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2025-03-04 04:00:54,466 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2025-03-04 04:00:54,466 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_irqrestore [2025-03-04 04:00:54,467 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_irqrestore [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure usb_anchor_urb [2025-03-04 04:00:54,467 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_anchor_urb [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 04:00:54,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_post_recv_transfers [2025-03-04 04:00:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_post_recv_transfers [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2025-03-04 04:00:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2025-03-04 04:00:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_map_service_pipe [2025-03-04 04:00:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_map_service_pipe [2025-03-04 04:00:54,469 INFO L130 BoogieDeclarations]: Found specification of procedure _raw_spin_lock_irqsave [2025-03-04 04:00:54,469 INFO L138 BoogieDeclarations]: Found implementation of procedure _raw_spin_lock_irqsave [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_dbg [2025-03-04 04:00:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_dbg [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure usb_unanchor_urb [2025-03-04 04:00:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_unanchor_urb [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2025-03-04 04:00:54,470 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 04:00:54,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure ath6kl_usb_send [2025-03-04 04:00:54,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ath6kl_usb_send [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2025-03-04 04:00:54,471 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2025-03-04 04:00:54,471 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#12 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#13 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#14 [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2025-03-04 04:00:54,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2025-03-04 04:00:54,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 04:00:54,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 04:00:54,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 04:00:54,973 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 04:00:55,036 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8762: havoc kmemdup_#t~ret422#1.base, kmemdup_#t~ret422#1.offset; [2025-03-04 04:00:55,047 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6657: havoc dev_get_drvdata_#t~mem39#1.base, dev_get_drvdata_#t~mem39#1.offset; [2025-03-04 04:00:55,050 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8817: havoc #t~nondet432; [2025-03-04 04:00:55,051 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2025-03-04 04:00:55,209 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8756: havoc #t~nondet421; [2025-03-04 04:00:55,322 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8749: havoc #t~nondet420; [2025-03-04 04:00:55,356 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6634: havoc __kmalloc_#t~ret35#1.base, __kmalloc_#t~ret35#1.offset; [2025-03-04 04:00:55,401 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8720: havoc #t~nondet417; [2025-03-04 04:00:55,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8787: havoc #t~ret428.base, #t~ret428.offset; [2025-03-04 04:00:55,469 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6867: havoc #t~mem81;havoc #t~bitwise82; [2025-03-04 04:00:55,503 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7597: havoc #t~mem278; [2025-03-04 04:00:55,570 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6929: havoc #t~mem112.base, #t~mem112.offset; [2025-03-04 04:00:55,573 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8794: havoc #t~nondet429; [2025-03-04 04:00:55,590 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6586: havoc list_empty_#t~mem6#1.base, list_empty_#t~mem6#1.offset; [2025-03-04 04:01:00,416 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7703: call ULTIMATE.dealloc(ath6kl_usb_diag_read32_~#resp_len~0#1.base, ath6kl_usb_diag_read32_~#resp_len~0#1.offset);havoc ath6kl_usb_diag_read32_~#resp_len~0#1.base, ath6kl_usb_diag_read32_~#resp_len~0#1.offset; [2025-03-04 04:01:00,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8729: havoc ath6kl_core_create_#t~ret418#1.base, ath6kl_core_create_#t~ret418#1.offset; [2025-03-04 04:01:00,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8766: havoc ldv_probe_2_#t~nondet423#1; [2025-03-04 04:01:00,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6685: call ULTIMATE.dealloc(skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset);havoc skb_queue_head_init_~#__key~0#1.base, skb_queue_head_init_~#__key~0#1.offset; [2025-03-04 04:01:00,417 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8736: havoc ath6kl_core_init_#t~nondet419#1; [2025-03-04 04:01:00,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8803: havoc usb_get_dev_#t~ret430#1.base, usb_get_dev_#t~ret430#1.offset; [2025-03-04 04:01:00,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7355: call ULTIMATE.dealloc(ath6kl_usb_create_~#__key~2#1.base, ath6kl_usb_create_~#__key~2#1.offset);havoc ath6kl_usb_create_~#__key~2#1.base, ath6kl_usb_create_~#__key~2#1.offset;call ULTIMATE.dealloc(ath6kl_usb_create_~#__key___0~1#1.base, ath6kl_usb_create_~#__key___0~1#1.offset);havoc ath6kl_usb_create_~#__key___0~1#1.base, ath6kl_usb_create_~#__key___0~1#1.offset;call ULTIMATE.dealloc(ath6kl_usb_create_~#__constr_expr_0~0#1.base, ath6kl_usb_create_~#__constr_expr_0~0#1.offset);havoc ath6kl_usb_create_~#__constr_expr_0~0#1.base, ath6kl_usb_create_~#__constr_expr_0~0#1.offset; [2025-03-04 04:01:00,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L6830: call ULTIMATE.dealloc(init_usb_anchor_~#__key~1#1.base, init_usb_anchor_~#__key~1#1.offset);havoc init_usb_anchor_~#__key~1#1.base, init_usb_anchor_~#__key~1#1.offset;call ULTIMATE.dealloc(init_usb_anchor_~#__key___0~0#1.base, init_usb_anchor_~#__key___0~0#1.offset);havoc init_usb_anchor_~#__key___0~0#1.base, init_usb_anchor_~#__key___0~0#1.offset; [2025-03-04 04:01:00,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8813: havoc usb_register_driver_#t~nondet431#1; [2025-03-04 04:01:00,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7066: call ULTIMATE.dealloc(ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.base, ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.offset);havoc ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.base, ath6kl_usb_setup_pipe_resources_~#urbcount~0#1.offset; [2025-03-04 04:01:00,418 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L7992: call ULTIMATE.dealloc(main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset);havoc main_~#ldvarg0~0#1.base, main_~#ldvarg0~0#1.offset;call ULTIMATE.dealloc(main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset);havoc main_~#ldvarg2~0#1.base, main_~#ldvarg2~0#1.offset; [2025-03-04 04:01:00,662 INFO L? ?]: Removed 906 outVars from TransFormulas that were not future-live. [2025-03-04 04:01:00,662 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 04:01:00,689 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 04:01:00,690 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 04:01:00,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:01:00 BoogieIcfgContainer [2025-03-04 04:01:00,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 04:01:00,692 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 04:01:00,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 04:01:00,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 04:01:00,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 04:00:52" (1/3) ... [2025-03-04 04:01:00,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2249d60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:01:00, skipping insertion in model container [2025-03-04 04:01:00,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 04:00:53" (2/3) ... [2025-03-04 04:01:00,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2249d60d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 04:01:00, skipping insertion in model container [2025-03-04 04:01:00,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 04:01:00" (3/3) ... [2025-03-04 04:01:00,697 INFO L128 eAbstractionObserver]: Analyzing ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i [2025-03-04 04:01:00,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 04:01:00,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 205_9a_array_unsafes_linux-3.16-rc1.tar.xz-205_9a-drivers--net--wireless--ath--ath6kl--ath6kl_usb.ko-entry_point.cil.out.i that has 68 procedures, 870 locations, 1 initial locations, 20 loop locations, and 1 error locations. [2025-03-04 04:01:00,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 04:01:00,805 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;@5358be9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 04:01:00,806 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 04:01:00,813 INFO L276 IsEmpty]: Start isEmpty. Operand has 821 states, 580 states have (on average 1.3431034482758621) internal successors, (779), 595 states have internal predecessors, (779), 185 states have call successors, (185), 55 states have call predecessors, (185), 54 states have return successors, (181), 180 states have call predecessors, (181), 181 states have call successors, (181) [2025-03-04 04:01:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-03-04 04:01:00,821 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:00,822 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:00,822 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:00,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2070556076, now seen corresponding path program 1 times [2025-03-04 04:01:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579806942] [2025-03-04 04:01:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 04:01:01,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 04:01:01,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:01,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:01,803 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-03-04 04:01:01,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:01,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579806942] [2025-03-04 04:01:01,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579806942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:01,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:01,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:01,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191571715] [2025-03-04 04:01:01,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:01,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:01,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:01,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:01,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:01,825 INFO L87 Difference]: Start difference. First operand has 821 states, 580 states have (on average 1.3431034482758621) internal successors, (779), 595 states have internal predecessors, (779), 185 states have call successors, (185), 55 states have call predecessors, (185), 54 states have return successors, (181), 180 states have call predecessors, (181), 181 states have call successors, (181) Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 04:01:05,852 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-03-04 04:01:06,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:06,121 INFO L93 Difference]: Finished difference Result 2392 states and 3441 transitions. [2025-03-04 04:01:06,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:06,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 96 [2025-03-04 04:01:06,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:06,146 INFO L225 Difference]: With dead ends: 2392 [2025-03-04 04:01:06,147 INFO L226 Difference]: Without dead ends: 1560 [2025-03-04 04:01:06,156 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-04 04:01:06,159 INFO L435 NwaCegarLoop]: 1129 mSDtfsCounter, 1054 mSDsluCounter, 1097 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1054 SdHoareTripleChecker+Valid, 2226 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:06,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1054 Valid, 2226 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:01:06,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2025-03-04 04:01:06,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2025-03-04 04:01:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 1110 states have (on average 1.3216216216216217) internal successors, (1467), 1128 states have internal predecessors, (1467), 345 states have call successors, (345), 105 states have call predecessors, (345), 104 states have return successors, (344), 342 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-04 04:01:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 2156 transitions. [2025-03-04 04:01:06,295 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 2156 transitions. Word has length 96 [2025-03-04 04:01:06,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:06,295 INFO L471 AbstractCegarLoop]: Abstraction has 1560 states and 2156 transitions. [2025-03-04 04:01:06,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2025-03-04 04:01:06,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 2156 transitions. [2025-03-04 04:01:06,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-04 04:01:06,304 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:06,305 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:06,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 04:01:06,305 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:06,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:06,306 INFO L85 PathProgramCache]: Analyzing trace with hash -354198406, now seen corresponding path program 1 times [2025-03-04 04:01:06,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:06,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279593746] [2025-03-04 04:01:06,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:06,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-04 04:01:06,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-04 04:01:06,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:06,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:06,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 04:01:06,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:06,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279593746] [2025-03-04 04:01:06,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279593746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:06,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:06,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 04:01:06,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530420644] [2025-03-04 04:01:06,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:06,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 04:01:06,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:06,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 04:01:06,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 04:01:06,873 INFO L87 Difference]: Start difference. First operand 1560 states and 2156 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 04:01:07,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:07,076 INFO L93 Difference]: Finished difference Result 3090 states and 4269 transitions. [2025-03-04 04:01:07,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 04:01:07,077 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 107 [2025-03-04 04:01:07,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:07,085 INFO L225 Difference]: With dead ends: 3090 [2025-03-04 04:01:07,085 INFO L226 Difference]: Without dead ends: 1568 [2025-03-04 04:01:07,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:07,092 INFO L435 NwaCegarLoop]: 1111 mSDtfsCounter, 1113 mSDsluCounter, 1113 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1113 SdHoareTripleChecker+Valid, 2224 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:07,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1113 Valid, 2224 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:07,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2025-03-04 04:01:07,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1562. [2025-03-04 04:01:07,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1112 states have (on average 1.3201438848920863) internal successors, (1468), 1130 states have internal predecessors, (1468), 345 states have call successors, (345), 105 states have call predecessors, (345), 104 states have return successors, (344), 342 states have call predecessors, (344), 344 states have call successors, (344) [2025-03-04 04:01:07,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2157 transitions. [2025-03-04 04:01:07,176 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2157 transitions. Word has length 107 [2025-03-04 04:01:07,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:07,177 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2157 transitions. [2025-03-04 04:01:07,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-03-04 04:01:07,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2157 transitions. [2025-03-04 04:01:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-04 04:01:07,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:07,183 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 04:01:07,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 04:01:07,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:07,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:07,184 INFO L85 PathProgramCache]: Analyzing trace with hash -752799449, now seen corresponding path program 1 times [2025-03-04 04:01:07,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:07,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718938367] [2025-03-04 04:01:07,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:07,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:07,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-04 04:01:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-04 04:01:07,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:07,842 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2025-03-04 04:01:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718938367] [2025-03-04 04:01:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718938367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:01:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569464054] [2025-03-04 04:01:07,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:01:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:07,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:01:07,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:07,846 INFO L87 Difference]: Start difference. First operand 1562 states and 2157 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 04:01:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:08,172 INFO L93 Difference]: Finished difference Result 4607 states and 6401 transitions. [2025-03-04 04:01:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:01:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 112 [2025-03-04 04:01:08,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:08,192 INFO L225 Difference]: With dead ends: 4607 [2025-03-04 04:01:08,193 INFO L226 Difference]: Without dead ends: 3077 [2025-03-04 04:01:08,199 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 04:01:08,200 INFO L435 NwaCegarLoop]: 1153 mSDtfsCounter, 1086 mSDsluCounter, 3355 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1086 SdHoareTripleChecker+Valid, 4508 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:08,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1086 Valid, 4508 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:08,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2025-03-04 04:01:08,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 3073. [2025-03-04 04:01:08,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 2190 states have (on average 1.3214611872146118) internal successors, (2894), 2226 states have internal predecessors, (2894), 676 states have call successors, (676), 207 states have call predecessors, (676), 206 states have return successors, (695), 671 states have call predecessors, (695), 675 states have call successors, (695) [2025-03-04 04:01:08,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 4265 transitions. [2025-03-04 04:01:08,378 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 4265 transitions. Word has length 112 [2025-03-04 04:01:08,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:08,379 INFO L471 AbstractCegarLoop]: Abstraction has 3073 states and 4265 transitions. [2025-03-04 04:01:08,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 04:01:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 4265 transitions. [2025-03-04 04:01:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-03-04 04:01:08,391 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:08,391 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 04:01:08,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 04:01:08,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:08,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash -443875253, now seen corresponding path program 1 times [2025-03-04 04:01:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635634860] [2025-03-04 04:01:08,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:08,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-03-04 04:01:08,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-03-04 04:01:08,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:08,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:08,812 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2025-03-04 04:01:08,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:08,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635634860] [2025-03-04 04:01:08,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635634860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:08,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:08,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:08,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518926022] [2025-03-04 04:01:08,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:08,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:08,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:08,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:08,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:08,815 INFO L87 Difference]: Start difference. First operand 3073 states and 4265 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:01:09,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:09,086 INFO L93 Difference]: Finished difference Result 8037 states and 11104 transitions. [2025-03-04 04:01:09,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:09,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 243 [2025-03-04 04:01:09,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:09,112 INFO L225 Difference]: With dead ends: 8037 [2025-03-04 04:01:09,113 INFO L226 Difference]: Without dead ends: 5002 [2025-03-04 04:01:09,123 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-04 04:01:09,124 INFO L435 NwaCegarLoop]: 1156 mSDtfsCounter, 707 mSDsluCounter, 1033 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 2189 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:09,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 2189 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:09,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2025-03-04 04:01:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4991. [2025-03-04 04:01:09,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4991 states, 3540 states have (on average 1.3245762711864406) internal successors, (4689), 3592 states have internal predecessors, (4689), 1076 states have call successors, (1076), 375 states have call predecessors, (1076), 374 states have return successors, (1111), 1071 states have call predecessors, (1111), 1075 states have call successors, (1111) [2025-03-04 04:01:09,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4991 states to 4991 states and 6876 transitions. [2025-03-04 04:01:09,331 INFO L78 Accepts]: Start accepts. Automaton has 4991 states and 6876 transitions. Word has length 243 [2025-03-04 04:01:09,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:09,333 INFO L471 AbstractCegarLoop]: Abstraction has 4991 states and 6876 transitions. [2025-03-04 04:01:09,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:01:09,333 INFO L276 IsEmpty]: Start isEmpty. Operand 4991 states and 6876 transitions. [2025-03-04 04:01:09,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-03-04 04:01:09,348 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:09,348 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 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-03-04 04:01:09,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 04:01:09,348 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:09,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:09,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1104986509, now seen corresponding path program 1 times [2025-03-04 04:01:09,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:09,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912296934] [2025-03-04 04:01:09,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:09,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:09,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-04 04:01:09,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-04 04:01:09,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:09,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:09,724 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-04 04:01:09,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:09,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912296934] [2025-03-04 04:01:09,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912296934] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:09,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:09,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:09,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280908113] [2025-03-04 04:01:09,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:09,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:09,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:09,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:09,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:09,726 INFO L87 Difference]: Start difference. First operand 4991 states and 6876 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, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:01:10,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:10,160 INFO L93 Difference]: Finished difference Result 11820 states and 16203 transitions. [2025-03-04 04:01:10,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:10,161 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, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 223 [2025-03-04 04:01:10,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:10,201 INFO L225 Difference]: With dead ends: 11820 [2025-03-04 04:01:10,201 INFO L226 Difference]: Without dead ends: 6867 [2025-03-04 04:01:10,219 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-04 04:01:10,220 INFO L435 NwaCegarLoop]: 1297 mSDtfsCounter, 658 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:10,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 2249 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 04:01:10,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6867 states. [2025-03-04 04:01:10,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6867 to 6854. [2025-03-04 04:01:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6854 states, 4896 states have (on average 1.3131127450980393) internal successors, (6429), 4980 states have internal predecessors, (6429), 1441 states have call successors, (1441), 517 states have call predecessors, (1441), 516 states have return successors, (1488), 1432 states have call predecessors, (1488), 1440 states have call successors, (1488) [2025-03-04 04:01:10,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6854 states to 6854 states and 9358 transitions. [2025-03-04 04:01:10,584 INFO L78 Accepts]: Start accepts. Automaton has 6854 states and 9358 transitions. Word has length 223 [2025-03-04 04:01:10,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:10,585 INFO L471 AbstractCegarLoop]: Abstraction has 6854 states and 9358 transitions. [2025-03-04 04:01:10,588 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, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:01:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 6854 states and 9358 transitions. [2025-03-04 04:01:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2025-03-04 04:01:10,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:10,611 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 3, 3, 3, 3, 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] [2025-03-04 04:01:10,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 04:01:10,611 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:10,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:10,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1444166089, now seen corresponding path program 1 times [2025-03-04 04:01:10,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:10,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6489463] [2025-03-04 04:01:10,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:10,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:10,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-04 04:01:10,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-04 04:01:10,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:10,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:11,141 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 412 trivial. 0 not checked. [2025-03-04 04:01:11,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6489463] [2025-03-04 04:01:11,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6489463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:11,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:11,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:11,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724775548] [2025-03-04 04:01:11,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:11,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:11,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:11,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:11,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:11,143 INFO L87 Difference]: Start difference. First operand 6854 states and 9358 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-04 04:01:15,161 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-03-04 04:01:15,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:15,465 INFO L93 Difference]: Finished difference Result 16292 states and 22178 transitions. [2025-03-04 04:01:15,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:15,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 254 [2025-03-04 04:01:15,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:15,523 INFO L225 Difference]: With dead ends: 16292 [2025-03-04 04:01:15,523 INFO L226 Difference]: Without dead ends: 9487 [2025-03-04 04:01:15,549 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-04 04:01:15,550 INFO L435 NwaCegarLoop]: 1137 mSDtfsCounter, 973 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 973 SdHoareTripleChecker+Valid, 1955 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:15,550 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [973 Valid, 1955 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-03-04 04:01:15,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9487 states. [2025-03-04 04:01:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9487 to 9472. [2025-03-04 04:01:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9472 states, 6770 states have (on average 1.3091580502215658) internal successors, (8863), 6878 states have internal predecessors, (8863), 1943 states have call successors, (1943), 759 states have call predecessors, (1943), 758 states have return successors, (2006), 1934 states have call predecessors, (2006), 1942 states have call successors, (2006) [2025-03-04 04:01:15,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9472 states to 9472 states and 12812 transitions. [2025-03-04 04:01:15,967 INFO L78 Accepts]: Start accepts. Automaton has 9472 states and 12812 transitions. Word has length 254 [2025-03-04 04:01:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:15,967 INFO L471 AbstractCegarLoop]: Abstraction has 9472 states and 12812 transitions. [2025-03-04 04:01:15,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-04 04:01:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 9472 states and 12812 transitions. [2025-03-04 04:01:15,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-04 04:01:15,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:15,982 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 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-03-04 04:01:15,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 04:01:15,983 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:15,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:15,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1053071397, now seen corresponding path program 1 times [2025-03-04 04:01:15,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:15,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720279444] [2025-03-04 04:01:15,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:15,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:16,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-04 04:01:16,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-04 04:01:16,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:16,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:16,365 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2025-03-04 04:01:16,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:16,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720279444] [2025-03-04 04:01:16,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720279444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:16,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:16,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:16,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215130721] [2025-03-04 04:01:16,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:16,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:16,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:16,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:16,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:16,367 INFO L87 Difference]: Start difference. First operand 9472 states and 12812 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-04 04:01:20,380 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-03-04 04:01:20,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:20,963 INFO L93 Difference]: Finished difference Result 24946 states and 33746 transitions. [2025-03-04 04:01:20,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:20,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 235 [2025-03-04 04:01:20,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:21,037 INFO L225 Difference]: With dead ends: 24946 [2025-03-04 04:01:21,037 INFO L226 Difference]: Without dead ends: 15523 [2025-03-04 04:01:21,072 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-04 04:01:21,074 INFO L435 NwaCegarLoop]: 1628 mSDtfsCounter, 910 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 55 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 2607 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:21,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [910 Valid, 2607 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 143 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-03-04 04:01:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15523 states. [2025-03-04 04:01:21,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15523 to 15510. [2025-03-04 04:01:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15510 states, 11200 states have (on average 1.2904464285714285) internal successors, (14453), 11380 states have internal predecessors, (14453), 3007 states have call successors, (3007), 1303 states have call predecessors, (3007), 1302 states have return successors, (3104), 2994 states have call predecessors, (3104), 3006 states have call successors, (3104) [2025-03-04 04:01:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15510 states to 15510 states and 20564 transitions. [2025-03-04 04:01:21,600 INFO L78 Accepts]: Start accepts. Automaton has 15510 states and 20564 transitions. Word has length 235 [2025-03-04 04:01:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:21,600 INFO L471 AbstractCegarLoop]: Abstraction has 15510 states and 20564 transitions. [2025-03-04 04:01:21,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (32), 2 states have call predecessors, (32), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2025-03-04 04:01:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 15510 states and 20564 transitions. [2025-03-04 04:01:21,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-04 04:01:21,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:21,619 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 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-03-04 04:01:21,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 04:01:21,619 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:21,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:21,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1775717477, now seen corresponding path program 1 times [2025-03-04 04:01:21,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:21,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670232098] [2025-03-04 04:01:21,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:21,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:21,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-04 04:01:21,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-04 04:01:21,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:21,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:22,445 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2025-03-04 04:01:22,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:22,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670232098] [2025-03-04 04:01:22,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670232098] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:22,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:22,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 04:01:22,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037304199] [2025-03-04 04:01:22,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:22,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 04:01:22,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:22,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 04:01:22,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:22,447 INFO L87 Difference]: Start difference. First operand 15510 states and 20564 transitions. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:01:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:22,962 INFO L93 Difference]: Finished difference Result 31089 states and 41396 transitions. [2025-03-04 04:01:22,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 04:01:22,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) Word has length 235 [2025-03-04 04:01:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:23,108 INFO L225 Difference]: With dead ends: 31089 [2025-03-04 04:01:23,109 INFO L226 Difference]: Without dead ends: 15628 [2025-03-04 04:01:23,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 04:01:23,136 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 0 mSDsluCounter, 3313 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4419 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:23,137 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4419 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 04:01:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15628 states. [2025-03-04 04:01:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15628 to 15622. [2025-03-04 04:01:23,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15622 states, 11284 states have (on average 1.2882842963488126) internal successors, (14537), 11464 states have internal predecessors, (14537), 3007 states have call successors, (3007), 1303 states have call predecessors, (3007), 1330 states have return successors, (3138), 3022 states have call predecessors, (3138), 3006 states have call successors, (3138) [2025-03-04 04:01:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15622 states to 15622 states and 20682 transitions. [2025-03-04 04:01:23,572 INFO L78 Accepts]: Start accepts. Automaton has 15622 states and 20682 transitions. Word has length 235 [2025-03-04 04:01:23,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:23,573 INFO L471 AbstractCegarLoop]: Abstraction has 15622 states and 20682 transitions. [2025-03-04 04:01:23,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (32), 2 states have call predecessors, (32), 3 states have return successors, (31), 3 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:01:23,574 INFO L276 IsEmpty]: Start isEmpty. Operand 15622 states and 20682 transitions. [2025-03-04 04:01:23,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-04 04:01:23,590 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:23,591 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 3, 3, 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] [2025-03-04 04:01:23,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 04:01:23,591 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:23,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:23,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1057966993, now seen corresponding path program 1 times [2025-03-04 04:01:23,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:23,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165015392] [2025-03-04 04:01:23,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:23,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:23,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-04 04:01:23,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-04 04:01:23,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:23,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:24,042 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 04:01:24,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:24,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165015392] [2025-03-04 04:01:24,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165015392] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:24,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:24,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:01:24,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780356752] [2025-03-04 04:01:24,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:24,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:01:24,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:24,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:01:24,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:01:24,044 INFO L87 Difference]: Start difference. First operand 15622 states and 20682 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 04:01:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:24,341 INFO L93 Difference]: Finished difference Result 31243 states and 41428 transitions. [2025-03-04 04:01:24,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:01:24,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) Word has length 242 [2025-03-04 04:01:24,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:24,412 INFO L225 Difference]: With dead ends: 31243 [2025-03-04 04:01:24,412 INFO L226 Difference]: Without dead ends: 15670 [2025-03-04 04:01:24,453 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-04 04:01:24,454 INFO L435 NwaCegarLoop]: 1106 mSDtfsCounter, 1 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:24,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2208 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:01:24,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2025-03-04 04:01:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15646. [2025-03-04 04:01:24,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15646 states, 11308 states have (on average 1.2876724442872303) internal successors, (14561), 11488 states have internal predecessors, (14561), 3007 states have call successors, (3007), 1303 states have call predecessors, (3007), 1330 states have return successors, (3138), 3022 states have call predecessors, (3138), 3006 states have call successors, (3138) [2025-03-04 04:01:24,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15646 states to 15646 states and 20706 transitions. [2025-03-04 04:01:24,963 INFO L78 Accepts]: Start accepts. Automaton has 15646 states and 20706 transitions. Word has length 242 [2025-03-04 04:01:24,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:24,964 INFO L471 AbstractCegarLoop]: Abstraction has 15646 states and 20706 transitions. [2025-03-04 04:01:24,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (33), 2 states have call predecessors, (33), 2 states have return successors, (32), 2 states have call predecessors, (32), 1 states have call successors, (32) [2025-03-04 04:01:24,964 INFO L276 IsEmpty]: Start isEmpty. Operand 15646 states and 20706 transitions. [2025-03-04 04:01:24,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2025-03-04 04:01:24,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:24,981 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 3, 3, 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] [2025-03-04 04:01:24,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 04:01:24,981 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:24,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:24,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1914658573, now seen corresponding path program 1 times [2025-03-04 04:01:24,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:24,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509172007] [2025-03-04 04:01:24,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:24,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:25,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-04 04:01:25,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 04:01:25,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:25,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:25,400 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-03-04 04:01:25,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:25,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509172007] [2025-03-04 04:01:25,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509172007] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:25,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939466815] [2025-03-04 04:01:25,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:25,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 04:01:25,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 04:01:25,404 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 04:01:25,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 04:01:26,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-04 04:01:26,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-04 04:01:26,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:26,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:26,526 INFO L256 TraceCheckSpWp]: Trace formula consists of 2370 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 04:01:26,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 04:01:27,018 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 106 proven. 8 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-03-04 04:01:27,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 04:01:28,580 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 04:01:28,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939466815] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 04:01:28,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 04:01:28,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [4, 9] total 17 [2025-03-04 04:01:28,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287288247] [2025-03-04 04:01:28,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:28,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 04:01:28,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:28,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 04:01:28,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2025-03-04 04:01:28,582 INFO L87 Difference]: Start difference. First operand 15646 states and 20706 transitions. Second operand has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 7 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (32), 7 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-04 04:01:32,597 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-03-04 04:01:36,609 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-03-04 04:01:40,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:01:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:01:47,561 INFO L93 Difference]: Finished difference Result 41700 states and 58032 transitions. [2025-03-04 04:01:47,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 04:01:47,561 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 7 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (32), 7 states have call predecessors, (32), 6 states have call successors, (32) Word has length 244 [2025-03-04 04:01:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:01:47,706 INFO L225 Difference]: With dead ends: 41700 [2025-03-04 04:01:47,706 INFO L226 Difference]: Without dead ends: 33883 [2025-03-04 04:01:47,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 476 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=446, Unknown=0, NotChecked=0, Total=600 [2025-03-04 04:01:47,746 INFO L435 NwaCegarLoop]: 1590 mSDtfsCounter, 4968 mSDsluCounter, 3666 mSDsCounter, 0 mSdLazyCounter, 4530 mSolverCounterSat, 1841 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5162 SdHoareTripleChecker+Valid, 5256 SdHoareTripleChecker+Invalid, 6374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1841 IncrementalHoareTripleChecker+Valid, 4530 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.6s IncrementalHoareTripleChecker+Time [2025-03-04 04:01:47,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5162 Valid, 5256 Invalid, 6374 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1841 Valid, 4530 Invalid, 3 Unknown, 0 Unchecked, 17.6s Time] [2025-03-04 04:01:47,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33883 states. [2025-03-04 04:01:48,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33883 to 24980. [2025-03-04 04:01:48,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24980 states, 17873 states have (on average 1.2870251216919375) internal successors, (23003), 18283 states have internal predecessors, (23003), 4881 states have call successors, (4881), 1952 states have call predecessors, (4881), 2225 states have return successors, (5687), 5038 states have call predecessors, (5687), 4880 states have call successors, (5687) [2025-03-04 04:01:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24980 states to 24980 states and 33571 transitions. [2025-03-04 04:01:48,890 INFO L78 Accepts]: Start accepts. Automaton has 24980 states and 33571 transitions. Word has length 244 [2025-03-04 04:01:48,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:01:48,890 INFO L471 AbstractCegarLoop]: Abstraction has 24980 states and 33571 transitions. [2025-03-04 04:01:48,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.666666666666666) internal successors, (132), 9 states have internal predecessors, (132), 7 states have call successors, (33), 4 states have call predecessors, (33), 4 states have return successors, (32), 7 states have call predecessors, (32), 6 states have call successors, (32) [2025-03-04 04:01:48,891 INFO L276 IsEmpty]: Start isEmpty. Operand 24980 states and 33571 transitions. [2025-03-04 04:01:48,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-04 04:01:48,914 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:01:48,914 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 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-03-04 04:01:48,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 04:01:49,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-04 04:01:49,119 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:01:49,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:01:49,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1550371302, now seen corresponding path program 1 times [2025-03-04 04:01:49,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:01:49,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613997003] [2025-03-04 04:01:49,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:01:49,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:01:49,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-04 04:01:49,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-04 04:01:49,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:01:49,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:01:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 04:01:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:01:49,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613997003] [2025-03-04 04:01:49,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613997003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:01:49,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:01:49,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 04:01:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120236147] [2025-03-04 04:01:49,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:01:49,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 04:01:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:01:49,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 04:01:49,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-03-04 04:01:49,971 INFO L87 Difference]: Start difference. First operand 24980 states and 33571 transitions. Second operand has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 5 states have call successors, (32), 4 states have call predecessors, (32), 3 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-04 04:01:53,988 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-03-04 04:01:58,007 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-03-04 04:02:02,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:02:06,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 04:02:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:02:10,905 INFO L93 Difference]: Finished difference Result 53691 states and 72078 transitions. [2025-03-04 04:02:10,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 04:02:10,905 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 5 states have call successors, (32), 4 states have call predecessors, (32), 3 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) Word has length 237 [2025-03-04 04:02:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:02:11,064 INFO L225 Difference]: With dead ends: 53691 [2025-03-04 04:02:11,064 INFO L226 Difference]: Without dead ends: 28760 [2025-03-04 04:02:11,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2025-03-04 04:02:11,144 INFO L435 NwaCegarLoop]: 669 mSDtfsCounter, 1962 mSDsluCounter, 2460 mSDsCounter, 0 mSdLazyCounter, 3810 mSolverCounterSat, 795 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2159 SdHoareTripleChecker+Valid, 3129 SdHoareTripleChecker+Invalid, 4609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 795 IncrementalHoareTripleChecker+Valid, 3810 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.8s IncrementalHoareTripleChecker+Time [2025-03-04 04:02:11,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2159 Valid, 3129 Invalid, 4609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [795 Valid, 3810 Invalid, 4 Unknown, 0 Unchecked, 19.8s Time] [2025-03-04 04:02:11,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28760 states. [2025-03-04 04:02:12,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28760 to 27878. [2025-03-04 04:02:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27878 states, 19697 states have (on average 1.271614966746205) internal successors, (25047), 20233 states have internal predecessors, (25047), 5469 states have call successors, (5469), 2274 states have call predecessors, (5469), 2711 states have return successors, (6695), 5706 states have call predecessors, (6695), 5468 states have call successors, (6695) [2025-03-04 04:02:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27878 states to 27878 states and 37211 transitions. [2025-03-04 04:02:12,351 INFO L78 Accepts]: Start accepts. Automaton has 27878 states and 37211 transitions. Word has length 237 [2025-03-04 04:02:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 04:02:12,351 INFO L471 AbstractCegarLoop]: Abstraction has 27878 states and 37211 transitions. [2025-03-04 04:02:12,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.0) internal successors, (126), 8 states have internal predecessors, (126), 5 states have call successors, (32), 4 states have call predecessors, (32), 3 states have return successors, (31), 5 states have call predecessors, (31), 4 states have call successors, (31) [2025-03-04 04:02:12,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27878 states and 37211 transitions. [2025-03-04 04:02:12,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-04 04:02:12,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 04:02:12,365 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 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] [2025-03-04 04:02:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 04:02:12,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 04:02:12,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 04:02:12,365 INFO L85 PathProgramCache]: Analyzing trace with hash 353240297, now seen corresponding path program 1 times [2025-03-04 04:02:12,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 04:02:12,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129669507] [2025-03-04 04:02:12,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 04:02:12,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 04:02:12,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-04 04:02:12,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-04 04:02:12,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 04:02:12,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 04:02:12,800 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 04:02:12,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 04:02:12,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129669507] [2025-03-04 04:02:12,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129669507] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 04:02:12,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 04:02:12,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 04:02:12,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553429787] [2025-03-04 04:02:12,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 04:02:12,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 04:02:12,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 04:02:12,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 04:02:12,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 04:02:12,802 INFO L87 Difference]: Start difference. First operand 27878 states and 37211 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-04 04:02:13,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 04:02:13,602 INFO L93 Difference]: Finished difference Result 47661 states and 64223 transitions. [2025-03-04 04:02:13,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 04:02:13,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 236 [2025-03-04 04:02:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 04:02:13,758 INFO L225 Difference]: With dead ends: 47661 [2025-03-04 04:02:13,759 INFO L226 Difference]: Without dead ends: 27598 [2025-03-04 04:02:13,833 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-04 04:02:13,834 INFO L435 NwaCegarLoop]: 1107 mSDtfsCounter, 2 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 04:02:13,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2208 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 04:02:13,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27598 states.