./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i --full-output --witness-type correctness_witness --witnessparser.only.consider.loop.invariants false --validate ./goblint.2024-06-19_11-23-25.files/protection/race-4_1-thread_local_vars.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7724a2de Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReachWitnessValidation.xml -i ../../../trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i ./goblint.2024-06-19_11-23-25.files/protection/race-4_1-thread_local_vars.yml/witness.yml -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --traceabstraction.compute.hoare.annotation.of.negated.interpolant.automaton,.abstraction.and.cfg false --witnessparser.only.consider.loop.invariants false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-7724a2d-m [2024-06-27 17:58:46,861 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-27 17:58:46,917 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-27 17:58:46,923 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-27 17:58:46,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-27 17:58:46,946 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-27 17:58:46,947 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-27 17:58:46,947 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-27 17:58:46,948 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-27 17:58:46,948 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-27 17:58:46,948 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-27 17:58:46,949 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-27 17:58:46,949 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-27 17:58:46,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-27 17:58:46,950 INFO L153 SettingsManager]: * Use SBE=true [2024-06-27 17:58:46,950 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-27 17:58:46,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-27 17:58:46,950 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-27 17:58:46,951 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-27 17:58:46,951 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-27 17:58:46,951 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-27 17:58:46,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-27 17:58:46,952 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-27 17:58:46,952 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-27 17:58:46,952 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-27 17:58:46,953 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-27 17:58:46,953 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-27 17:58:46,953 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-27 17:58:46,954 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-27 17:58:46,954 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-27 17:58:46,954 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-27 17:58:46,954 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-27 17:58:46,955 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:58:46,955 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-27 17:58:46,955 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-27 17:58:46,955 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-27 17:58:46,956 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-27 17:58:46,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-27 17:58:46,956 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-27 17:58:46,956 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-27 17:58:46,957 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-27 17:58:46,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-27 17:58:46,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-27 17:58:46,959 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessparser: Only consider loop invariants -> false [2024-06-27 17:58:47,143 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-27 17:58:47,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-27 17:58:47,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-27 17:58:47,160 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-27 17:58:47,160 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-27 17:58:47,161 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-06-19_11-23-25.files/protection/race-4_1-thread_local_vars.yml/witness.yml [2024-06-27 17:58:47,256 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-27 17:58:47,256 INFO L274 PluginConnector]: CDTParser initialized [2024-06-27 17:58:47,256 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i [2024-06-27 17:58:48,265 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-27 17:58:48,504 INFO L384 CDTParser]: Found 1 translation units. [2024-06-27 17:58:48,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i [2024-06-27 17:58:48,533 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3aeb33d/b7197bce8d414080a60d652fef705cd8/FLAG520916ee7 [2024-06-27 17:58:48,549 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce3aeb33d/b7197bce8d414080a60d652fef705cd8 [2024-06-27 17:58:48,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-27 17:58:48,550 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-27 17:58:48,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-27 17:58:48,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-27 17:58:48,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-27 17:58:48,558 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:58:47" (1/2) ... [2024-06-27 17:58:48,559 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5ccff8 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:58:48, skipping insertion in model container [2024-06-27 17:58:48,559 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:58:47" (1/2) ... [2024-06-27 17:58:48,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2802ff76 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 27.06 05:58:48, skipping insertion in model container [2024-06-27 17:58:48,560 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:58:48" (2/2) ... [2024-06-27 17:58:48,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5ccff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:48, skipping insertion in model container [2024-06-27 17:58:48,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.06 05:58:48" (2/2) ... [2024-06-27 17:58:48,561 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-27 17:58:48,599 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-27 17:58:48,601 INFO L97 edCorrectnessWitness]: Location invariant before [L1719-L1719] (! multithreaded || (ldv_usb_state == 0 || ldv_usb_state == 1)) && (! multithreaded || ((((pdev == 1 || pdev == 5) || pdev == 6) || pdev == 8) || pdev == 9)) [2024-06-27 17:58:48,601 INFO L97 edCorrectnessWitness]: Location invariant before [L1781-L1781] (! multithreaded || (ldv_usb_state == 0 || ldv_usb_state == 1)) && (! multithreaded || ((((pdev == 1 || pdev == 5) || pdev == 6) || pdev == 8) || pdev == 9)) [2024-06-27 17:58:48,601 INFO L103 edCorrectnessWitness]: ghost_variable mutex_locked = 0 [2024-06-27 17:58:48,601 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-27 17:58:48,601 INFO L106 edCorrectnessWitness]: ghost_update [L1701-L1701] mutex_locked = 0; [2024-06-27 17:58:48,604 INFO L106 edCorrectnessWitness]: ghost_update [L1698-L1698] mutex_locked = 1; [2024-06-27 17:58:48,604 INFO L106 edCorrectnessWitness]: ghost_update [L1780-L1780] multithreaded = 1; [2024-06-27 17:58:48,646 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-27 17:58:49,131 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i[76081,76094] [2024-06-27 17:58:49,185 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:58:49,196 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local [2024-06-27 17:58:49,278 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i[76081,76094] Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-27 17:58:49,309 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-27 17:58:49,389 INFO L206 MainTranslator]: Completed translation [2024-06-27 17:58:49,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49 WrapperNode [2024-06-27 17:58:49,390 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-27 17:58:49,391 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-27 17:58:49,392 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-27 17:58:49,392 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-27 17:58:49,398 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,455 INFO L138 Inliner]: procedures = 487, calls = 36, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 211 [2024-06-27 17:58:49,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-27 17:58:49,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-27 17:58:49,456 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-27 17:58:49,456 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-27 17:58:49,465 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,465 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,468 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,480 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [2, 5, 1, 1]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0]. The 2 writes are split as follows [0, 0, 1, 1]. [2024-06-27 17:58:49,481 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,481 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,488 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,497 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-27 17:58:49,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-27 17:58:49,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-27 17:58:49,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-27 17:58:49,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (1/1) ... [2024-06-27 17:58:49,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-27 17:58:49,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-27 17:58:49,525 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) [2024-06-27 17:58:49,535 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 [2024-06-27 17:58:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-06-27 17:58:49,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-06-27 17:58:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-27 17:58:49,562 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-06-27 17:58:49,562 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-06-27 17:58:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-27 17:58:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-27 17:58:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-27 17:58:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-27 17:58:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-27 17:58:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-06-27 17:58:49,563 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-27 17:58:49,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-27 17:58:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-27 17:58:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-27 17:58:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-27 17:58:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-27 17:58:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-27 17:58:49,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-27 17:58:49,565 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-27 17:58:49,791 INFO L244 CfgBuilder]: Building ICFG [2024-06-27 17:58:49,793 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-27 17:58:50,073 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-27 17:58:50,074 INFO L293 CfgBuilder]: Performing block encoding [2024-06-27 17:58:50,184 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-27 17:58:50,185 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-27 17:58:50,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:58:50 BoogieIcfgContainer [2024-06-27 17:58:50,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-27 17:58:50,187 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-27 17:58:50,187 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-27 17:58:50,189 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-27 17:58:50,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 27.06 05:58:47" (1/4) ... [2024-06-27 17:58:50,190 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e6b52c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 27.06 05:58:50, skipping insertion in model container [2024-06-27 17:58:50,190 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.06 05:58:48" (2/4) ... [2024-06-27 17:58:50,191 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e6b52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:58:50, skipping insertion in model container [2024-06-27 17:58:50,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.06 05:58:49" (3/4) ... [2024-06-27 17:58:50,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e6b52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.06 05:58:50, skipping insertion in model container [2024-06-27 17:58:50,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.06 05:58:50" (4/4) ... [2024-06-27 17:58:50,193 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2024-06-27 17:58:50,208 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-27 17:58:50,208 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2024-06-27 17:58:50,208 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-27 17:58:50,280 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-06-27 17:58:50,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 127 transitions, 281 flow [2024-06-27 17:58:50,363 INFO L124 PetriNetUnfolderBase]: 28/125 cut-off events. [2024-06-27 17:58:50,363 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-27 17:58:50,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 125 events. 28/125 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 356 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 95. Up to 11 conditions per place. [2024-06-27 17:58:50,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 127 transitions, 281 flow [2024-06-27 17:58:50,371 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 84 transitions, 184 flow [2024-06-27 17:58:50,401 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-27 17:58:50,406 INFO L357 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, mHoare=false, 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;@7ed7b8dd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-27 17:58:50,406 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-06-27 17:58:50,408 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-27 17:58:50,408 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-06-27 17:58:50,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-27 17:58:50,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:50,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-06-27 17:58:50,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:50,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash 553144, now seen corresponding path program 1 times [2024-06-27 17:58:50,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:50,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140795873] [2024-06-27 17:58:50,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:50,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:50,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:50,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:50,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140795873] [2024-06-27 17:58:50,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140795873] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:50,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:50,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:58:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834223023] [2024-06-27 17:58:50,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:50,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:58:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:50,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:58:50,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:58:50,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 46 out of 127 [2024-06-27 17:58:50,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 84 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:50,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:50,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 46 of 127 [2024-06-27 17:58:50,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:50,939 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([598] L1746-2-->L1745-2: Formula: true InVars {} OutVars{thread_usbThread1of1ForFork1_#t~nondet40#1=|v_thread_usbThread1of1ForFork1_#t~nondet40#1_7|, thread_usbThread1of1ForFork1_#t~switch41#1=|v_thread_usbThread1of1ForFork1_#t~switch41#1_15|} AuxVars[] AssignedVars[thread_usbThread1of1ForFork1_#t~nondet40#1, thread_usbThread1of1ForFork1_#t~switch41#1][22], [5#L1745-2true, thread_ath9kThread1of1ForFork0NotInUse, 2#ULTIMATE.startEXITtrue, thread_usbThread1of1ForFork1InUse, 105#true]) [2024-06-27 17:58:50,940 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2024-06-27 17:58:50,940 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 17:58:50,940 INFO L297 olderBase$Statistics]: existing Event has 17 ancestors and is cut-off event [2024-06-27 17:58:50,941 INFO L297 olderBase$Statistics]: existing Event has 16 ancestors and is cut-off event [2024-06-27 17:58:51,271 INFO L124 PetriNetUnfolderBase]: 2174/4001 cut-off events. [2024-06-27 17:58:51,271 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2024-06-27 17:58:51,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7268 conditions, 4001 events. 2174/4001 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 219. Compared 26096 event pairs, 1753 based on Foata normal form. 187/3572 useless extension candidates. Maximal degree in co-relation 7000. Up to 3172 conditions per place. [2024-06-27 17:58:51,333 INFO L140 encePairwiseOnDemand]: 114/127 looper letters, 50 selfloop transitions, 4 changer transitions 2/81 dead transitions. [2024-06-27 17:58:51,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 290 flow [2024-06-27 17:58:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:58:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:58:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 204 transitions. [2024-06-27 17:58:51,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354330708661418 [2024-06-27 17:58:51,347 INFO L175 Difference]: Start difference. First operand has 72 places, 84 transitions, 184 flow. Second operand 3 states and 204 transitions. [2024-06-27 17:58:51,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 290 flow [2024-06-27 17:58:51,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 81 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:58:51,355 INFO L231 Difference]: Finished difference. Result has 66 places, 70 transitions, 160 flow [2024-06-27 17:58:51,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=66, PETRI_TRANSITIONS=70} [2024-06-27 17:58:51,361 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2024-06-27 17:58:51,361 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 70 transitions, 160 flow [2024-06-27 17:58:51,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:51,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:51,362 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:51,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-27 17:58:51,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:51,363 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:51,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1570197953, now seen corresponding path program 1 times [2024-06-27 17:58:51,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:51,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770080665] [2024-06-27 17:58:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:51,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:51,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:51,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:51,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:51,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770080665] [2024-06-27 17:58:51,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770080665] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:51,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:51,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-27 17:58:51,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048332335] [2024-06-27 17:58:51,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:51,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:58:51,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:51,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:58:51,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:58:51,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 127 [2024-06-27 17:58:51,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 70 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:51,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:51,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 127 [2024-06-27 17:58:51,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:51,971 INFO L124 PetriNetUnfolderBase]: 3652/6356 cut-off events. [2024-06-27 17:58:51,971 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-06-27 17:58:51,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11610 conditions, 6356 events. 3652/6356 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 331. Compared 42773 event pairs, 951 based on Foata normal form. 11/5219 useless extension candidates. Maximal degree in co-relation 11414. Up to 4556 conditions per place. [2024-06-27 17:58:52,000 INFO L140 encePairwiseOnDemand]: 118/127 looper letters, 69 selfloop transitions, 4 changer transitions 0/96 dead transitions. [2024-06-27 17:58:52,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 361 flow [2024-06-27 17:58:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:58:52,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:58:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-06-27 17:58:52,010 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5590551181102362 [2024-06-27 17:58:52,011 INFO L175 Difference]: Start difference. First operand has 66 places, 70 transitions, 160 flow. Second operand 3 states and 213 transitions. [2024-06-27 17:58:52,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 361 flow [2024-06-27 17:58:52,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 353 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:58:52,016 INFO L231 Difference]: Finished difference. Result has 66 places, 73 transitions, 186 flow [2024-06-27 17:58:52,016 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=186, PETRI_PLACES=66, PETRI_TRANSITIONS=73} [2024-06-27 17:58:52,017 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2024-06-27 17:58:52,017 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 73 transitions, 186 flow [2024-06-27 17:58:52,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:52,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:52,017 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:52,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-27 17:58:52,018 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:52,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash -923501937, now seen corresponding path program 1 times [2024-06-27 17:58:52,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:52,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678756423] [2024-06-27 17:58:52,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:52,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:52,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:52,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:52,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678756423] [2024-06-27 17:58:52,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678756423] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:52,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:52,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-27 17:58:52,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13911481] [2024-06-27 17:58:52,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:52,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:58:52,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:52,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:58:52,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:58:52,139 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 127 [2024-06-27 17:58:52,140 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 73 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:52,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:52,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 127 [2024-06-27 17:58:52,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:52,675 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L1770-->L1693-7: Formula: (let ((.cse0 (= 9 v_~pdev~0_24))) (and (= |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1| (ite .cse0 1 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1| |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|))) InVars {} OutVars{thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, ~pdev~0=v_~pdev~0_24, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[~pdev~0, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][75], [112#true, thread_ath9kThread1of1ForFork0InUse, 7#L1693-7true, 22#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 108#true, 68#L1706-1true, Black: 110#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-27 17:58:52,675 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-27 17:58:52,675 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-27 17:58:52,676 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:58:52,676 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-27 17:58:52,677 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L1770-->L1693-7: Formula: (let ((.cse0 (= 9 v_~pdev~0_24))) (and (= |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1| (ite .cse0 1 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1| |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|))) InVars {} OutVars{thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, ~pdev~0=v_~pdev~0_24, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[~pdev~0, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][75], [112#true, thread_ath9kThread1of1ForFork0InUse, 7#L1693-7true, 22#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 108#true, 87#L1709-1true, Black: 110#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-27 17:58:52,677 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-27 17:58:52,678 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:58:52,678 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:58:52,678 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 17:58:52,678 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L1770-->L1693-7: Formula: (let ((.cse0 (= 9 v_~pdev~0_24))) (and (= |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1| (ite .cse0 1 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1| |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|))) InVars {} OutVars{thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, ~pdev~0=v_~pdev~0_24, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[~pdev~0, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][75], [112#true, 83#L1698true, thread_ath9kThread1of1ForFork0InUse, 7#L1693-7true, 22#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 108#true, Black: 110#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-27 17:58:52,678 INFO L294 olderBase$Statistics]: this new event has 50 ancestors and is cut-off event [2024-06-27 17:58:52,678 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-27 17:58:52,679 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-27 17:58:52,679 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2024-06-27 17:58:52,679 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L1770-->L1693-7: Formula: (let ((.cse0 (= 9 v_~pdev~0_24))) (and (= |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1| (ite .cse0 1 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1| |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|))) InVars {} OutVars{thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, ~pdev~0=v_~pdev~0_24, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[~pdev~0, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][75], [17#L1698-3true, 112#true, thread_ath9kThread1of1ForFork0InUse, 7#L1693-7true, 22#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 108#true, Black: 110#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-27 17:58:52,680 INFO L294 olderBase$Statistics]: this new event has 51 ancestors and is cut-off event [2024-06-27 17:58:52,680 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 17:58:52,680 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:58:52,680 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-27 17:58:52,681 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L1770-->L1693-7: Formula: (let ((.cse0 (= 9 v_~pdev~0_24))) (and (= |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1| (ite .cse0 1 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1| |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|))) InVars {} OutVars{thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, ~pdev~0=v_~pdev~0_24, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[~pdev~0, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][75], [112#true, thread_ath9kThread1of1ForFork0InUse, 35#thread_ath9kEXITtrue, 7#L1693-7true, 22#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 108#true, Black: 110#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-27 17:58:52,681 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-27 17:58:52,681 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-27 17:58:52,681 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:58:52,682 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2024-06-27 17:58:52,682 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L1770-->L1693-7: Formula: (let ((.cse0 (= 9 v_~pdev~0_24))) (and (= |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1| (ite .cse0 1 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1| |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|))) InVars {} OutVars{thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, ~pdev~0=v_~pdev~0_24, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[~pdev~0, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][75], [112#true, 74#L1704-2true, thread_ath9kThread1of1ForFork0InUse, 7#L1693-7true, 22#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 108#true, Black: 110#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-27 17:58:52,682 INFO L294 olderBase$Statistics]: this new event has 52 ancestors and is cut-off event [2024-06-27 17:58:52,683 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-27 17:58:52,683 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-27 17:58:52,683 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-27 17:58:52,684 INFO L124 PetriNetUnfolderBase]: 3898/7266 cut-off events. [2024-06-27 17:58:52,684 INFO L125 PetriNetUnfolderBase]: For 634/649 co-relation queries the response was YES. [2024-06-27 17:58:52,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14055 conditions, 7266 events. 3898/7266 cut-off events. For 634/649 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 51829 event pairs, 2312 based on Foata normal form. 102/6336 useless extension candidates. Maximal degree in co-relation 2533. Up to 4399 conditions per place. [2024-06-27 17:58:52,722 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 83 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2024-06-27 17:58:52,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 112 transitions, 444 flow [2024-06-27 17:58:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:58:52,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:58:52,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2024-06-27 17:58:52,724 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5708661417322834 [2024-06-27 17:58:52,724 INFO L175 Difference]: Start difference. First operand has 66 places, 73 transitions, 186 flow. Second operand 4 states and 290 transitions. [2024-06-27 17:58:52,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 112 transitions, 444 flow [2024-06-27 17:58:52,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:58:52,728 INFO L231 Difference]: Finished difference. Result has 70 places, 74 transitions, 197 flow [2024-06-27 17:58:52,728 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=70, PETRI_TRANSITIONS=74} [2024-06-27 17:58:52,729 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -2 predicate places. [2024-06-27 17:58:52,729 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 74 transitions, 197 flow [2024-06-27 17:58:52,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:52,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:52,730 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:52,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-27 17:58:52,733 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:52,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:52,733 INFO L85 PathProgramCache]: Analyzing trace with hash -892904410, now seen corresponding path program 1 times [2024-06-27 17:58:52,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:52,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218726977] [2024-06-27 17:58:52,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:52,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:52,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:52,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:52,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218726977] [2024-06-27 17:58:52,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218726977] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:52,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:52,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:58:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605724445] [2024-06-27 17:58:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:52,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:58:52,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:52,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:58:52,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:58:52,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 127 [2024-06-27 17:58:52,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 74 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:52,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:52,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 127 [2024-06-27 17:58:52,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:53,445 INFO L124 PetriNetUnfolderBase]: 4939/8995 cut-off events. [2024-06-27 17:58:53,445 INFO L125 PetriNetUnfolderBase]: For 1563/1563 co-relation queries the response was YES. [2024-06-27 17:58:53,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18218 conditions, 8995 events. 4939/8995 cut-off events. For 1563/1563 co-relation queries the response was YES. Maximal size of possible extension queue 390. Compared 65473 event pairs, 2262 based on Foata normal form. 72/8019 useless extension candidates. Maximal degree in co-relation 14003. Up to 4276 conditions per place. [2024-06-27 17:58:53,480 INFO L140 encePairwiseOnDemand]: 115/127 looper letters, 84 selfloop transitions, 10 changer transitions 0/116 dead transitions. [2024-06-27 17:58:53,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 116 transitions, 476 flow [2024-06-27 17:58:53,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:58:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:58:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 266 transitions. [2024-06-27 17:58:53,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5236220472440944 [2024-06-27 17:58:53,482 INFO L175 Difference]: Start difference. First operand has 70 places, 74 transitions, 197 flow. Second operand 4 states and 266 transitions. [2024-06-27 17:58:53,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 116 transitions, 476 flow [2024-06-27 17:58:53,493 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 116 transitions, 475 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:58:53,495 INFO L231 Difference]: Finished difference. Result has 75 places, 78 transitions, 262 flow [2024-06-27 17:58:53,495 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=262, PETRI_PLACES=75, PETRI_TRANSITIONS=78} [2024-06-27 17:58:53,496 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2024-06-27 17:58:53,497 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 78 transitions, 262 flow [2024-06-27 17:58:53,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:53,498 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:53,498 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:53,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-27 17:58:53,498 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr2ASSERT_VIOLATIONERROR_FUNCTION === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:53,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:53,499 INFO L85 PathProgramCache]: Analyzing trace with hash 746423290, now seen corresponding path program 1 times [2024-06-27 17:58:53,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:53,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307964919] [2024-06-27 17:58:53,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:53,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:53,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:53,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:53,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307964919] [2024-06-27 17:58:53,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307964919] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:53,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:53,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:58:53,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603149064] [2024-06-27 17:58:53,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:53,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:58:53,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:53,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:58:53,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:58:53,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 48 out of 127 [2024-06-27 17:58:53,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 78 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:53,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:53,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 48 of 127 [2024-06-27 17:58:53,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:54,136 INFO L124 PetriNetUnfolderBase]: 4916/8557 cut-off events. [2024-06-27 17:58:54,136 INFO L125 PetriNetUnfolderBase]: For 4616/4745 co-relation queries the response was YES. [2024-06-27 17:58:54,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19311 conditions, 8557 events. 4916/8557 cut-off events. For 4616/4745 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 57427 event pairs, 2925 based on Foata normal form. 0/7556 useless extension candidates. Maximal degree in co-relation 8362. Up to 5291 conditions per place. [2024-06-27 17:58:54,175 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 64 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2024-06-27 17:58:54,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 91 transitions, 436 flow [2024-06-27 17:58:54,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:58:54,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:58:54,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 207 transitions. [2024-06-27 17:58:54,177 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433070866141733 [2024-06-27 17:58:54,177 INFO L175 Difference]: Start difference. First operand has 75 places, 78 transitions, 262 flow. Second operand 3 states and 207 transitions. [2024-06-27 17:58:54,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 91 transitions, 436 flow [2024-06-27 17:58:54,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 91 transitions, 421 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 17:58:54,191 INFO L231 Difference]: Finished difference. Result has 72 places, 74 transitions, 252 flow [2024-06-27 17:58:54,191 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=72, PETRI_TRANSITIONS=74} [2024-06-27 17:58:54,193 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2024-06-27 17:58:54,193 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 74 transitions, 252 flow [2024-06-27 17:58:54,193 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:54,193 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:54,193 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:54,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-27 17:58:54,194 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:54,194 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:54,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1286439114, now seen corresponding path program 1 times [2024-06-27 17:58:54,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:54,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267854976] [2024-06-27 17:58:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:54,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:54,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:54,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267854976] [2024-06-27 17:58:54,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267854976] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:54,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:54,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:58:54,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564904272] [2024-06-27 17:58:54,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:54,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:58:54,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:54,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:58:54,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:58:54,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 127 [2024-06-27 17:58:54,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 74 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:54,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:54,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 127 [2024-06-27 17:58:54,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:54,956 INFO L124 PetriNetUnfolderBase]: 5315/9345 cut-off events. [2024-06-27 17:58:54,956 INFO L125 PetriNetUnfolderBase]: For 5539/5539 co-relation queries the response was YES. [2024-06-27 17:58:54,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21820 conditions, 9345 events. 5315/9345 cut-off events. For 5539/5539 co-relation queries the response was YES. Maximal size of possible extension queue 255. Compared 61035 event pairs, 1418 based on Foata normal form. 190/8552 useless extension candidates. Maximal degree in co-relation 13920. Up to 6362 conditions per place. [2024-06-27 17:58:55,071 INFO L140 encePairwiseOnDemand]: 118/127 looper letters, 93 selfloop transitions, 6 changer transitions 3/121 dead transitions. [2024-06-27 17:58:55,071 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 121 transitions, 584 flow [2024-06-27 17:58:55,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:58:55,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:58:55,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2024-06-27 17:58:55,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5511811023622047 [2024-06-27 17:58:55,082 INFO L175 Difference]: Start difference. First operand has 72 places, 74 transitions, 252 flow. Second operand 4 states and 280 transitions. [2024-06-27 17:58:55,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 121 transitions, 584 flow [2024-06-27 17:58:55,098 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 121 transitions, 572 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-27 17:58:55,101 INFO L231 Difference]: Finished difference. Result has 74 places, 76 transitions, 280 flow [2024-06-27 17:58:55,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=74, PETRI_TRANSITIONS=76} [2024-06-27 17:58:55,104 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 2 predicate places. [2024-06-27 17:58:55,104 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 76 transitions, 280 flow [2024-06-27 17:58:55,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:55,104 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:55,104 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:55,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-27 17:58:55,105 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:55,105 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1678132204, now seen corresponding path program 1 times [2024-06-27 17:58:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:55,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861975255] [2024-06-27 17:58:55,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:55,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:55,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:55,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861975255] [2024-06-27 17:58:55,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861975255] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:55,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:55,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:58:55,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224973224] [2024-06-27 17:58:55,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:55,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:58:55,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:58:55,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:58:55,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 127 [2024-06-27 17:58:55,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 76 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:55,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:55,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 127 [2024-06-27 17:58:55,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:55,822 INFO L124 PetriNetUnfolderBase]: 6689/11514 cut-off events. [2024-06-27 17:58:55,823 INFO L125 PetriNetUnfolderBase]: For 8644/8644 co-relation queries the response was YES. [2024-06-27 17:58:55,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27428 conditions, 11514 events. 6689/11514 cut-off events. For 8644/8644 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 74435 event pairs, 2428 based on Foata normal form. 220/10391 useless extension candidates. Maximal degree in co-relation 9056. Up to 4254 conditions per place. [2024-06-27 17:58:55,869 INFO L140 encePairwiseOnDemand]: 117/127 looper letters, 93 selfloop transitions, 13 changer transitions 0/124 dead transitions. [2024-06-27 17:58:55,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 124 transitions, 627 flow [2024-06-27 17:58:55,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:58:55,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:58:55,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 272 transitions. [2024-06-27 17:58:55,871 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5354330708661418 [2024-06-27 17:58:55,871 INFO L175 Difference]: Start difference. First operand has 74 places, 76 transitions, 280 flow. Second operand 4 states and 272 transitions. [2024-06-27 17:58:55,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 124 transitions, 627 flow [2024-06-27 17:58:55,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 124 transitions, 616 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-27 17:58:55,879 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 345 flow [2024-06-27 17:58:55,879 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=345, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2024-06-27 17:58:55,879 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2024-06-27 17:58:55,879 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 345 flow [2024-06-27 17:58:55,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:55,880 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:55,880 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:55,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-27 17:58:55,880 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:55,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:55,881 INFO L85 PathProgramCache]: Analyzing trace with hash 231907661, now seen corresponding path program 1 times [2024-06-27 17:58:55,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:55,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383401267] [2024-06-27 17:58:55,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:55,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:55,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:56,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:56,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:56,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383401267] [2024-06-27 17:58:56,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383401267] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:56,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:56,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:58:56,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687239162] [2024-06-27 17:58:56,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:56,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:58:56,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:56,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:58:56,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:58:56,038 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 127 [2024-06-27 17:58:56,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:56,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:56,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 127 [2024-06-27 17:58:56,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:56,753 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L1770-->L1693-7: Formula: (let ((.cse0 (= 9 v_~pdev~0_24))) (and (= |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1| (ite .cse0 1 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1| |v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|))) InVars {} OutVars{thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, ~pdev~0=v_~pdev~0_24, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[~pdev~0, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][91], [thread_ath9kThread1of1ForFork0InUse, Black: 134#(and (= ~ldv_usb_state~0 1) (= ~pdev~0 1)), Black: 139#(and (= ~pdev~0 6) (= ~ldv_usb_state~0 0)), Black: 110#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0)), 17#L1698-3true, 124#(and (= ~pdev~0 9) (= ~ldv_usb_state~0 0)), Black: 114#(<= (+ |thread_usbThread1of1ForFork1_ieee80211_register_hw_#res#1| 1) 0), Black: 117#(and (<= (+ |thread_usbThread1of1ForFork1_~probe_ret~0#1| 1) 0) (<= (+ |thread_usbThread1of1ForFork1_ieee80211_register_hw_#res#1| 1) 0)), 138#(= ~ldv_usb_state~0 0), 7#L1693-7true, 22#ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 123#(= ~ldv_usb_state~0 0), 142#true, Black: 121#true]) [2024-06-27 17:58:56,754 INFO L294 olderBase$Statistics]: this new event has 53 ancestors and is cut-off event [2024-06-27 17:58:56,754 INFO L297 olderBase$Statistics]: existing Event has 47 ancestors and is cut-off event [2024-06-27 17:58:56,754 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2024-06-27 17:58:56,754 INFO L297 olderBase$Statistics]: existing Event has 52 ancestors and is cut-off event [2024-06-27 17:58:56,764 INFO L124 PetriNetUnfolderBase]: 6630/11189 cut-off events. [2024-06-27 17:58:56,764 INFO L125 PetriNetUnfolderBase]: For 12104/12362 co-relation queries the response was YES. [2024-06-27 17:58:56,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28450 conditions, 11189 events. 6630/11189 cut-off events. For 12104/12362 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 70054 event pairs, 4384 based on Foata normal form. 0/9919 useless extension candidates. Maximal degree in co-relation 14358. Up to 8413 conditions per place. [2024-06-27 17:58:56,799 INFO L140 encePairwiseOnDemand]: 124/127 looper letters, 67 selfloop transitions, 6 changer transitions 10/103 dead transitions. [2024-06-27 17:58:56,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 613 flow [2024-06-27 17:58:56,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:58:56,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:58:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2024-06-27 17:58:56,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5721784776902887 [2024-06-27 17:58:56,801 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 345 flow. Second operand 3 states and 218 transitions. [2024-06-27 17:58:56,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 613 flow [2024-06-27 17:58:56,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 103 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-27 17:58:56,817 INFO L231 Difference]: Finished difference. Result has 76 places, 71 transitions, 318 flow [2024-06-27 17:58:56,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=76, PETRI_TRANSITIONS=71} [2024-06-27 17:58:56,817 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2024-06-27 17:58:56,817 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 71 transitions, 318 flow [2024-06-27 17:58:56,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:56,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:56,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:56,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-27 17:58:56,818 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:56,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:56,819 INFO L85 PathProgramCache]: Analyzing trace with hash -865591979, now seen corresponding path program 1 times [2024-06-27 17:58:56,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:56,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908835379] [2024-06-27 17:58:56,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:56,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:56,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:56,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:56,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:56,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908835379] [2024-06-27 17:58:56,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908835379] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:56,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:56,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:58:56,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50541587] [2024-06-27 17:58:56,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:56,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:58:56,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:56,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:58:56,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:58:56,888 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 127 [2024-06-27 17:58:56,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 71 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:56,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:56,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 127 [2024-06-27 17:58:56,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:57,380 INFO L124 PetriNetUnfolderBase]: 5104/8720 cut-off events. [2024-06-27 17:58:57,380 INFO L125 PetriNetUnfolderBase]: For 11800/11800 co-relation queries the response was YES. [2024-06-27 17:58:57,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21143 conditions, 8720 events. 5104/8720 cut-off events. For 11800/11800 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 53086 event pairs, 1936 based on Foata normal form. 565/8295 useless extension candidates. Maximal degree in co-relation 14936. Up to 3528 conditions per place. [2024-06-27 17:58:57,413 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 90 selfloop transitions, 8 changer transitions 0/113 dead transitions. [2024-06-27 17:58:57,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 113 transitions, 632 flow [2024-06-27 17:58:57,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:58:57,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:58:57,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 276 transitions. [2024-06-27 17:58:57,415 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5433070866141733 [2024-06-27 17:58:57,415 INFO L175 Difference]: Start difference. First operand has 76 places, 71 transitions, 318 flow. Second operand 4 states and 276 transitions. [2024-06-27 17:58:57,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 113 transitions, 632 flow [2024-06-27 17:58:57,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 113 transitions, 593 flow, removed 1 selfloop flow, removed 5 redundant places. [2024-06-27 17:58:57,428 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 323 flow [2024-06-27 17:58:57,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=323, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2024-06-27 17:58:57,428 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2024-06-27 17:58:57,429 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 323 flow [2024-06-27 17:58:57,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:57,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:57,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:57,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-27 17:58:57,429 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:57,430 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:57,430 INFO L85 PathProgramCache]: Analyzing trace with hash -865625459, now seen corresponding path program 2 times [2024-06-27 17:58:57,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:57,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509298085] [2024-06-27 17:58:57,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:57,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:57,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:57,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-06-27 17:58:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:57,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509298085] [2024-06-27 17:58:57,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509298085] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:57,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:57,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:58:57,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635478037] [2024-06-27 17:58:57,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:57,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:58:57,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:57,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:58:57,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:58:57,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 127 [2024-06-27 17:58:57,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 323 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:57,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:57,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 127 [2024-06-27 17:58:57,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:58,175 INFO L124 PetriNetUnfolderBase]: 6599/11264 cut-off events. [2024-06-27 17:58:58,175 INFO L125 PetriNetUnfolderBase]: For 12239/12239 co-relation queries the response was YES. [2024-06-27 17:58:58,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26608 conditions, 11264 events. 6599/11264 cut-off events. For 12239/12239 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 69715 event pairs, 2469 based on Foata normal form. 61/10027 useless extension candidates. Maximal degree in co-relation 17128. Up to 4009 conditions per place. [2024-06-27 17:58:58,229 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 96 selfloop transitions, 11 changer transitions 0/122 dead transitions. [2024-06-27 17:58:58,230 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 122 transitions, 695 flow [2024-06-27 17:58:58,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:58:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:58:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 279 transitions. [2024-06-27 17:58:58,231 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5492125984251969 [2024-06-27 17:58:58,231 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 323 flow. Second operand 4 states and 279 transitions. [2024-06-27 17:58:58,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 122 transitions, 695 flow [2024-06-27 17:58:58,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 683 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-27 17:58:58,250 INFO L231 Difference]: Finished difference. Result has 77 places, 74 transitions, 405 flow [2024-06-27 17:58:58,251 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=405, PETRI_PLACES=77, PETRI_TRANSITIONS=74} [2024-06-27 17:58:58,251 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2024-06-27 17:58:58,251 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 74 transitions, 405 flow [2024-06-27 17:58:58,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:58,252 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:58,252 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2024-06-27 17:58:58,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-06-27 17:58:58,252 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:58,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:58,252 INFO L85 PathProgramCache]: Analyzing trace with hash -94901748, now seen corresponding path program 1 times [2024-06-27 17:58:58,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:58,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682530087] [2024-06-27 17:58:58,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:58,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:58:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:58,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682530087] [2024-06-27 17:58:58,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682530087] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:58,314 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:58,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-27 17:58:58,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410245736] [2024-06-27 17:58:58,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:58,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-27 17:58:58,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:58,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-27 17:58:58,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-27 17:58:58,323 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 127 [2024-06-27 17:58:58,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 74 transitions, 405 flow. Second operand has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:58,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:58,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 127 [2024-06-27 17:58:58,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:59,077 INFO L124 PetriNetUnfolderBase]: 6593/10924 cut-off events. [2024-06-27 17:58:59,078 INFO L125 PetriNetUnfolderBase]: For 16634/16634 co-relation queries the response was YES. [2024-06-27 17:58:59,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27801 conditions, 10924 events. 6593/10924 cut-off events. For 16634/16634 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 62190 event pairs, 4726 based on Foata normal form. 93/9783 useless extension candidates. Maximal degree in co-relation 17876. Up to 8925 conditions per place. [2024-06-27 17:58:59,099 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 64 selfloop transitions, 8 changer transitions 10/97 dead transitions. [2024-06-27 17:58:59,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 97 transitions, 622 flow [2024-06-27 17:58:59,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-27 17:58:59,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-27 17:58:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2024-06-27 17:58:59,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5406824146981627 [2024-06-27 17:58:59,101 INFO L175 Difference]: Start difference. First operand has 77 places, 74 transitions, 405 flow. Second operand 3 states and 206 transitions. [2024-06-27 17:58:59,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 97 transitions, 622 flow [2024-06-27 17:58:59,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 97 transitions, 622 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-27 17:58:59,118 INFO L231 Difference]: Finished difference. Result has 79 places, 69 transitions, 417 flow [2024-06-27 17:58:59,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=417, PETRI_PLACES=79, PETRI_TRANSITIONS=69} [2024-06-27 17:58:59,118 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2024-06-27 17:58:59,118 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 69 transitions, 417 flow [2024-06-27 17:58:59,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:59,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-27 17:58:59,119 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2024-06-27 17:58:59,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-06-27 17:58:59,119 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT === [thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 12 more)] === [2024-06-27 17:58:59,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-27 17:58:59,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1787420822, now seen corresponding path program 1 times [2024-06-27 17:58:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-27 17:58:59,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550070600] [2024-06-27 17:58:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-27 17:58:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-27 17:58:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-27 17:58:59,198 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-06-27 17:58:59,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-27 17:58:59,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550070600] [2024-06-27 17:58:59,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550070600] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-27 17:58:59,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-27 17:58:59,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-27 17:58:59,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317723514] [2024-06-27 17:58:59,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-27 17:58:59,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-27 17:58:59,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-27 17:58:59,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-27 17:58:59,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-27 17:58:59,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 127 [2024-06-27 17:58:59,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 69 transitions, 417 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:59,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-27 17:58:59,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 127 [2024-06-27 17:58:59,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-27 17:58:59,457 INFO L124 PetriNetUnfolderBase]: 2261/3961 cut-off events. [2024-06-27 17:58:59,457 INFO L125 PetriNetUnfolderBase]: For 6689/6689 co-relation queries the response was YES. [2024-06-27 17:58:59,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9804 conditions, 3961 events. 2261/3961 cut-off events. For 6689/6689 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 20908 event pairs, 1511 based on Foata normal form. 43/3692 useless extension candidates. Maximal degree in co-relation 7369. Up to 2700 conditions per place. [2024-06-27 17:58:59,466 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 0 selfloop transitions, 0 changer transitions 105/105 dead transitions. [2024-06-27 17:58:59,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 105 transitions, 682 flow [2024-06-27 17:58:59,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-27 17:58:59,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-27 17:58:59,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 260 transitions. [2024-06-27 17:58:59,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5118110236220472 [2024-06-27 17:58:59,467 INFO L175 Difference]: Start difference. First operand has 79 places, 69 transitions, 417 flow. Second operand 4 states and 260 transitions. [2024-06-27 17:58:59,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 105 transitions, 682 flow [2024-06-27 17:58:59,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 105 transitions, 635 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-27 17:58:59,476 INFO L231 Difference]: Finished difference. Result has 73 places, 0 transitions, 0 flow [2024-06-27 17:58:59,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=73, PETRI_TRANSITIONS=0} [2024-06-27 17:58:59,477 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 1 predicate places. [2024-06-27 17:58:59,477 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 0 transitions, 0 flow [2024-06-27 17:58:59,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-06-27 17:58:59,479 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 15 remaining) [2024-06-27 17:58:59,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (13 of 15 remaining) [2024-06-27 17:58:59,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (12 of 15 remaining) [2024-06-27 17:58:59,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONWITNESS_INVARIANT (11 of 15 remaining) [2024-06-27 17:58:59,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (10 of 15 remaining) [2024-06-27 17:58:59,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 15 remaining) [2024-06-27 17:58:59,480 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONERROR_FUNCTION (8 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (7 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_ath9kErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2ASSERT_VIOLATIONERROR_FUNCTION (3 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (2 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 15 remaining) [2024-06-27 17:58:59,481 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 15 remaining) [2024-06-27 17:58:59,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-06-27 17:58:59,482 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-27 17:58:59,486 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-27 17:58:59,486 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-27 17:58:59,489 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-27 17:58:59,489 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-27 17:58:59,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.06 05:58:59 BasicIcfg [2024-06-27 17:58:59,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-27 17:58:59,490 INFO L158 Benchmark]: Toolchain (without parser) took 10940.23ms. Allocated memory was 155.2MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 76.6MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 581.2MB. Max. memory is 16.1GB. [2024-06-27 17:58:59,491 INFO L158 Benchmark]: Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:58:59,491 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-27 17:58:59,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 838.17ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 76.5MB in the beginning and 118.5MB in the end (delta: -42.0MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-06-27 17:58:59,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.33ms. Allocated memory is still 203.4MB. Free memory was 118.5MB in the beginning and 115.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:58:59,491 INFO L158 Benchmark]: Boogie Preprocessor took 45.05ms. Allocated memory is still 203.4MB. Free memory was 115.3MB in the beginning and 111.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-27 17:58:59,492 INFO L158 Benchmark]: RCFGBuilder took 683.51ms. Allocated memory is still 203.4MB. Free memory was 111.1MB in the beginning and 67.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-06-27 17:58:59,492 INFO L158 Benchmark]: TraceAbstraction took 9303.44ms. Allocated memory was 203.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 66.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 521.1MB. Max. memory is 16.1GB. [2024-06-27 17:58:59,493 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Witness Parser took 0.15ms. Allocated memory is still 155.2MB. Free memory is still 107.1MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.13ms. Allocated memory is still 155.2MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 838.17ms. Allocated memory was 155.2MB in the beginning and 203.4MB in the end (delta: 48.2MB). Free memory was 76.5MB in the beginning and 118.5MB in the end (delta: -42.0MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.33ms. Allocated memory is still 203.4MB. Free memory was 118.5MB in the beginning and 115.3MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.05ms. Allocated memory is still 203.4MB. Free memory was 115.3MB in the beginning and 111.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 683.51ms. Allocated memory is still 203.4MB. Free memory was 111.1MB in the beginning and 67.1MB in the end (delta: 44.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9303.44ms. Allocated memory was 203.4MB in the beginning and 2.0GB in the end (delta: 1.8GB). Free memory was 66.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 521.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1693]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1781]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1693]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1693]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - PositiveResult [Line: 1719]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds at this location - PositiveResult [Line: 1693]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 114 locations, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.2s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 640 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 528 mSDsluCounter, 57 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1704 IncrementalHoareTripleChecker+Invalid, 1786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 35 mSDtfsCounter, 1704 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=417occurred in iteration=11, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 230 NumberOfCodeBlocks, 230 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 411 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-27 17:58:59,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE