./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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --validate ./goblint.2024-05-21_14-57-05.files/protection/race-4_1-thread_local_vars.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cde23df1 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-05-21_14-57-05.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 --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.fs.goblint-validation-cde23df-m [2024-06-14 11:40:26,902 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-14 11:40:26,948 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-14 11:40:26,951 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-14 11:40:26,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-14 11:40:26,967 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-14 11:40:26,967 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-14 11:40:26,967 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-14 11:40:26,967 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-14 11:40:26,968 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-14 11:40:26,968 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-14 11:40:26,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-14 11:40:26,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-14 11:40:26,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-14 11:40:26,969 INFO L153 SettingsManager]: * Use SBE=true [2024-06-14 11:40:26,969 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-14 11:40:26,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-14 11:40:26,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-14 11:40:26,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-14 11:40:26,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-14 11:40:26,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-14 11:40:26,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-14 11:40:26,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-14 11:40:26,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-14 11:40:26,971 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-14 11:40:26,972 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-14 11:40:26,972 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-14 11:40:26,972 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-14 11:40:26,972 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-14 11:40:26,973 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-14 11:40:26,973 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-14 11:40:26,973 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-14 11:40:26,973 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:40:26,973 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-14 11:40:26,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-14 11:40:26,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-14 11:40:26,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-14 11:40:26,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-14 11:40:26,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-14 11:40:26,975 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-14 11:40:26,975 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-14 11:40:26,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-14 11:40:26,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-14 11:40:26,975 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false [2024-06-14 11:40:27,194 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-14 11:40:27,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-14 11:40:27,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-14 11:40:27,215 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-14 11:40:27,215 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-14 11:40:27,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/protection/race-4_1-thread_local_vars.yml/witness.yml [2024-06-14 11:40:27,282 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-14 11:40:27,283 INFO L274 PluginConnector]: CDTParser initialized [2024-06-14 11:40:27,283 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-14 11:40:28,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-14 11:40:28,381 INFO L384 CDTParser]: Found 1 translation units. [2024-06-14 11:40:28,381 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i [2024-06-14 11:40:28,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a698c95/c77bebd7173c47299db157312decff91/FLAG21b4e9ab6 [2024-06-14 11:40:28,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33a698c95/c77bebd7173c47299db157312decff91 [2024-06-14 11:40:28,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-14 11:40:28,407 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-14 11:40:28,408 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-14 11:40:28,408 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-14 11:40:28,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-14 11:40:28,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:40:27" (1/2) ... [2024-06-14 11:40:28,414 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23120468 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:40:28, skipping insertion in model container [2024-06-14 11:40:28,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:40:27" (1/2) ... [2024-06-14 11:40:28,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@133aa985 and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 14.06 11:40:28, skipping insertion in model container [2024-06-14 11:40:28,415 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:40:28" (2/2) ... [2024-06-14 11:40:28,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23120468 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:28, skipping insertion in model container [2024-06-14 11:40:28,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.06 11:40:28" (2/2) ... [2024-06-14 11:40:28,416 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-14 11:40:28,448 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-14 11:40:28,449 INFO L97 edCorrectnessWitness]: Location invariant before [L1781-L1781] (! multithreaded || ((0 <= ldv_usb_state && ldv_usb_state <= 1) && (ldv_usb_state == 0 || ldv_usb_state == 1))) && (! multithreaded || (((((0 <= pdev && 1 <= pdev) && pdev <= 9) && pdev <= 127) && pdev != 0) && ((((pdev == 1 || pdev == 5) || pdev == 6) || pdev == 8) || pdev == 9))) [2024-06-14 11:40:28,450 INFO L97 edCorrectnessWitness]: Location invariant before [L1719-L1719] (! multithreaded || ((0 <= ldv_usb_state && ldv_usb_state <= 1) && (ldv_usb_state == 0 || ldv_usb_state == 1))) && (! multithreaded || (((((0 <= pdev && 1 <= pdev) && pdev <= 9) && pdev <= 127) && pdev != 0) && ((((pdev == 1 || pdev == 5) || pdev == 6) || pdev == 8) || pdev == 9))) [2024-06-14 11:40:28,450 INFO L103 edCorrectnessWitness]: ghost_variable mutex_locked = 0 [2024-06-14 11:40:28,450 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-14 11:40:28,450 INFO L106 edCorrectnessWitness]: ghost_update [L1780-L1780] multithreaded = 1; [2024-06-14 11:40:28,450 INFO L106 edCorrectnessWitness]: ghost_update [L1701-L1701] mutex_locked = 0; [2024-06-14 11:40:28,450 INFO L106 edCorrectnessWitness]: ghost_update [L1698-L1698] mutex_locked = 1; [2024-06-14 11:40:28,497 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-14 11:40:28,950 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:40:28,959 INFO L202 MainTranslator]: Completed pre-run Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local Start Parsing Local [2024-06-14 11:40:29,044 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-14 11:40:29,138 INFO L206 MainTranslator]: Completed translation [2024-06-14 11:40:29,139 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29 WrapperNode [2024-06-14 11:40:29,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-14 11:40:29,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-14 11:40:29,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-14 11:40:29,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-14 11:40:29,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,179 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,217 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 223 [2024-06-14 11:40:29,218 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-14 11:40:29,219 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-14 11:40:29,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-14 11:40:29,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-14 11:40:29,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,264 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [2, 1, 5, 1]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 0, 5, 0]. The 2 writes are split as follows [0, 1, 0, 1]. [2024-06-14 11:40:29,268 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,269 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,284 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-14 11:40:29,298 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-14 11:40:29,299 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-14 11:40:29,299 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-14 11:40:29,299 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (1/1) ... [2024-06-14 11:40:29,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-14 11:40:29,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-14 11:40:29,344 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-14 11:40:29,349 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-14 11:40:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-06-14 11:40:29,392 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-06-14 11:40:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-14 11:40:29,392 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-06-14 11:40:29,393 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-06-14 11:40:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-14 11:40:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-14 11:40:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-14 11:40:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-14 11:40:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-14 11:40:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-06-14 11:40:29,393 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-14 11:40:29,394 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-14 11:40:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-14 11:40:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-14 11:40:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-14 11:40:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-14 11:40:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-14 11:40:29,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-14 11:40:29,395 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-14 11:40:29,615 INFO L244 CfgBuilder]: Building ICFG [2024-06-14 11:40:29,617 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-14 11:40:29,840 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-14 11:40:29,841 INFO L293 CfgBuilder]: Performing block encoding [2024-06-14 11:40:29,996 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-14 11:40:29,999 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-14 11:40:30,001 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:40:29 BoogieIcfgContainer [2024-06-14 11:40:30,001 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-14 11:40:30,005 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-14 11:40:30,005 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-14 11:40:30,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-14 11:40:30,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 14.06 11:40:27" (1/4) ... [2024-06-14 11:40:30,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc8460a and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 14.06 11:40:30, skipping insertion in model container [2024-06-14 11:40:30,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.06 11:40:28" (2/4) ... [2024-06-14 11:40:30,010 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc8460a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:40:30, skipping insertion in model container [2024-06-14 11:40:30,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.06 11:40:29" (3/4) ... [2024-06-14 11:40:30,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc8460a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.06 11:40:30, skipping insertion in model container [2024-06-14 11:40:30,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.06 11:40:29" (4/4) ... [2024-06-14 11:40:30,012 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2024-06-14 11:40:30,025 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-14 11:40:30,026 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-14 11:40:30,026 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-14 11:40:30,072 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-06-14 11:40:30,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 71 places, 88 transitions, 203 flow [2024-06-14 11:40:30,139 INFO L124 PetriNetUnfolderBase]: 20/86 cut-off events. [2024-06-14 11:40:30,139 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-14 11:40:30,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 86 events. 20/86 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 191 event pairs, 0 based on Foata normal form. 0/59 useless extension candidates. Maximal degree in co-relation 75. Up to 11 conditions per place. [2024-06-14 11:40:30,142 INFO L82 GeneralOperation]: Start removeDead. Operand has 71 places, 88 transitions, 203 flow [2024-06-14 11:40:30,145 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 57 transitions, 130 flow [2024-06-14 11:40:30,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-14 11:40:30,164 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;@4d4116e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-14 11:40:30,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-14 11:40:30,168 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-14 11:40:30,168 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2024-06-14 11:40:30,168 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-14 11:40:30,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:30,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:40:30,169 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:30,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1909489374, now seen corresponding path program 1 times [2024-06-14 11:40:30,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:30,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847752646] [2024-06-14 11:40:30,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:30,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:30,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:30,539 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-14 11:40:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:30,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847752646] [2024-06-14 11:40:30,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847752646] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:30,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:30,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-14 11:40:30,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137545236] [2024-06-14 11:40:30,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:30,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:40:30,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:30,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:40:30,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:40:30,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 88 [2024-06-14 11:40:30,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 57 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-14 11:40:30,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:30,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 88 [2024-06-14 11:40:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:31,094 INFO L124 PetriNetUnfolderBase]: 3216/5152 cut-off events. [2024-06-14 11:40:31,094 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-06-14 11:40:31,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9726 conditions, 5152 events. 3216/5152 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29785 event pairs, 821 based on Foata normal form. 11/4283 useless extension candidates. Maximal degree in co-relation 9567. Up to 3889 conditions per place. [2024-06-14 11:40:31,119 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 64 selfloop transitions, 4 changer transitions 2/81 dead transitions. [2024-06-14 11:40:31,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 81 transitions, 321 flow [2024-06-14 11:40:31,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:40:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:40:31,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 139 transitions. [2024-06-14 11:40:31,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5265151515151515 [2024-06-14 11:40:31,130 INFO L175 Difference]: Start difference. First operand has 50 places, 57 transitions, 130 flow. Second operand 3 states and 139 transitions. [2024-06-14 11:40:31,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 81 transitions, 321 flow [2024-06-14 11:40:31,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 81 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-14 11:40:31,170 INFO L231 Difference]: Finished difference. Result has 51 places, 56 transitions, 151 flow [2024-06-14 11:40:31,171 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=51, PETRI_TRANSITIONS=56} [2024-06-14 11:40:31,174 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2024-06-14 11:40:31,174 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 56 transitions, 151 flow [2024-06-14 11:40:31,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 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-14 11:40:31,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:31,174 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:40:31,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-14 11:40:31,175 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:31,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash 2073261357, now seen corresponding path program 1 times [2024-06-14 11:40:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435203292] [2024-06-14 11:40:31,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:31,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:31,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:31,256 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-14 11:40:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:31,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435203292] [2024-06-14 11:40:31,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435203292] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:31,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:31,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-14 11:40:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105670786] [2024-06-14 11:40:31,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:31,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:40:31,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:31,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:40:31,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:40:31,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 88 [2024-06-14 11:40:31,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 56 transitions, 151 flow. Second operand has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-14 11:40:31,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:31,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 88 [2024-06-14 11:40:31,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:31,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1770-->thread_usbEXIT: Formula: (let ((.cse0 (= 9 v_~pdev~0_88))) (and (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|) (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|) (= 0 |v_thread_usbThread1of1ForFork1_#res#1.base_1|) (not (= (ite .cse0 1 0) 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_#res#1.offset_1| 0))) InVars {thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|} OutVars{thread_usbThread1of1ForFork1_#res#1.offset=|v_thread_usbThread1of1ForFork1_#res#1.offset_1|, thread_usbThread1of1ForFork1_#res#1.base=|v_thread_usbThread1of1ForFork1_#res#1.base_1|, ~pdev~0=v_~pdev~0_88, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2|, thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread_usbThread1of1ForFork1_#res#1.offset, thread_usbThread1of1ForFork1_#res#1.base, ~pdev~0, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][63], [74#true, 78#true, thread_ath9kThread1of1ForFork0InUse, 28#L1706-1true, 41#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 76#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0)), 68#thread_usbEXITtrue]) [2024-06-14 11:40:31,665 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-14 11:40:31,665 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-14 11:40:31,665 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-14 11:40:31,665 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-14 11:40:31,666 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1770-->thread_usbEXIT: Formula: (let ((.cse0 (= 9 v_~pdev~0_88))) (and (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|) (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|) (= 0 |v_thread_usbThread1of1ForFork1_#res#1.base_1|) (not (= (ite .cse0 1 0) 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_#res#1.offset_1| 0))) InVars {thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|} OutVars{thread_usbThread1of1ForFork1_#res#1.offset=|v_thread_usbThread1of1ForFork1_#res#1.offset_1|, thread_usbThread1of1ForFork1_#res#1.base=|v_thread_usbThread1of1ForFork1_#res#1.base_1|, ~pdev~0=v_~pdev~0_88, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2|, thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread_usbThread1of1ForFork1_#res#1.offset, thread_usbThread1of1ForFork1_#res#1.base, ~pdev~0, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][63], [51#L1709-1true, 74#true, 78#true, thread_ath9kThread1of1ForFork0InUse, 41#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, Black: 76#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0)), 68#thread_usbEXITtrue]) [2024-06-14 11:40:31,666 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-14 11:40:31,667 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-14 11:40:31,667 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-14 11:40:31,667 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-14 11:40:31,667 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1770-->thread_usbEXIT: Formula: (let ((.cse0 (= 9 v_~pdev~0_88))) (and (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|) (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|) (= 0 |v_thread_usbThread1of1ForFork1_#res#1.base_1|) (not (= (ite .cse0 1 0) 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_#res#1.offset_1| 0))) InVars {thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|} OutVars{thread_usbThread1of1ForFork1_#res#1.offset=|v_thread_usbThread1of1ForFork1_#res#1.offset_1|, thread_usbThread1of1ForFork1_#res#1.base=|v_thread_usbThread1of1ForFork1_#res#1.base_1|, ~pdev~0=v_~pdev~0_88, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2|, thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread_usbThread1of1ForFork1_#res#1.offset, thread_usbThread1of1ForFork1_#res#1.base, ~pdev~0, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][63], [74#true, 78#true, thread_ath9kThread1of1ForFork0InUse, 41#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 47#L1698true, 68#thread_usbEXITtrue, Black: 76#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-14 11:40:31,667 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-14 11:40:31,667 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-14 11:40:31,668 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-14 11:40:31,668 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-14 11:40:31,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1770-->thread_usbEXIT: Formula: (let ((.cse0 (= 9 v_~pdev~0_88))) (and (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|) (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|) (= 0 |v_thread_usbThread1of1ForFork1_#res#1.base_1|) (not (= (ite .cse0 1 0) 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_#res#1.offset_1| 0))) InVars {thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|} OutVars{thread_usbThread1of1ForFork1_#res#1.offset=|v_thread_usbThread1of1ForFork1_#res#1.offset_1|, thread_usbThread1of1ForFork1_#res#1.base=|v_thread_usbThread1of1ForFork1_#res#1.base_1|, ~pdev~0=v_~pdev~0_88, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2|, thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread_usbThread1of1ForFork1_#res#1.offset, thread_usbThread1of1ForFork1_#res#1.base, ~pdev~0, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][63], [25#L1698-3true, 74#true, 78#true, 41#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, thread_ath9kThread1of1ForFork0InUse, 68#thread_usbEXITtrue, Black: 76#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-14 11:40:31,668 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-06-14 11:40:31,669 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-14 11:40:31,669 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-14 11:40:31,669 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-14 11:40:31,669 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1770-->thread_usbEXIT: Formula: (let ((.cse0 (= 9 v_~pdev~0_88))) (and (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|) (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|) (= 0 |v_thread_usbThread1of1ForFork1_#res#1.base_1|) (not (= (ite .cse0 1 0) 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_#res#1.offset_1| 0))) InVars {thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|} OutVars{thread_usbThread1of1ForFork1_#res#1.offset=|v_thread_usbThread1of1ForFork1_#res#1.offset_1|, thread_usbThread1of1ForFork1_#res#1.base=|v_thread_usbThread1of1ForFork1_#res#1.base_1|, ~pdev~0=v_~pdev~0_88, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2|, thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread_usbThread1of1ForFork1_#res#1.offset, thread_usbThread1of1ForFork1_#res#1.base, ~pdev~0, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][63], [74#true, 78#true, thread_ath9kThread1of1ForFork0InUse, 41#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 56#thread_ath9kEXITtrue, 68#thread_usbEXITtrue, Black: 76#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-14 11:40:31,669 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-14 11:40:31,670 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-14 11:40:31,670 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2024-06-14 11:40:31,670 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2024-06-14 11:40:31,670 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([646] L1770-->thread_usbEXIT: Formula: (let ((.cse0 (= 9 v_~pdev~0_88))) (and (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|) (= |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2| |v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|) (= 0 |v_thread_usbThread1of1ForFork1_#res#1.base_1|) (not (= (ite .cse0 1 0) 0)) .cse0 (= |v_thread_usbThread1of1ForFork1_#res#1.offset_1| 0))) InVars {thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_1|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_1|} OutVars{thread_usbThread1of1ForFork1_#res#1.offset=|v_thread_usbThread1of1ForFork1_#res#1.offset_1|, thread_usbThread1of1ForFork1_#res#1.base=|v_thread_usbThread1of1ForFork1_#res#1.base_1|, ~pdev~0=v_~pdev~0_88, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset_2|, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base=|v_thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base_2|, thread_usbThread1of1ForFork1_ldv_assert_~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_~expression#1_1|, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1=|v_thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1_1|} AuxVars[] AssignedVars[thread_usbThread1of1ForFork1_#res#1.offset, thread_usbThread1of1ForFork1_#res#1.base, ~pdev~0, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.offset, thread_usbThread1of1ForFork1_reach_error_#t~nondet30#1.base, thread_usbThread1of1ForFork1_ldv_assert_~expression#1, thread_usbThread1of1ForFork1_ldv_assert_#in~expression#1][63], [74#true, 78#true, thread_ath9kThread1of1ForFork0InUse, 35#L1704-2true, 41#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 68#thread_usbEXITtrue, Black: 76#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-14 11:40:31,670 INFO L294 olderBase$Statistics]: this new event has 49 ancestors and is cut-off event [2024-06-14 11:40:31,670 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-14 11:40:31,671 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-14 11:40:31,671 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-14 11:40:31,671 INFO L124 PetriNetUnfolderBase]: 3252/5430 cut-off events. [2024-06-14 11:40:31,671 INFO L125 PetriNetUnfolderBase]: For 569/584 co-relation queries the response was YES. [2024-06-14 11:40:31,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11092 conditions, 5430 events. 3252/5430 cut-off events. For 569/584 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 32207 event pairs, 1962 based on Foata normal form. 94/4824 useless extension candidates. Maximal degree in co-relation 2054. Up to 3756 conditions per place. [2024-06-14 11:40:31,691 INFO L140 encePairwiseOnDemand]: 85/88 looper letters, 62 selfloop transitions, 2 changer transitions 10/89 dead transitions. [2024-06-14 11:40:31,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 89 transitions, 374 flow [2024-06-14 11:40:31,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:40:31,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:40:31,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2024-06-14 11:40:31,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085227272727273 [2024-06-14 11:40:31,693 INFO L175 Difference]: Start difference. First operand has 51 places, 56 transitions, 151 flow. Second operand 4 states and 179 transitions. [2024-06-14 11:40:31,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 89 transitions, 374 flow [2024-06-14 11:40:31,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 89 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:40:31,696 INFO L231 Difference]: Finished difference. Result has 54 places, 57 transitions, 162 flow [2024-06-14 11:40:31,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=54, PETRI_TRANSITIONS=57} [2024-06-14 11:40:31,696 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2024-06-14 11:40:31,697 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 57 transitions, 162 flow [2024-06-14 11:40:31,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.0) internal successors, (120), 4 states have internal predecessors, (120), 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-14 11:40:31,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:31,697 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:40:31,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-14 11:40:31,697 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:31,698 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:31,698 INFO L85 PathProgramCache]: Analyzing trace with hash 2103859039, now seen corresponding path program 1 times [2024-06-14 11:40:31,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:31,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422729476] [2024-06-14 11:40:31,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:31,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:31,855 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-14 11:40:31,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:31,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422729476] [2024-06-14 11:40:31,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422729476] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:31,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:31,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:40:31,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422529956] [2024-06-14 11:40:31,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:31,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:40:31,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:31,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:40:31,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:40:31,871 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 88 [2024-06-14 11:40:31,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 57 transitions, 162 flow. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-14 11:40:31,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:31,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 88 [2024-06-14 11:40:31,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:32,322 INFO L124 PetriNetUnfolderBase]: 3844/6296 cut-off events. [2024-06-14 11:40:32,323 INFO L125 PetriNetUnfolderBase]: For 1325/1325 co-relation queries the response was YES. [2024-06-14 11:40:32,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13622 conditions, 6296 events. 3844/6296 cut-off events. For 1325/1325 co-relation queries the response was YES. Maximal size of possible extension queue 286. Compared 37663 event pairs, 1894 based on Foata normal form. 46/5731 useless extension candidates. Maximal degree in co-relation 11245. Up to 3328 conditions per place. [2024-06-14 11:40:32,351 INFO L140 encePairwiseOnDemand]: 77/88 looper letters, 70 selfloop transitions, 9 changer transitions 5/94 dead transitions. [2024-06-14 11:40:32,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 410 flow [2024-06-14 11:40:32,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:40:32,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:40:32,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 156 transitions. [2024-06-14 11:40:32,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4431818181818182 [2024-06-14 11:40:32,355 INFO L175 Difference]: Start difference. First operand has 54 places, 57 transitions, 162 flow. Second operand 4 states and 156 transitions. [2024-06-14 11:40:32,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 410 flow [2024-06-14 11:40:32,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-14 11:40:32,364 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 219 flow [2024-06-14 11:40:32,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2024-06-14 11:40:32,365 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 9 predicate places. [2024-06-14 11:40:32,365 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 219 flow [2024-06-14 11:40:32,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 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-14 11:40:32,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:32,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-14 11:40:32,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-14 11:40:32,366 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:32,366 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:32,367 INFO L85 PathProgramCache]: Analyzing trace with hash -45649921, now seen corresponding path program 1 times [2024-06-14 11:40:32,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:32,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294656645] [2024-06-14 11:40:32,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:32,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:32,562 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-14 11:40:32,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:32,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294656645] [2024-06-14 11:40:32,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294656645] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:32,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:32,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:40:32,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900492756] [2024-06-14 11:40:32,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:32,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:40:32,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:32,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:40:32,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:40:32,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 88 [2024-06-14 11:40:32,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 219 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-14 11:40:32,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:32,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 88 [2024-06-14 11:40:32,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:33,069 INFO L124 PetriNetUnfolderBase]: 4252/7089 cut-off events. [2024-06-14 11:40:33,069 INFO L125 PetriNetUnfolderBase]: For 4941/4941 co-relation queries the response was YES. [2024-06-14 11:40:33,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17019 conditions, 7089 events. 4252/7089 cut-off events. For 4941/4941 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 41181 event pairs, 987 based on Foata normal form. 190/6529 useless extension candidates. Maximal degree in co-relation 7284. Up to 4683 conditions per place. [2024-06-14 11:40:33,109 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 87 selfloop transitions, 6 changer transitions 3/107 dead transitions. [2024-06-14 11:40:33,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 107 transitions, 538 flow [2024-06-14 11:40:33,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:40:33,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:40:33,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 175 transitions. [2024-06-14 11:40:33,112 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4971590909090909 [2024-06-14 11:40:33,112 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 219 flow. Second operand 4 states and 175 transitions. [2024-06-14 11:40:33,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 107 transitions, 538 flow [2024-06-14 11:40:33,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 107 transitions, 526 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-14 11:40:33,129 INFO L231 Difference]: Finished difference. Result has 62 places, 62 transitions, 246 flow [2024-06-14 11:40:33,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=246, PETRI_PLACES=62, PETRI_TRANSITIONS=62} [2024-06-14 11:40:33,131 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2024-06-14 11:40:33,131 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 62 transitions, 246 flow [2024-06-14 11:40:33,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 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-14 11:40:33,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:33,133 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-14 11:40:33,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-14 11:40:33,134 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:33,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:33,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1783724923, now seen corresponding path program 1 times [2024-06-14 11:40:33,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:33,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987171404] [2024-06-14 11:40:33,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:33,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:33,239 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-14 11:40:33,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:33,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987171404] [2024-06-14 11:40:33,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987171404] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:33,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:33,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:40:33,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914418145] [2024-06-14 11:40:33,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:33,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:40:33,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:33,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:40:33,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:40:33,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 88 [2024-06-14 11:40:33,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 62 transitions, 246 flow. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-14 11:40:33,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:33,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 88 [2024-06-14 11:40:33,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:33,936 INFO L124 PetriNetUnfolderBase]: 5515/8978 cut-off events. [2024-06-14 11:40:33,937 INFO L125 PetriNetUnfolderBase]: For 7657/7657 co-relation queries the response was YES. [2024-06-14 11:40:33,955 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22546 conditions, 8978 events. 5515/8978 cut-off events. For 7657/7657 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 51273 event pairs, 1907 based on Foata normal form. 180/8132 useless extension candidates. Maximal degree in co-relation 8744. Up to 3355 conditions per place. [2024-06-14 11:40:33,982 INFO L140 encePairwiseOnDemand]: 79/88 looper letters, 82 selfloop transitions, 12 changer transitions 1/105 dead transitions. [2024-06-14 11:40:33,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 105 transitions, 560 flow [2024-06-14 11:40:33,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:40:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:40:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 161 transitions. [2024-06-14 11:40:33,983 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45738636363636365 [2024-06-14 11:40:33,983 INFO L175 Difference]: Start difference. First operand has 62 places, 62 transitions, 246 flow. Second operand 4 states and 161 transitions. [2024-06-14 11:40:33,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 105 transitions, 560 flow [2024-06-14 11:40:33,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 105 transitions, 549 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-14 11:40:33,993 INFO L231 Difference]: Finished difference. Result has 65 places, 64 transitions, 300 flow [2024-06-14 11:40:33,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=300, PETRI_PLACES=65, PETRI_TRANSITIONS=64} [2024-06-14 11:40:33,995 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-06-14 11:40:33,995 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 64 transitions, 300 flow [2024-06-14 11:40:33,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-14 11:40:33,996 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:33,996 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] [2024-06-14 11:40:33,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-14 11:40:33,996 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:33,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:33,997 INFO L85 PathProgramCache]: Analyzing trace with hash -1573043824, now seen corresponding path program 1 times [2024-06-14 11:40:33,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:33,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796933597] [2024-06-14 11:40:33,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:33,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:34,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:34,078 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-14 11:40:34,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:34,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796933597] [2024-06-14 11:40:34,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796933597] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:34,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:34,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:40:34,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352121966] [2024-06-14 11:40:34,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:34,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:40:34,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:34,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:40:34,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:40:34,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 88 [2024-06-14 11:40:34,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 64 transitions, 300 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-14 11:40:34,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:34,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 88 [2024-06-14 11:40:34,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:34,540 INFO L124 PetriNetUnfolderBase]: 4505/7568 cut-off events. [2024-06-14 11:40:34,541 INFO L125 PetriNetUnfolderBase]: For 11332/11332 co-relation queries the response was YES. [2024-06-14 11:40:34,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18589 conditions, 7568 events. 4505/7568 cut-off events. For 11332/11332 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 43827 event pairs, 1560 based on Foata normal form. 511/7185 useless extension candidates. Maximal degree in co-relation 14060. Up to 2893 conditions per place. [2024-06-14 11:40:34,586 INFO L140 encePairwiseOnDemand]: 81/88 looper letters, 86 selfloop transitions, 8 changer transitions 0/104 dead transitions. [2024-06-14 11:40:34,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 104 transitions, 593 flow [2024-06-14 11:40:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:40:34,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:40:34,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2024-06-14 11:40:34,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2024-06-14 11:40:34,588 INFO L175 Difference]: Start difference. First operand has 65 places, 64 transitions, 300 flow. Second operand 4 states and 172 transitions. [2024-06-14 11:40:34,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 104 transitions, 593 flow [2024-06-14 11:40:34,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 104 transitions, 567 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-14 11:40:34,600 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 309 flow [2024-06-14 11:40:34,600 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-06-14 11:40:34,601 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2024-06-14 11:40:34,601 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 309 flow [2024-06-14 11:40:34,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-14 11:40:34,601 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:34,601 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] [2024-06-14 11:40:34,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-14 11:40:34,601 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:34,602 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:34,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1573068004, now seen corresponding path program 2 times [2024-06-14 11:40:34,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:34,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809149638] [2024-06-14 11:40:34,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:34,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:34,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:34,679 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-14 11:40:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:34,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809149638] [2024-06-14 11:40:34,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809149638] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:34,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:34,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:40:34,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990985270] [2024-06-14 11:40:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:34,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:40:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:40:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:40:34,695 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 88 [2024-06-14 11:40:34,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 309 flow. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-14 11:40:34,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:34,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 88 [2024-06-14 11:40:34,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:35,267 INFO L124 PetriNetUnfolderBase]: 5936/9956 cut-off events. [2024-06-14 11:40:35,267 INFO L125 PetriNetUnfolderBase]: For 11720/11720 co-relation queries the response was YES. [2024-06-14 11:40:35,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24056 conditions, 9956 events. 5936/9956 cut-off events. For 11720/11720 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 59016 event pairs, 2298 based on Foata normal form. 55/8808 useless extension candidates. Maximal degree in co-relation 16192. Up to 3710 conditions per place. [2024-06-14 11:40:35,315 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 91 selfloop transitions, 11 changer transitions 0/112 dead transitions. [2024-06-14 11:40:35,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 112 transitions, 665 flow [2024-06-14 11:40:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:40:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:40:35,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-06-14 11:40:35,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4943181818181818 [2024-06-14 11:40:35,317 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 309 flow. Second operand 4 states and 174 transitions. [2024-06-14 11:40:35,317 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 112 transitions, 665 flow [2024-06-14 11:40:35,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 112 transitions, 653 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-14 11:40:35,333 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 391 flow [2024-06-14 11:40:35,333 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-06-14 11:40:35,334 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 20 predicate places. [2024-06-14 11:40:35,334 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 391 flow [2024-06-14 11:40:35,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 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-14 11:40:35,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:35,334 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] [2024-06-14 11:40:35,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-14 11:40:35,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:35,335 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:35,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1287562823, now seen corresponding path program 1 times [2024-06-14 11:40:35,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:35,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467872633] [2024-06-14 11:40:35,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:35,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:35,428 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-14 11:40:35,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:35,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467872633] [2024-06-14 11:40:35,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467872633] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:35,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:35,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-14 11:40:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593977272] [2024-06-14 11:40:35,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:35,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-14 11:40:35,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-14 11:40:35,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-14 11:40:35,438 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 88 [2024-06-14 11:40:35,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-14 11:40:35,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:35,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 88 [2024-06-14 11:40:35,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:35,982 INFO L124 PetriNetUnfolderBase]: 5907/9737 cut-off events. [2024-06-14 11:40:35,983 INFO L125 PetriNetUnfolderBase]: For 15803/15803 co-relation queries the response was YES. [2024-06-14 11:40:36,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25200 conditions, 9737 events. 5907/9737 cut-off events. For 15803/15803 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 54329 event pairs, 4141 based on Foata normal form. 92/8691 useless extension candidates. Maximal degree in co-relation 17009. Up to 7893 conditions per place. [2024-06-14 11:40:36,018 INFO L140 encePairwiseOnDemand]: 82/88 looper letters, 62 selfloop transitions, 8 changer transitions 10/90 dead transitions. [2024-06-14 11:40:36,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 90 transitions, 604 flow [2024-06-14 11:40:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-14 11:40:36,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-14 11:40:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2024-06-14 11:40:36,020 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48863636363636365 [2024-06-14 11:40:36,020 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 391 flow. Second operand 3 states and 129 transitions. [2024-06-14 11:40:36,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 90 transitions, 604 flow [2024-06-14 11:40:36,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 90 transitions, 604 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-14 11:40:36,047 INFO L231 Difference]: Finished difference. Result has 72 places, 62 transitions, 403 flow [2024-06-14 11:40:36,047 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=72, PETRI_TRANSITIONS=62} [2024-06-14 11:40:36,048 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2024-06-14 11:40:36,048 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 62 transitions, 403 flow [2024-06-14 11:40:36,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 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-14 11:40:36,048 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-14 11:40:36,048 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] [2024-06-14 11:40:36,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-14 11:40:36,049 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-14 11:40:36,049 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-14 11:40:36,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1539289952, now seen corresponding path program 2 times [2024-06-14 11:40:36,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-14 11:40:36,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674139323] [2024-06-14 11:40:36,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-14 11:40:36,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-14 11:40:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-14 11:40:36,190 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-14 11:40:36,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-14 11:40:36,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674139323] [2024-06-14 11:40:36,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674139323] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-14 11:40:36,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-14 11:40:36,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-14 11:40:36,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840393478] [2024-06-14 11:40:36,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-14 11:40:36,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-14 11:40:36,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-14 11:40:36,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-14 11:40:36,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-14 11:40:36,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 88 [2024-06-14 11:40:36,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 62 transitions, 403 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-14 11:40:36,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-14 11:40:36,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 88 [2024-06-14 11:40:36,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-14 11:40:36,495 INFO L124 PetriNetUnfolderBase]: 2069/3579 cut-off events. [2024-06-14 11:40:36,495 INFO L125 PetriNetUnfolderBase]: For 6467/6467 co-relation queries the response was YES. [2024-06-14 11:40:36,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9030 conditions, 3579 events. 2069/3579 cut-off events. For 6467/6467 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 18241 event pairs, 1303 based on Foata normal form. 43/3328 useless extension candidates. Maximal degree in co-relation 6727. Up to 2343 conditions per place. [2024-06-14 11:40:36,505 INFO L140 encePairwiseOnDemand]: 83/88 looper letters, 0 selfloop transitions, 0 changer transitions 98/98 dead transitions. [2024-06-14 11:40:36,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 98 transitions, 664 flow [2024-06-14 11:40:36,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-14 11:40:36,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-14 11:40:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2024-06-14 11:40:36,507 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44886363636363635 [2024-06-14 11:40:36,507 INFO L175 Difference]: Start difference. First operand has 72 places, 62 transitions, 403 flow. Second operand 4 states and 158 transitions. [2024-06-14 11:40:36,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 98 transitions, 664 flow [2024-06-14 11:40:36,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 98 transitions, 617 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-14 11:40:36,517 INFO L231 Difference]: Finished difference. Result has 66 places, 0 transitions, 0 flow [2024-06-14 11:40:36,518 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=88, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=66, PETRI_TRANSITIONS=0} [2024-06-14 11:40:36,518 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2024-06-14 11:40:36,518 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 0 transitions, 0 flow [2024-06-14 11:40:36,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-14 11:40:36,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-14 11:40:36,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-06-14 11:40:36,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-14 11:40:36,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-14 11:40:36,521 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 6 remaining) [2024-06-14 11:40:36,522 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-14 11:40:36,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-14 11:40:36,522 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-06-14 11:40:36,526 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-14 11:40:36,526 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-14 11:40:36,529 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-14 11:40:36,529 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-14 11:40:36,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.06 11:40:36 BasicIcfg [2024-06-14 11:40:36,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-14 11:40:36,530 INFO L158 Benchmark]: Toolchain (without parser) took 8122.94ms. Allocated memory was 138.4MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 110.7MB in the beginning and 1.0GB in the end (delta: -925.3MB). Peak memory consumption was 580.9MB. Max. memory is 16.1GB. [2024-06-14 11:40:36,530 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 138.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:40:36,531 INFO L158 Benchmark]: CDTParser took 0.07ms. Allocated memory is still 138.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-14 11:40:36,531 INFO L158 Benchmark]: CACSL2BoogieTranslator took 731.13ms. Allocated memory is still 138.4MB. Free memory was 110.2MB in the beginning and 105.4MB in the end (delta: 4.9MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. [2024-06-14 11:40:36,531 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.61ms. Allocated memory is still 138.4MB. Free memory was 105.4MB in the beginning and 101.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-14 11:40:36,531 INFO L158 Benchmark]: Boogie Preprocessor took 75.75ms. Allocated memory is still 138.4MB. Free memory was 101.4MB in the beginning and 97.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-14 11:40:36,532 INFO L158 Benchmark]: RCFGBuilder took 702.31ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 97.2MB in the beginning and 148.7MB in the end (delta: -51.5MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2024-06-14 11:40:36,532 INFO L158 Benchmark]: TraceAbstraction took 6525.01ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 147.7MB in the beginning and 1.0GB in the end (delta: -888.3MB). Peak memory consumption was 564.9MB. Max. memory is 16.1GB. [2024-06-14 11:40:36,533 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.16ms. Allocated memory is still 138.4MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.07ms. Allocated memory is still 138.4MB. Free memory is still 108.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 731.13ms. Allocated memory is still 138.4MB. Free memory was 110.2MB in the beginning and 105.4MB in the end (delta: 4.9MB). Peak memory consumption was 74.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.61ms. Allocated memory is still 138.4MB. Free memory was 105.4MB in the beginning and 101.4MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.75ms. Allocated memory is still 138.4MB. Free memory was 101.4MB in the beginning and 97.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 702.31ms. Allocated memory was 138.4MB in the beginning and 192.9MB in the end (delta: 54.5MB). Free memory was 97.2MB in the beginning and 148.7MB in the end (delta: -51.5MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6525.01ms. Allocated memory was 192.9MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 147.7MB in the beginning and 1.0GB in the end (delta: -888.3MB). Peak memory consumption was 564.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1781]: invariant of correctness witness holds For all program executions holds that invariant of correctness witness holds 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 79 locations, 6 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: 6.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 560 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 448 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23 mSDsCounter, 72 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1252 IncrementalHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 72 mSolverCounterUnsat, 38 mSDtfsCounter, 1252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=403occurred in iteration=8, InterpolantAutomatonStates: 34, 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, 1.0s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 345 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-06-14 11:40:36,555 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