./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/mutex-meet/race-4_1-thread_local_vars.yml/witness.yml --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 76401ed0 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/mutex-meet/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-76401ed-m [2024-06-20 18:07:38,744 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-06-20 18:07:38,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-06-20 18:07:38,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-06-20 18:07:38,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-06-20 18:07:38,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-06-20 18:07:38,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-06-20 18:07:38,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-06-20 18:07:38,814 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-06-20 18:07:38,814 INFO L153 SettingsManager]: * Use memory slicer=true [2024-06-20 18:07:38,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-06-20 18:07:38,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-06-20 18:07:38,815 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-06-20 18:07:38,816 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-06-20 18:07:38,816 INFO L153 SettingsManager]: * Use SBE=true [2024-06-20 18:07:38,816 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-06-20 18:07:38,817 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-06-20 18:07:38,817 INFO L153 SettingsManager]: * sizeof long=4 [2024-06-20 18:07:38,817 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-06-20 18:07:38,818 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-06-20 18:07:38,818 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-06-20 18:07:38,819 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-06-20 18:07:38,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-06-20 18:07:38,819 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-06-20 18:07:38,820 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-06-20 18:07:38,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-06-20 18:07:38,820 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-06-20 18:07:38,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-06-20 18:07:38,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-06-20 18:07:38,821 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-06-20 18:07:38,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-06-20 18:07:38,822 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-06-20 18:07:38,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:07:38,823 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-06-20 18:07:38,823 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-06-20 18:07:38,823 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-06-20 18:07:38,824 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-06-20 18:07:38,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-06-20 18:07:38,824 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-06-20 18:07:38,825 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-06-20 18:07:38,825 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-06-20 18:07:38,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-06-20 18:07:38,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-06-20 18:07:38,826 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-20 18:07:39,065 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-06-20 18:07:39,080 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-06-20 18:07:39,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-06-20 18:07:39,084 INFO L270 PluginConnector]: Initializing Witness Parser... [2024-06-20 18:07:39,085 INFO L274 PluginConnector]: Witness Parser initialized [2024-06-20 18:07:39,086 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/./goblint.2024-05-21_14-57-05.files/mutex-meet/race-4_1-thread_local_vars.yml/witness.yml [2024-06-20 18:07:39,168 INFO L270 PluginConnector]: Initializing CDTParser... [2024-06-20 18:07:39,169 INFO L274 PluginConnector]: CDTParser initialized [2024-06-20 18:07:39,170 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-20 18:07:40,270 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-06-20 18:07:40,565 INFO L384 CDTParser]: Found 1 translation units. [2024-06-20 18:07:40,569 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-4_1-thread_local_vars.i [2024-06-20 18:07:40,596 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1deda04c8/b0e16f7eae0d4487904da5522e67fba2/FLAG4ad1f2d24 [2024-06-20 18:07:40,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1deda04c8/b0e16f7eae0d4487904da5522e67fba2 [2024-06-20 18:07:40,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-06-20 18:07:40,611 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-06-20 18:07:40,612 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-06-20 18:07:40,612 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-06-20 18:07:40,617 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-06-20 18:07:40,617 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:07:39" (1/2) ... [2024-06-20 18:07:40,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618b90ed and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:07:40, skipping insertion in model container [2024-06-20 18:07:40,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:07:39" (1/2) ... [2024-06-20 18:07:40,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@7692270c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator CORRECTNESS_WITNESS 20.06 06:07:40, skipping insertion in model container [2024-06-20 18:07:40,621 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:07:40" (2/2) ... [2024-06-20 18:07:40,622 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@618b90ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:40, skipping insertion in model container [2024-06-20 18:07:40,622 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.06 06:07:40" (2/2) ... [2024-06-20 18:07:40,623 INFO L83 nessWitnessExtractor]: Extracting all invariants from correctness witness [2024-06-20 18:07:40,668 INFO L95 edCorrectnessWitness]: Found the following entries in the witness: [2024-06-20 18:07:40,669 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-20 18:07:40,669 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-20 18:07:40,670 INFO L103 edCorrectnessWitness]: ghost_variable multithreaded = 0 [2024-06-20 18:07:40,670 INFO L103 edCorrectnessWitness]: ghost_variable mutex_locked = 0 [2024-06-20 18:07:40,670 INFO L106 edCorrectnessWitness]: ghost_update [L1780-L1780] multithreaded = 1; [2024-06-20 18:07:40,670 INFO L106 edCorrectnessWitness]: ghost_update [L1701-L1701] mutex_locked = 0; [2024-06-20 18:07:40,670 INFO L106 edCorrectnessWitness]: ghost_update [L1698-L1698] mutex_locked = 1; [2024-06-20 18:07:40,729 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-06-20 18:07:41,360 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:07:41,370 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-20 18:07:41,568 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-06-20 18:07:41,655 INFO L206 MainTranslator]: Completed translation [2024-06-20 18:07:41,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41 WrapperNode [2024-06-20 18:07:41,657 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-06-20 18:07:41,658 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-06-20 18:07:41,658 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-06-20 18:07:41,658 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-06-20 18:07:41,663 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,690 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,729 INFO L138 Inliner]: procedures = 487, calls = 37, calls flagged for inlining = 16, calls inlined = 21, statements flattened = 223 [2024-06-20 18:07:41,730 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-06-20 18:07:41,731 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-06-20 18:07:41,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-06-20 18:07:41,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-06-20 18:07:41,739 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,757 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,787 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [1, 2, 5, 1]. 56 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [0, 2, 5, 0]. The 2 writes are split as follows [1, 0, 0, 1]. [2024-06-20 18:07:41,800 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,826 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,836 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-06-20 18:07:41,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-06-20 18:07:41,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-06-20 18:07:41,856 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-06-20 18:07:41,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (1/1) ... [2024-06-20 18:07:41,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-06-20 18:07:41,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-06-20 18:07:41,924 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-20 18:07:41,926 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-20 18:07:41,961 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-06-20 18:07:41,961 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-06-20 18:07:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-06-20 18:07:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-06-20 18:07:41,962 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-06-20 18:07:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-06-20 18:07:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-06-20 18:07:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-06-20 18:07:41,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-06-20 18:07:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-06-20 18:07:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-06-20 18:07:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-06-20 18:07:41,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-06-20 18:07:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-06-20 18:07:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-06-20 18:07:41,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-06-20 18:07:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-06-20 18:07:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-06-20 18:07:41,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-06-20 18:07:41,965 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-06-20 18:07:42,214 INFO L244 CfgBuilder]: Building ICFG [2024-06-20 18:07:42,216 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-06-20 18:07:42,438 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-06-20 18:07:42,438 INFO L293 CfgBuilder]: Performing block encoding [2024-06-20 18:07:42,669 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-06-20 18:07:42,684 INFO L320 CfgBuilder]: Removed 2 assume(true) statements. [2024-06-20 18:07:42,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:07:42 BoogieIcfgContainer [2024-06-20 18:07:42,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-06-20 18:07:42,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-06-20 18:07:42,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-06-20 18:07:42,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-06-20 18:07:42,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "witness.yml de.uni_freiburg.informatik.ultimate.witnessparser CORRECTNESS_WITNESS 20.06 06:07:39" (1/4) ... [2024-06-20 18:07:42,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dc1b8c and model type witness.yml de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CORRECTNESS_WITNESS 20.06 06:07:42, skipping insertion in model container [2024-06-20 18:07:42,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.06 06:07:40" (2/4) ... [2024-06-20 18:07:42,694 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dc1b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:07:42, skipping insertion in model container [2024-06-20 18:07:42,694 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.06 06:07:41" (3/4) ... [2024-06-20 18:07:42,695 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43dc1b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.06 06:07:42, skipping insertion in model container [2024-06-20 18:07:42,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.06 06:07:42" (4/4) ... [2024-06-20 18:07:42,696 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_1-thread_local_vars.i [2024-06-20 18:07:42,709 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-06-20 18:07:42,721 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-06-20 18:07:42,722 INFO L522 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-06-20 18:07:42,809 INFO L144 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-06-20 18:07:42,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 70 places, 87 transitions, 201 flow [2024-06-20 18:07:42,919 INFO L124 PetriNetUnfolderBase]: 20/85 cut-off events. [2024-06-20 18:07:42,919 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-06-20 18:07:42,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 85 events. 20/85 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 199 event pairs, 0 based on Foata normal form. 0/58 useless extension candidates. Maximal degree in co-relation 75. Up to 11 conditions per place. [2024-06-20 18:07:42,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 70 places, 87 transitions, 201 flow [2024-06-20 18:07:42,925 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 56 transitions, 128 flow [2024-06-20 18:07:42,948 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-06-20 18:07:42,966 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;@79573115, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-06-20 18:07:42,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2024-06-20 18:07:42,969 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-06-20 18:07:42,970 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2024-06-20 18:07:42,970 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-06-20 18:07:42,970 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:42,971 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-06-20 18:07:42,971 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:42,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:42,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2015763253, now seen corresponding path program 1 times [2024-06-20 18:07:42,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:42,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657415447] [2024-06-20 18:07:42,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:42,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:43,474 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-20 18:07:43,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:43,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657415447] [2024-06-20 18:07:43,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657415447] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:43,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:43,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-06-20 18:07:43,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013884355] [2024-06-20 18:07:43,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:43,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:07:43,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:43,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:07:43,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:07:43,523 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 87 [2024-06-20 18:07:43,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 56 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-20 18:07:43,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:43,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 87 [2024-06-20 18:07:43,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:44,079 INFO L124 PetriNetUnfolderBase]: 3216/5145 cut-off events. [2024-06-20 18:07:44,079 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2024-06-20 18:07:44,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9720 conditions, 5145 events. 3216/5145 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 29769 event pairs, 821 based on Foata normal form. 11/4275 useless extension candidates. Maximal degree in co-relation 9564. Up to 3891 conditions per place. [2024-06-20 18:07:44,110 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 62 selfloop transitions, 4 changer transitions 2/80 dead transitions. [2024-06-20 18:07:44,110 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 80 transitions, 315 flow [2024-06-20 18:07:44,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:07:44,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:07:44,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2024-06-20 18:07:44,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2024-06-20 18:07:44,123 INFO L175 Difference]: Start difference. First operand has 49 places, 56 transitions, 128 flow. Second operand 3 states and 140 transitions. [2024-06-20 18:07:44,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 80 transitions, 315 flow [2024-06-20 18:07:44,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-06-20 18:07:44,134 INFO L231 Difference]: Finished difference. Result has 50 places, 55 transitions, 149 flow [2024-06-20 18:07:44,136 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=149, PETRI_PLACES=50, PETRI_TRANSITIONS=55} [2024-06-20 18:07:44,139 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 1 predicate places. [2024-06-20 18:07:44,140 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 55 transitions, 149 flow [2024-06-20 18:07:44,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 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-20 18:07:44,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:44,140 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:07:44,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-06-20 18:07:44,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:44,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash -390428916, now seen corresponding path program 1 times [2024-06-20 18:07:44,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031455779] [2024-06-20 18:07:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:44,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:44,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:44,298 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-20 18:07:44,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:44,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031455779] [2024-06-20 18:07:44,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031455779] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:44,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:44,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-06-20 18:07:44,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866639212] [2024-06-20 18:07:44,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:44,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:07:44,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:07:44,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:07:44,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2024-06-20 18:07:44,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 55 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-20 18:07:44,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:44,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2024-06-20 18:07:44,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:44,748 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][62], [40#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 27#L1706-1true, thread_ath9kThread1of1ForFork0InUse, 77#true, 73#true, 67#thread_usbEXITtrue, Black: 75#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-20 18:07:44,748 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2024-06-20 18:07:44,749 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-20 18:07:44,749 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-20 18:07:44,749 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2024-06-20 18:07:44,750 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][62], [40#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, thread_ath9kThread1of1ForFork0InUse, 77#true, 73#true, 67#thread_usbEXITtrue, 50#L1709-1true, Black: 75#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-20 18:07:44,750 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-20 18:07:44,750 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-20 18:07:44,750 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-20 18:07:44,751 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-20 18:07:44,751 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][62], [40#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, thread_ath9kThread1of1ForFork0InUse, 77#true, 73#true, 67#thread_usbEXITtrue, 46#L1698true, Black: 75#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-20 18:07:44,751 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2024-06-20 18:07:44,751 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2024-06-20 18:07:44,751 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-20 18:07:44,751 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2024-06-20 18:07:44,752 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][62], [40#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 25#L1698-3true, thread_ath9kThread1of1ForFork0InUse, 73#true, 77#true, 67#thread_usbEXITtrue, Black: 75#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-20 18:07:44,752 INFO L294 olderBase$Statistics]: this new event has 47 ancestors and is cut-off event [2024-06-20 18:07:44,752 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2024-06-20 18:07:44,752 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2024-06-20 18:07:44,752 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-20 18:07:44,753 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][62], [40#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, thread_ath9kThread1of1ForFork0InUse, 77#true, 73#true, 67#thread_usbEXITtrue, 56#thread_ath9kEXITtrue, Black: 75#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-20 18:07:44,753 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-06-20 18:07:44,753 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2024-06-20 18:07:44,753 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2024-06-20 18:07:44,754 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-20 18:07:44,754 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][62], [40#ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANTtrue, 34#L1704-2true, thread_ath9kThread1of1ForFork0InUse, 77#true, 73#true, 67#thread_usbEXITtrue, Black: 75#(and (= ~pdev~0 1) (= ~ldv_usb_state~0 0))]) [2024-06-20 18:07:44,754 INFO L294 olderBase$Statistics]: this new event has 48 ancestors and is cut-off event [2024-06-20 18:07:44,754 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2024-06-20 18:07:44,754 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2024-06-20 18:07:44,754 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2024-06-20 18:07:44,754 INFO L124 PetriNetUnfolderBase]: 3252/5421 cut-off events. [2024-06-20 18:07:44,755 INFO L125 PetriNetUnfolderBase]: For 570/585 co-relation queries the response was YES. [2024-06-20 18:07:44,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11082 conditions, 5421 events. 3252/5421 cut-off events. For 570/585 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 32248 event pairs, 1962 based on Foata normal form. 94/4814 useless extension candidates. Maximal degree in co-relation 2054. Up to 3755 conditions per place. [2024-06-20 18:07:44,775 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 60 selfloop transitions, 2 changer transitions 10/88 dead transitions. [2024-06-20 18:07:44,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 88 transitions, 368 flow [2024-06-20 18:07:44,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:07:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:07:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2024-06-20 18:07:44,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5201149425287356 [2024-06-20 18:07:44,777 INFO L175 Difference]: Start difference. First operand has 50 places, 55 transitions, 149 flow. Second operand 4 states and 181 transitions. [2024-06-20 18:07:44,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 88 transitions, 368 flow [2024-06-20 18:07:44,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 88 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:07:44,780 INFO L231 Difference]: Finished difference. Result has 53 places, 56 transitions, 160 flow [2024-06-20 18:07:44,780 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=145, 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=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=53, PETRI_TRANSITIONS=56} [2024-06-20 18:07:44,780 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2024-06-20 18:07:44,781 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 56 transitions, 160 flow [2024-06-20 18:07:44,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 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-20 18:07:44,781 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:44,781 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:07:44,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-06-20 18:07:44,781 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:44,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:44,782 INFO L85 PathProgramCache]: Analyzing trace with hash -359831234, now seen corresponding path program 1 times [2024-06-20 18:07:44,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:44,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465378490] [2024-06-20 18:07:44,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:44,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:44,872 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-20 18:07:44,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:44,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465378490] [2024-06-20 18:07:44,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465378490] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:44,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:44,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:07:44,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166905160] [2024-06-20 18:07:44,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:44,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:07:44,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:44,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:07:44,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:07:44,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 87 [2024-06-20 18:07:44,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-20 18:07:44,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:44,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 87 [2024-06-20 18:07:44,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:45,390 INFO L124 PetriNetUnfolderBase]: 3844/6289 cut-off events. [2024-06-20 18:07:45,390 INFO L125 PetriNetUnfolderBase]: For 1333/1333 co-relation queries the response was YES. [2024-06-20 18:07:45,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13614 conditions, 6289 events. 3844/6289 cut-off events. For 1333/1333 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 37652 event pairs, 1894 based on Foata normal form. 46/5724 useless extension candidates. Maximal degree in co-relation 11237. Up to 3327 conditions per place. [2024-06-20 18:07:45,417 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 68 selfloop transitions, 9 changer transitions 5/93 dead transitions. [2024-06-20 18:07:45,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 93 transitions, 404 flow [2024-06-20 18:07:45,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:07:45,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:07:45,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 158 transitions. [2024-06-20 18:07:45,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4540229885057471 [2024-06-20 18:07:45,419 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 160 flow. Second operand 4 states and 158 transitions. [2024-06-20 18:07:45,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 93 transitions, 404 flow [2024-06-20 18:07:45,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 93 transitions, 403 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-06-20 18:07:45,425 INFO L231 Difference]: Finished difference. Result has 58 places, 59 transitions, 217 flow [2024-06-20 18:07:45,425 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=58, PETRI_TRANSITIONS=59} [2024-06-20 18:07:45,426 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2024-06-20 18:07:45,426 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 59 transitions, 217 flow [2024-06-20 18:07:45,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 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-20 18:07:45,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:45,427 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:07:45,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-06-20 18:07:45,427 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:45,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:45,427 INFO L85 PathProgramCache]: Analyzing trace with hash 853488900, now seen corresponding path program 1 times [2024-06-20 18:07:45,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:45,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828791642] [2024-06-20 18:07:45,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:45,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:45,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:45,536 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-20 18:07:45,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:45,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828791642] [2024-06-20 18:07:45,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828791642] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:45,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:45,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:07:45,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470014806] [2024-06-20 18:07:45,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:45,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:07:45,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:45,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:07:45,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:07:45,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 87 [2024-06-20 18:07:45,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 59 transitions, 217 flow. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-20 18:07:45,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:45,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 87 [2024-06-20 18:07:45,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:46,130 INFO L124 PetriNetUnfolderBase]: 4250/7082 cut-off events. [2024-06-20 18:07:46,130 INFO L125 PetriNetUnfolderBase]: For 4952/4952 co-relation queries the response was YES. [2024-06-20 18:07:46,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17010 conditions, 7082 events. 4250/7082 cut-off events. For 4952/4952 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 41152 event pairs, 987 based on Foata normal form. 190/6524 useless extension candidates. Maximal degree in co-relation 7275. Up to 4683 conditions per place. [2024-06-20 18:07:46,160 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 85 selfloop transitions, 6 changer transitions 3/106 dead transitions. [2024-06-20 18:07:46,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 106 transitions, 532 flow [2024-06-20 18:07:46,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:07:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:07:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 177 transitions. [2024-06-20 18:07:46,162 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5086206896551724 [2024-06-20 18:07:46,162 INFO L175 Difference]: Start difference. First operand has 58 places, 59 transitions, 217 flow. Second operand 4 states and 177 transitions. [2024-06-20 18:07:46,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 106 transitions, 532 flow [2024-06-20 18:07:46,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 106 transitions, 520 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-06-20 18:07:46,176 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 244 flow [2024-06-20 18:07:46,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=244, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2024-06-20 18:07:46,177 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 12 predicate places. [2024-06-20 18:07:46,177 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 244 flow [2024-06-20 18:07:46,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 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-20 18:07:46,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:46,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-06-20 18:07:46,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-06-20 18:07:46,178 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:46,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:46,178 INFO L85 PathProgramCache]: Analyzing trace with hash -407742758, now seen corresponding path program 1 times [2024-06-20 18:07:46,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:46,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296664254] [2024-06-20 18:07:46,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:46,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:46,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:46,264 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-20 18:07:46,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:46,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296664254] [2024-06-20 18:07:46,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296664254] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:46,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:46,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:07:46,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984713344] [2024-06-20 18:07:46,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:46,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:07:46,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:46,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:07:46,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:07:46,277 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 87 [2024-06-20 18:07:46,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-20 18:07:46,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:46,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 87 [2024-06-20 18:07:46,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:47,059 INFO L124 PetriNetUnfolderBase]: 5515/8971 cut-off events. [2024-06-20 18:07:47,060 INFO L125 PetriNetUnfolderBase]: For 7668/7668 co-relation queries the response was YES. [2024-06-20 18:07:47,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22537 conditions, 8971 events. 5515/8971 cut-off events. For 7668/7668 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 51332 event pairs, 1907 based on Foata normal form. 180/8125 useless extension candidates. Maximal degree in co-relation 8735. Up to 3354 conditions per place. [2024-06-20 18:07:47,113 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 80 selfloop transitions, 12 changer transitions 1/104 dead transitions. [2024-06-20 18:07:47,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 104 transitions, 554 flow [2024-06-20 18:07:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:07:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:07:47,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-06-20 18:07:47,115 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46839080459770116 [2024-06-20 18:07:47,115 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 244 flow. Second operand 4 states and 163 transitions. [2024-06-20 18:07:47,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 104 transitions, 554 flow [2024-06-20 18:07:47,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 104 transitions, 543 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-06-20 18:07:47,128 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 298 flow [2024-06-20 18:07:47,129 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2024-06-20 18:07:47,131 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-06-20 18:07:47,131 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 298 flow [2024-06-20 18:07:47,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 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-20 18:07:47,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:47,132 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] [2024-06-20 18:07:47,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-06-20 18:07:47,132 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:47,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2099829137, now seen corresponding path program 1 times [2024-06-20 18:07:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:47,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280883270] [2024-06-20 18:07:47,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:47,281 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-20 18:07:47,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:47,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280883270] [2024-06-20 18:07:47,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280883270] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:47,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:47,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:07:47,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741092274] [2024-06-20 18:07:47,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:47,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:07:47,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:47,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:07:47,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:07:47,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 87 [2024-06-20 18:07:47,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 298 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-20 18:07:47,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:47,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 87 [2024-06-20 18:07:47,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:48,198 INFO L124 PetriNetUnfolderBase]: 4503/7561 cut-off events. [2024-06-20 18:07:48,199 INFO L125 PetriNetUnfolderBase]: For 11337/11337 co-relation queries the response was YES. [2024-06-20 18:07:48,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18580 conditions, 7561 events. 4503/7561 cut-off events. For 11337/11337 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 43843 event pairs, 1560 based on Foata normal form. 511/7180 useless extension candidates. Maximal degree in co-relation 14051. Up to 2891 conditions per place. [2024-06-20 18:07:48,239 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 84 selfloop transitions, 8 changer transitions 0/103 dead transitions. [2024-06-20 18:07:48,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 103 transitions, 587 flow [2024-06-20 18:07:48,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:07:48,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:07:48,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2024-06-20 18:07:48,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-06-20 18:07:48,243 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 298 flow. Second operand 4 states and 174 transitions. [2024-06-20 18:07:48,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 103 transitions, 587 flow [2024-06-20 18:07:48,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 103 transitions, 561 flow, removed 1 selfloop flow, removed 4 redundant places. [2024-06-20 18:07:48,256 INFO L231 Difference]: Finished difference. Result has 64 places, 62 transitions, 307 flow [2024-06-20 18:07:48,256 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=64, PETRI_TRANSITIONS=62} [2024-06-20 18:07:48,259 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2024-06-20 18:07:48,259 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 62 transitions, 307 flow [2024-06-20 18:07:48,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-20 18:07:48,260 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:48,260 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] [2024-06-20 18:07:48,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-06-20 18:07:48,262 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:48,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:48,263 INFO L85 PathProgramCache]: Analyzing trace with hash -2099853317, now seen corresponding path program 2 times [2024-06-20 18:07:48,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:48,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9920614] [2024-06-20 18:07:48,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:48,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:48,363 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-20 18:07:48,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:48,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9920614] [2024-06-20 18:07:48,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9920614] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:48,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:48,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:07:48,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318778507] [2024-06-20 18:07:48,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:48,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:07:48,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:48,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:07:48,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:07:48,376 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 87 [2024-06-20 18:07:48,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 62 transitions, 307 flow. Second operand has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-20 18:07:48,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:48,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 87 [2024-06-20 18:07:48,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:49,145 INFO L124 PetriNetUnfolderBase]: 5934/9949 cut-off events. [2024-06-20 18:07:49,145 INFO L125 PetriNetUnfolderBase]: For 11724/11724 co-relation queries the response was YES. [2024-06-20 18:07:49,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24047 conditions, 9949 events. 5934/9949 cut-off events. For 11724/11724 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 59080 event pairs, 2298 based on Foata normal form. 55/8803 useless extension candidates. Maximal degree in co-relation 16183. Up to 3708 conditions per place. [2024-06-20 18:07:49,315 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 89 selfloop transitions, 11 changer transitions 0/111 dead transitions. [2024-06-20 18:07:49,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 111 transitions, 659 flow [2024-06-20 18:07:49,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:07:49,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:07:49,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 176 transitions. [2024-06-20 18:07:49,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5057471264367817 [2024-06-20 18:07:49,318 INFO L175 Difference]: Start difference. First operand has 64 places, 62 transitions, 307 flow. Second operand 4 states and 176 transitions. [2024-06-20 18:07:49,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 111 transitions, 659 flow [2024-06-20 18:07:49,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 111 transitions, 647 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-06-20 18:07:49,346 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 389 flow [2024-06-20 18:07:49,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2024-06-20 18:07:49,347 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2024-06-20 18:07:49,347 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 389 flow [2024-06-20 18:07:49,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.5) internal successors, (102), 4 states have internal predecessors, (102), 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-20 18:07:49,348 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:49,348 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] [2024-06-20 18:07:49,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-06-20 18:07:49,349 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:49,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:49,349 INFO L85 PathProgramCache]: Analyzing trace with hash -572346755, now seen corresponding path program 1 times [2024-06-20 18:07:49,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:49,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976625916] [2024-06-20 18:07:49,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:49,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:49,478 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-20 18:07:49,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:49,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976625916] [2024-06-20 18:07:49,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976625916] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:49,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:49,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-06-20 18:07:49,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260451700] [2024-06-20 18:07:49,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:49,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-06-20 18:07:49,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:49,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-06-20 18:07:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-06-20 18:07:49,495 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 87 [2024-06-20 18:07:49,496 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 389 flow. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-20 18:07:49,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:49,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 87 [2024-06-20 18:07:49,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:50,363 INFO L124 PetriNetUnfolderBase]: 5907/9728 cut-off events. [2024-06-20 18:07:50,364 INFO L125 PetriNetUnfolderBase]: For 15804/15804 co-relation queries the response was YES. [2024-06-20 18:07:50,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25185 conditions, 9728 events. 5907/9728 cut-off events. For 15804/15804 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 54287 event pairs, 4141 based on Foata normal form. 92/8683 useless extension candidates. Maximal degree in co-relation 16994. Up to 7892 conditions per place. [2024-06-20 18:07:50,409 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 60 selfloop transitions, 8 changer transitions 10/89 dead transitions. [2024-06-20 18:07:50,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 89 transitions, 598 flow [2024-06-20 18:07:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-06-20 18:07:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-06-20 18:07:50,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2024-06-20 18:07:50,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49808429118773945 [2024-06-20 18:07:50,411 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 389 flow. Second operand 3 states and 130 transitions. [2024-06-20 18:07:50,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 89 transitions, 598 flow [2024-06-20 18:07:50,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 89 transitions, 598 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-06-20 18:07:50,438 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 401 flow [2024-06-20 18:07:50,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2024-06-20 18:07:50,439 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 22 predicate places. [2024-06-20 18:07:50,439 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 401 flow [2024-06-20 18:07:50,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 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-20 18:07:50,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2024-06-20 18:07:50,440 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] [2024-06-20 18:07:50,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-06-20 18:07:50,440 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT === [ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (and 3 more)] === [2024-06-20 18:07:50,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-06-20 18:07:50,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1360493988, now seen corresponding path program 2 times [2024-06-20 18:07:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-06-20 18:07:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572481151] [2024-06-20 18:07:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-06-20 18:07:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-06-20 18:07:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-06-20 18:07:50,670 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-20 18:07:50,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-06-20 18:07:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572481151] [2024-06-20 18:07:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572481151] provided 1 perfect and 0 imperfect interpolant sequences [2024-06-20 18:07:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-06-20 18:07:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-06-20 18:07:50,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359749563] [2024-06-20 18:07:50,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-06-20 18:07:50,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-06-20 18:07:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-06-20 18:07:50,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-06-20 18:07:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-06-20 18:07:50,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 87 [2024-06-20 18:07:50,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 401 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-20 18:07:50,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-06-20 18:07:50,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 87 [2024-06-20 18:07:50,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-06-20 18:07:51,071 INFO L124 PetriNetUnfolderBase]: 2069/3577 cut-off events. [2024-06-20 18:07:51,071 INFO L125 PetriNetUnfolderBase]: For 6468/6468 co-relation queries the response was YES. [2024-06-20 18:07:51,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9026 conditions, 3577 events. 2069/3577 cut-off events. For 6468/6468 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 18274 event pairs, 1303 based on Foata normal form. 43/3325 useless extension candidates. Maximal degree in co-relation 6723. Up to 2341 conditions per place. [2024-06-20 18:07:51,082 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 0 selfloop transitions, 0 changer transitions 97/97 dead transitions. [2024-06-20 18:07:51,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 97 transitions, 658 flow [2024-06-20 18:07:51,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-06-20 18:07:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-06-20 18:07:51,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 160 transitions. [2024-06-20 18:07:51,083 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45977011494252873 [2024-06-20 18:07:51,083 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 401 flow. Second operand 4 states and 160 transitions. [2024-06-20 18:07:51,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 97 transitions, 658 flow [2024-06-20 18:07:51,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 97 transitions, 611 flow, removed 7 selfloop flow, removed 4 redundant places. [2024-06-20 18:07:51,094 INFO L231 Difference]: Finished difference. Result has 65 places, 0 transitions, 0 flow [2024-06-20 18:07:51,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=65, PETRI_TRANSITIONS=0} [2024-06-20 18:07:51,095 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2024-06-20 18:07:51,095 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 0 transitions, 0 flow [2024-06-20 18:07:51,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-20 18:07:51,097 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONWITNESS_INVARIANT (5 of 6 remaining) [2024-06-20 18:07:51,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 6 remaining) [2024-06-20 18:07:51,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (3 of 6 remaining) [2024-06-20 18:07:51,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2024-06-20 18:07:51,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbErr0ASSERT_VIOLATIONWITNESS_INVARIANT (1 of 6 remaining) [2024-06-20 18:07:51,098 INFO L805 garLoopResultBuilder]: Registering result SAFE for location thread_usbThread1of1ForFork1Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining) [2024-06-20 18:07:51,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-06-20 18:07:51,099 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2024-06-20 18:07:51,102 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-06-20 18:07:51,102 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2024-06-20 18:07:51,105 INFO L507 ceAbstractionStarter]: Automizer considered 2 witness invariants [2024-06-20 18:07:51,105 INFO L508 ceAbstractionStarter]: WitnessConsidered=2 [2024-06-20 18:07:51,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.06 06:07:51 BasicIcfg [2024-06-20 18:07:51,106 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-06-20 18:07:51,106 INFO L158 Benchmark]: Toolchain (without parser) took 10495.61ms. Allocated memory was 182.5MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 100.8MB in the beginning and 2.0GB in the end (delta: -1.9GB). Peak memory consumption was 551.4MB. Max. memory is 16.1GB. [2024-06-20 18:07:51,106 INFO L158 Benchmark]: Witness Parser took 0.16ms. Allocated memory is still 182.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 18:07:51,107 INFO L158 Benchmark]: CDTParser took 0.67ms. Allocated memory is still 182.5MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-06-20 18:07:51,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1045.05ms. Allocated memory is still 182.5MB. Free memory was 100.8MB in the beginning and 112.2MB in the end (delta: -11.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-06-20 18:07:51,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.54ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 108.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-06-20 18:07:51,107 INFO L158 Benchmark]: Boogie Preprocessor took 124.47ms. Allocated memory is still 182.5MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-06-20 18:07:51,108 INFO L158 Benchmark]: RCFGBuilder took 830.29ms. Allocated memory is still 182.5MB. Free memory was 104.7MB in the beginning and 134.8MB in the end (delta: -30.1MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-06-20 18:07:51,108 INFO L158 Benchmark]: TraceAbstraction took 8416.80ms. Allocated memory was 182.5MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 133.7MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 581.5MB. Max. memory is 16.1GB. [2024-06-20 18:07:51,109 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 182.5MB. Free memory is still 153.7MB. There was no memory consumed. Max. memory is 16.1GB. * CDTParser took 0.67ms. Allocated memory is still 182.5MB. Free memory is still 150.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1045.05ms. Allocated memory is still 182.5MB. Free memory was 100.8MB in the beginning and 112.2MB in the end (delta: -11.4MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.54ms. Allocated memory is still 182.5MB. Free memory was 112.2MB in the beginning and 108.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.47ms. Allocated memory is still 182.5MB. Free memory was 108.9MB in the beginning and 104.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 830.29ms. Allocated memory is still 182.5MB. Free memory was 104.7MB in the beginning and 134.8MB in the end (delta: -30.1MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8416.80ms. Allocated memory was 182.5MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 133.7MB in the beginning and 2.0GB in the end (delta: -1.8GB). Peak memory consumption was 581.5MB. 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, 78 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: 8.3s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 500 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 415 mSDsluCounter, 55 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1287 IncrementalHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 36 mSDtfsCounter, 1287 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=401occurred 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.1s InterpolantComputationTime, 173 NumberOfCodeBlocks, 173 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 164 ConstructedInterpolants, 0 QuantifiedInterpolants, 332 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-20 18:07:51,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE