./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:24:04,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:24:04,922 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:24:04,926 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:24:04,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:24:04,965 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:24:04,966 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:24:04,966 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:24:04,967 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:24:04,968 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:24:04,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:24:04,969 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:24:04,969 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:24:04,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:24:04,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:24:04,970 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:24:04,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:24:04,971 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:24:04,974 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:24:04,974 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:24:04,974 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:24:04,975 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:24:04,978 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:24:04,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:24:04,979 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:24:04,979 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:24:04,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:24:04,980 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:24:04,980 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:24:04,980 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:24:04,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:24:04,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:24:04,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:24:04,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:24:04,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:24:04,982 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:24:04,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:24:04,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:24:04,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:24:04,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:24:04,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:24:04,984 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.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0f799b8cb369af433cd7b4f4a2ae1c7efd2306d185f06da0302d2727c00c6bf0 [2024-11-10 14:24:05,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:24:05,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:24:05,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:24:05,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:24:05,277 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:24:05,278 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2024-11-10 14:24:06,689 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:24:07,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:24:07,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-races/race-4_2-thread_local_vars.i [2024-11-10 14:24:07,064 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46bacf09a/5dc26749497945df8736fcce967eb1ca/FLAG97105a1ac [2024-11-10 14:24:07,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46bacf09a/5dc26749497945df8736fcce967eb1ca [2024-11-10 14:24:07,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:24:07,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:24:07,089 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:24:07,090 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:24:07,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:24:07,096 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:07" (1/1) ... [2024-11-10 14:24:07,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74811f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:07, skipping insertion in model container [2024-11-10 14:24:07,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:07" (1/1) ... [2024-11-10 14:24:07,154 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:24:07,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:24:07,809 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:24:07,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:24:08,016 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:24:08,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08 WrapperNode [2024-11-10 14:24:08,017 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:24:08,018 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:24:08,018 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:24:08,018 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:24:08,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,089 INFO L138 Inliner]: procedures = 487, calls = 38, calls flagged for inlining = 17, calls inlined = 23, statements flattened = 294 [2024-11-10 14:24:08,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:24:08,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:24:08,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:24:08,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:24:08,101 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,101 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,118 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,119 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,123 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,125 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:24:08,132 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:24:08,132 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:24:08,132 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:24:08,133 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (1/1) ... [2024-11-10 14:24:08,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:24:08,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:24:08,188 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-11-10 14:24:08,194 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-11-10 14:24:08,239 INFO L130 BoogieDeclarations]: Found specification of procedure thread_usb [2024-11-10 14:24:08,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_usb [2024-11-10 14:24:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 14:24:08,240 INFO L130 BoogieDeclarations]: Found specification of procedure thread_ath9k [2024-11-10 14:24:08,240 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_ath9k [2024-11-10 14:24:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:24:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:24:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-10 14:24:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:24:08,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:24:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-10 14:24:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:24:08,241 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:24:08,244 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:24:08,551 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:24:08,553 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:24:08,937 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724: havoc ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset; [2024-11-10 14:24:08,938 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L1724-1: SUMMARY for call ULTIMATE.dealloc(ieee80211_deregister_hw_~#status~0#1.base, ieee80211_deregister_hw_~#status~0#1.offset); srcloc: null [2024-11-10 14:24:08,939 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:24:08,940 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:24:08,973 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:24:08,974 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:24:08,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:24:08 BoogieIcfgContainer [2024-11-10 14:24:08,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:24:08,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:24:08,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:24:08,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:24:08,989 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:24:07" (1/3) ... [2024-11-10 14:24:08,989 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793e99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:24:08, skipping insertion in model container [2024-11-10 14:24:08,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:08" (2/3) ... [2024-11-10 14:24:08,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@793e99d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:24:08, skipping insertion in model container [2024-11-10 14:24:08,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:24:08" (3/3) ... [2024-11-10 14:24:08,991 INFO L112 eAbstractionObserver]: Analyzing ICFG race-4_2-thread_local_vars.i [2024-11-10 14:24:09,013 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:24:09,015 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2024-11-10 14:24:09,015 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:24:09,137 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-11-10 14:24:09,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 475 places, 517 transitions, 1061 flow [2024-11-10 14:24:09,348 INFO L124 PetriNetUnfolderBase]: 45/523 cut-off events. [2024-11-10 14:24:09,348 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:24:09,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 523 events. 45/523 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1474 event pairs, 0 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 370. Up to 11 conditions per place. [2024-11-10 14:24:09,359 INFO L82 GeneralOperation]: Start removeDead. Operand has 475 places, 517 transitions, 1061 flow [2024-11-10 14:24:09,368 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 325 places, 350 transitions, 716 flow [2024-11-10 14:24:09,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:24:09,392 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@402ad56c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:24:09,393 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2024-11-10 14:24:09,398 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:24:09,398 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2024-11-10 14:24:09,399 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:24:09,399 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:09,400 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:09,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:09,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:09,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1892141941, now seen corresponding path program 1 times [2024-11-10 14:24:09,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:09,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36520334] [2024-11-10 14:24:09,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:09,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:09,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:09,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:09,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36520334] [2024-11-10 14:24:09,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36520334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:09,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:09,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:09,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988466486] [2024-11-10 14:24:09,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:09,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:09,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:09,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:09,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:10,036 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-10 14:24:10,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 350 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 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-11-10 14:24:10,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:10,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-10 14:24:10,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:10,293 INFO L124 PetriNetUnfolderBase]: 122/1248 cut-off events. [2024-11-10 14:24:10,293 INFO L125 PetriNetUnfolderBase]: For 33/40 co-relation queries the response was YES. [2024-11-10 14:24:10,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1458 conditions, 1248 events. 122/1248 cut-off events. For 33/40 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 7356 event pairs, 76 based on Foata normal form. 148/1216 useless extension candidates. Maximal degree in co-relation 1128. Up to 185 conditions per place. [2024-11-10 14:24:10,310 INFO L140 encePairwiseOnDemand]: 496/517 looper letters, 24 selfloop transitions, 2 changer transitions 6/317 dead transitions. [2024-11-10 14:24:10,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 317 transitions, 702 flow [2024-11-10 14:24:10,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:10,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:10,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2024-11-10 14:24:10,334 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8897485493230174 [2024-11-10 14:24:10,338 INFO L175 Difference]: Start difference. First operand has 325 places, 350 transitions, 716 flow. Second operand 3 states and 1380 transitions. [2024-11-10 14:24:10,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 317 transitions, 702 flow [2024-11-10 14:24:10,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 317 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:10,355 INFO L231 Difference]: Finished difference. Result has 310 places, 311 transitions, 638 flow [2024-11-10 14:24:10,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=646, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=310, PETRI_TRANSITIONS=311} [2024-11-10 14:24:10,364 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -15 predicate places. [2024-11-10 14:24:10,365 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 311 transitions, 638 flow [2024-11-10 14:24:10,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 446.3333333333333) internal successors, (1339), 3 states have internal predecessors, (1339), 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-11-10 14:24:10,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:10,366 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:10,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:24:10,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:10,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:10,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1649347754, now seen corresponding path program 1 times [2024-11-10 14:24:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:10,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815485009] [2024-11-10 14:24:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:10,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:10,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815485009] [2024-11-10 14:24:10,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815485009] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:10,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:10,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:10,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871155802] [2024-11-10 14:24:10,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:10,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:10,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:10,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 517 [2024-11-10 14:24:10,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 311 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-11-10 14:24:10,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:10,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 517 [2024-11-10 14:24:10,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:10,855 INFO L124 PetriNetUnfolderBase]: 161/1730 cut-off events. [2024-11-10 14:24:10,855 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2024-11-10 14:24:10,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1970 conditions, 1730 events. 161/1730 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11849 event pairs, 29 based on Foata normal form. 0/1489 useless extension candidates. Maximal degree in co-relation 1936. Up to 156 conditions per place. [2024-11-10 14:24:10,875 INFO L140 encePairwiseOnDemand]: 493/517 looper letters, 30 selfloop transitions, 17 changer transitions 0/323 dead transitions. [2024-11-10 14:24:10,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 323 transitions, 757 flow [2024-11-10 14:24:10,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:10,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1347 transitions. [2024-11-10 14:24:10,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8684719535783365 [2024-11-10 14:24:10,879 INFO L175 Difference]: Start difference. First operand has 310 places, 311 transitions, 638 flow. Second operand 3 states and 1347 transitions. [2024-11-10 14:24:10,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 323 transitions, 757 flow [2024-11-10 14:24:10,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 323 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:10,889 INFO L231 Difference]: Finished difference. Result has 303 places, 320 transitions, 752 flow [2024-11-10 14:24:10,890 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=303, PETRI_TRANSITIONS=320} [2024-11-10 14:24:10,891 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -22 predicate places. [2024-11-10 14:24:10,892 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 320 transitions, 752 flow [2024-11-10 14:24:10,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-11-10 14:24:10,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:10,893 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:10,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:24:10,893 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:10,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:10,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1042894116, now seen corresponding path program 1 times [2024-11-10 14:24:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971037143] [2024-11-10 14:24:10,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:11,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:11,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:11,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971037143] [2024-11-10 14:24:11,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971037143] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:11,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:11,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:11,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021978225] [2024-11-10 14:24:11,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:11,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:11,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:11,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:11,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:11,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-10 14:24:11,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 320 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-11-10 14:24:11,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:11,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-10 14:24:11,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:11,470 INFO L124 PetriNetUnfolderBase]: 274/2626 cut-off events. [2024-11-10 14:24:11,470 INFO L125 PetriNetUnfolderBase]: For 480/539 co-relation queries the response was YES. [2024-11-10 14:24:11,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 2626 events. 274/2626 cut-off events. For 480/539 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 21072 event pairs, 99 based on Foata normal form. 0/2262 useless extension candidates. Maximal degree in co-relation 2894. Up to 333 conditions per place. [2024-11-10 14:24:11,491 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 32 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2024-11-10 14:24:11,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 319 transitions, 818 flow [2024-11-10 14:24:11,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:11,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1362 transitions. [2024-11-10 14:24:11,496 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8781431334622823 [2024-11-10 14:24:11,496 INFO L175 Difference]: Start difference. First operand has 303 places, 320 transitions, 752 flow. Second operand 3 states and 1362 transitions. [2024-11-10 14:24:11,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 319 transitions, 818 flow [2024-11-10 14:24:11,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 319 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:11,504 INFO L231 Difference]: Finished difference. Result has 302 places, 319 transitions, 720 flow [2024-11-10 14:24:11,505 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=302, PETRI_TRANSITIONS=319} [2024-11-10 14:24:11,506 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -23 predicate places. [2024-11-10 14:24:11,507 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 319 transitions, 720 flow [2024-11-10 14:24:11,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 447.0) internal successors, (1341), 3 states have internal predecessors, (1341), 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-11-10 14:24:11,508 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:11,508 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:11,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:24:11,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:11,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:11,510 INFO L85 PathProgramCache]: Analyzing trace with hash 633183847, now seen corresponding path program 1 times [2024-11-10 14:24:11,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:11,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574741582] [2024-11-10 14:24:11,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:11,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:11,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574741582] [2024-11-10 14:24:11,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574741582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629504595] [2024-11-10 14:24:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:11,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:11,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:11,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:11,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:11,609 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 463 out of 517 [2024-11-10 14:24:11,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 319 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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-11-10 14:24:11,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:11,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 463 of 517 [2024-11-10 14:24:11,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:12,032 INFO L124 PetriNetUnfolderBase]: 264/2805 cut-off events. [2024-11-10 14:24:12,033 INFO L125 PetriNetUnfolderBase]: For 51/81 co-relation queries the response was YES. [2024-11-10 14:24:12,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3245 conditions, 2805 events. 264/2805 cut-off events. For 51/81 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22700 event pairs, 60 based on Foata normal form. 1/2378 useless extension candidates. Maximal degree in co-relation 3206. Up to 144 conditions per place. [2024-11-10 14:24:12,056 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 17 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-11-10 14:24:12,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 323 transitions, 775 flow [2024-11-10 14:24:12,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:12,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:12,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1409 transitions. [2024-11-10 14:24:12,061 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9084461637653127 [2024-11-10 14:24:12,062 INFO L175 Difference]: Start difference. First operand has 302 places, 319 transitions, 720 flow. Second operand 3 states and 1409 transitions. [2024-11-10 14:24:12,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 323 transitions, 775 flow [2024-11-10 14:24:12,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 323 transitions, 771 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:12,070 INFO L231 Difference]: Finished difference. Result has 301 places, 318 transitions, 718 flow [2024-11-10 14:24:12,071 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=714, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=718, PETRI_PLACES=301, PETRI_TRANSITIONS=318} [2024-11-10 14:24:12,073 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -24 predicate places. [2024-11-10 14:24:12,073 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 318 transitions, 718 flow [2024-11-10 14:24:12,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 464.3333333333333) internal successors, (1393), 3 states have internal predecessors, (1393), 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-11-10 14:24:12,074 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:12,074 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:12,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:24:12,075 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread_usbErr13ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:12,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:12,075 INFO L85 PathProgramCache]: Analyzing trace with hash -721217990, now seen corresponding path program 1 times [2024-11-10 14:24:12,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:12,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300620693] [2024-11-10 14:24:12,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:12,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:12,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:12,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:12,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:12,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300620693] [2024-11-10 14:24:12,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300620693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:12,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:12,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:12,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317871777] [2024-11-10 14:24:12,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:12,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:12,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:12,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:12,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:12,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 517 [2024-11-10 14:24:12,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 318 transitions, 718 flow. Second operand has 3 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 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-11-10 14:24:12,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:12,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 517 [2024-11-10 14:24:12,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:12,413 INFO L124 PetriNetUnfolderBase]: 123/1457 cut-off events. [2024-11-10 14:24:12,414 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:24:12,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1704 conditions, 1457 events. 123/1457 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9362 event pairs, 29 based on Foata normal form. 0/1267 useless extension candidates. Maximal degree in co-relation 1612. Up to 93 conditions per place. [2024-11-10 14:24:12,424 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 14 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2024-11-10 14:24:12,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 317 transitions, 748 flow [2024-11-10 14:24:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:12,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:12,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1385 transitions. [2024-11-10 14:24:12,428 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8929722759509994 [2024-11-10 14:24:12,428 INFO L175 Difference]: Start difference. First operand has 301 places, 318 transitions, 718 flow. Second operand 3 states and 1385 transitions. [2024-11-10 14:24:12,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 317 transitions, 748 flow [2024-11-10 14:24:12,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 317 transitions, 744 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:12,434 INFO L231 Difference]: Finished difference. Result has 300 places, 317 transitions, 716 flow [2024-11-10 14:24:12,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=716, PETRI_PLACES=300, PETRI_TRANSITIONS=317} [2024-11-10 14:24:12,436 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -25 predicate places. [2024-11-10 14:24:12,438 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 317 transitions, 716 flow [2024-11-10 14:24:12,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 457.3333333333333) internal successors, (1372), 3 states have internal predecessors, (1372), 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-11-10 14:24:12,439 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:12,439 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:12,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:24:12,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:12,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:12,441 INFO L85 PathProgramCache]: Analyzing trace with hash 955370546, now seen corresponding path program 1 times [2024-11-10 14:24:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:12,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295588737] [2024-11-10 14:24:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:12,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:12,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:12,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:12,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295588737] [2024-11-10 14:24:12,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295588737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:12,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:12,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:12,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849764838] [2024-11-10 14:24:12,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:12,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:12,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:12,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:12,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:12,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 467 out of 517 [2024-11-10 14:24:12,560 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 317 transitions, 716 flow. Second operand has 3 states, 3 states have (on average 468.3333333333333) internal successors, (1405), 3 states have internal predecessors, (1405), 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-11-10 14:24:12,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:12,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 467 of 517 [2024-11-10 14:24:12,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:12,854 INFO L124 PetriNetUnfolderBase]: 241/2532 cut-off events. [2024-11-10 14:24:12,855 INFO L125 PetriNetUnfolderBase]: For 38/58 co-relation queries the response was YES. [2024-11-10 14:24:12,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2920 conditions, 2532 events. 241/2532 cut-off events. For 38/58 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 19226 event pairs, 42 based on Foata normal form. 1/2163 useless extension candidates. Maximal degree in co-relation 2822. Up to 142 conditions per place. [2024-11-10 14:24:12,883 INFO L140 encePairwiseOnDemand]: 515/517 looper letters, 14 selfloop transitions, 1 changer transitions 16/321 dead transitions. [2024-11-10 14:24:12,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 321 transitions, 763 flow [2024-11-10 14:24:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1417 transitions. [2024-11-10 14:24:12,888 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9136041263700838 [2024-11-10 14:24:12,888 INFO L175 Difference]: Start difference. First operand has 300 places, 317 transitions, 716 flow. Second operand 3 states and 1417 transitions. [2024-11-10 14:24:12,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 321 transitions, 763 flow [2024-11-10 14:24:12,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 321 transitions, 759 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:12,894 INFO L231 Difference]: Finished difference. Result has 299 places, 300 transitions, 676 flow [2024-11-10 14:24:12,894 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=676, PETRI_PLACES=299, PETRI_TRANSITIONS=300} [2024-11-10 14:24:12,895 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -26 predicate places. [2024-11-10 14:24:12,895 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 300 transitions, 676 flow [2024-11-10 14:24:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 468.3333333333333) internal successors, (1405), 3 states have internal predecessors, (1405), 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-11-10 14:24:12,896 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:12,896 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:12,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:24:12,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_usbErr12ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:12,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1995734009, now seen corresponding path program 1 times [2024-11-10 14:24:12,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:12,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786929936] [2024-11-10 14:24:12,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:12,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:12,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786929936] [2024-11-10 14:24:12,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786929936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:12,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:12,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:12,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049779872] [2024-11-10 14:24:12,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:12,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:12,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:12,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:12,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:13,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 517 [2024-11-10 14:24:13,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 300 transitions, 676 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-11-10 14:24:13,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:13,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 517 [2024-11-10 14:24:13,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:13,225 INFO L124 PetriNetUnfolderBase]: 147/1636 cut-off events. [2024-11-10 14:24:13,225 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-10 14:24:13,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1927 conditions, 1636 events. 147/1636 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11129 event pairs, 33 based on Foata normal form. 0/1436 useless extension candidates. Maximal degree in co-relation 1854. Up to 107 conditions per place. [2024-11-10 14:24:13,246 INFO L140 encePairwiseOnDemand]: 509/517 looper letters, 16 selfloop transitions, 5 changer transitions 3/302 dead transitions. [2024-11-10 14:24:13,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 302 transitions, 722 flow [2024-11-10 14:24:13,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:13,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:13,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1368 transitions. [2024-11-10 14:24:13,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8820116054158608 [2024-11-10 14:24:13,250 INFO L175 Difference]: Start difference. First operand has 299 places, 300 transitions, 676 flow. Second operand 3 states and 1368 transitions. [2024-11-10 14:24:13,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 302 transitions, 722 flow [2024-11-10 14:24:13,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 282 places, 302 transitions, 721 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:24:13,256 INFO L231 Difference]: Finished difference. Result has 283 places, 297 transitions, 690 flow [2024-11-10 14:24:13,257 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=280, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=690, PETRI_PLACES=283, PETRI_TRANSITIONS=297} [2024-11-10 14:24:13,258 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -42 predicate places. [2024-11-10 14:24:13,259 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 297 transitions, 690 flow [2024-11-10 14:24:13,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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-11-10 14:24:13,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:13,260 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:13,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:24:13,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread_usbErr6ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:13,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:13,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1542651927, now seen corresponding path program 1 times [2024-11-10 14:24:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:13,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202415103] [2024-11-10 14:24:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:13,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:13,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:13,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202415103] [2024-11-10 14:24:13,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202415103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:13,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:13,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:24:13,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388329413] [2024-11-10 14:24:13,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:13,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:13,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:13,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:13,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:13,452 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 455 out of 517 [2024-11-10 14:24:13,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 297 transitions, 690 flow. Second operand has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 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-11-10 14:24:13,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:13,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 455 of 517 [2024-11-10 14:24:13,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:13,640 INFO L124 PetriNetUnfolderBase]: 157/1644 cut-off events. [2024-11-10 14:24:13,640 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2024-11-10 14:24:13,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1984 conditions, 1644 events. 157/1644 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 11126 event pairs, 20 based on Foata normal form. 1/1441 useless extension candidates. Maximal degree in co-relation 1910. Up to 91 conditions per place. [2024-11-10 14:24:13,654 INFO L140 encePairwiseOnDemand]: 509/517 looper letters, 15 selfloop transitions, 5 changer transitions 0/301 dead transitions. [2024-11-10 14:24:13,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 282 places, 301 transitions, 738 flow [2024-11-10 14:24:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:13,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1388 transitions. [2024-11-10 14:24:13,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8949065119277885 [2024-11-10 14:24:13,658 INFO L175 Difference]: Start difference. First operand has 283 places, 297 transitions, 690 flow. Second operand 3 states and 1388 transitions. [2024-11-10 14:24:13,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 282 places, 301 transitions, 738 flow [2024-11-10 14:24:13,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 301 transitions, 733 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:24:13,664 INFO L231 Difference]: Finished difference. Result has 283 places, 299 transitions, 719 flow [2024-11-10 14:24:13,664 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=279, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=283, PETRI_TRANSITIONS=299} [2024-11-10 14:24:13,665 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -42 predicate places. [2024-11-10 14:24:13,665 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 299 transitions, 719 flow [2024-11-10 14:24:13,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 456.3333333333333) internal successors, (1369), 3 states have internal predecessors, (1369), 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-11-10 14:24:13,666 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:13,666 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:13,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:24:13,667 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:13,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:13,667 INFO L85 PathProgramCache]: Analyzing trace with hash -285639658, now seen corresponding path program 1 times [2024-11-10 14:24:13,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:13,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721496846] [2024-11-10 14:24:13,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:13,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:13,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:13,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:13,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721496846] [2024-11-10 14:24:13,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721496846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:13,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:13,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:13,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820846037] [2024-11-10 14:24:13,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:13,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:13,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:13,827 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 517 [2024-11-10 14:24:13,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 299 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 450.0) internal successors, (1350), 3 states have internal predecessors, (1350), 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-11-10 14:24:13,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:13,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 517 [2024-11-10 14:24:13,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:14,062 INFO L124 PetriNetUnfolderBase]: 194/1781 cut-off events. [2024-11-10 14:24:14,062 INFO L125 PetriNetUnfolderBase]: For 138/161 co-relation queries the response was YES. [2024-11-10 14:24:14,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2299 conditions, 1781 events. 194/1781 cut-off events. For 138/161 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 12259 event pairs, 36 based on Foata normal form. 2/1575 useless extension candidates. Maximal degree in co-relation 2220. Up to 190 conditions per place. [2024-11-10 14:24:14,074 INFO L140 encePairwiseOnDemand]: 511/517 looper letters, 30 selfloop transitions, 8 changer transitions 0/307 dead transitions. [2024-11-10 14:24:14,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 307 transitions, 821 flow [2024-11-10 14:24:14,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:14,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-11-10 14:24:14,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8852353320438426 [2024-11-10 14:24:14,078 INFO L175 Difference]: Start difference. First operand has 283 places, 299 transitions, 719 flow. Second operand 3 states and 1373 transitions. [2024-11-10 14:24:14,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 307 transitions, 821 flow [2024-11-10 14:24:14,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 307 transitions, 811 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:14,083 INFO L231 Difference]: Finished difference. Result has 285 places, 305 transitions, 777 flow [2024-11-10 14:24:14,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=285, PETRI_TRANSITIONS=305} [2024-11-10 14:24:14,085 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -40 predicate places. [2024-11-10 14:24:14,086 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 305 transitions, 777 flow [2024-11-10 14:24:14,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.0) internal successors, (1350), 3 states have internal predecessors, (1350), 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-11-10 14:24:14,087 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:14,087 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:14,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:24:14,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_usbErr11ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:14,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1290298484, now seen corresponding path program 1 times [2024-11-10 14:24:14,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:14,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625084870] [2024-11-10 14:24:14,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:14,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:14,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:14,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:14,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625084870] [2024-11-10 14:24:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625084870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:14,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476291397] [2024-11-10 14:24:14,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:14,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:14,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:14,194 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 461 out of 517 [2024-11-10 14:24:14,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 305 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 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-11-10 14:24:14,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:14,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 461 of 517 [2024-11-10 14:24:14,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:14,417 INFO L124 PetriNetUnfolderBase]: 188/1920 cut-off events. [2024-11-10 14:24:14,418 INFO L125 PetriNetUnfolderBase]: For 109/120 co-relation queries the response was YES. [2024-11-10 14:24:14,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2437 conditions, 1920 events. 188/1920 cut-off events. For 109/120 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 13253 event pairs, 29 based on Foata normal form. 0/1697 useless extension candidates. Maximal degree in co-relation 2360. Up to 105 conditions per place. [2024-11-10 14:24:14,436 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 14 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2024-11-10 14:24:14,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 306 transitions, 811 flow [2024-11-10 14:24:14,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:14,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1400 transitions. [2024-11-10 14:24:14,439 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9026434558349452 [2024-11-10 14:24:14,440 INFO L175 Difference]: Start difference. First operand has 285 places, 305 transitions, 777 flow. Second operand 3 states and 1400 transitions. [2024-11-10 14:24:14,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 306 transitions, 811 flow [2024-11-10 14:24:14,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 306 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:14,447 INFO L231 Difference]: Finished difference. Result has 284 places, 304 transitions, 763 flow [2024-11-10 14:24:14,448 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=282, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=284, PETRI_TRANSITIONS=304} [2024-11-10 14:24:14,449 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -41 predicate places. [2024-11-10 14:24:14,450 INFO L471 AbstractCegarLoop]: Abstraction has has 284 places, 304 transitions, 763 flow [2024-11-10 14:24:14,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 462.6666666666667) internal successors, (1388), 3 states have internal predecessors, (1388), 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-11-10 14:24:14,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:14,451 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:14,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:24:14,452 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_usbErr10ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:14,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:14,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1041983, now seen corresponding path program 1 times [2024-11-10 14:24:14,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:14,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731542364] [2024-11-10 14:24:14,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:14,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:14,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:14,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731542364] [2024-11-10 14:24:14,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731542364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:14,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:14,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:14,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064208652] [2024-11-10 14:24:14,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:14,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:14,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:14,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:14,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:14,604 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 456 out of 517 [2024-11-10 14:24:14,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 304 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 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-11-10 14:24:14,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:14,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 456 of 517 [2024-11-10 14:24:14,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:14,880 INFO L124 PetriNetUnfolderBase]: 193/1863 cut-off events. [2024-11-10 14:24:14,880 INFO L125 PetriNetUnfolderBase]: For 129/142 co-relation queries the response was YES. [2024-11-10 14:24:14,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2393 conditions, 1863 events. 193/1863 cut-off events. For 129/142 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 13218 event pairs, 27 based on Foata normal form. 0/1648 useless extension candidates. Maximal degree in co-relation 2316. Up to 127 conditions per place. [2024-11-10 14:24:14,898 INFO L140 encePairwiseOnDemand]: 514/517 looper letters, 19 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-11-10 14:24:14,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 305 transitions, 807 flow [2024-11-10 14:24:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:14,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:14,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1387 transitions. [2024-11-10 14:24:14,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8942617666021921 [2024-11-10 14:24:14,902 INFO L175 Difference]: Start difference. First operand has 284 places, 304 transitions, 763 flow. Second operand 3 states and 1387 transitions. [2024-11-10 14:24:14,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 305 transitions, 807 flow [2024-11-10 14:24:14,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 305 transitions, 803 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:14,909 INFO L231 Difference]: Finished difference. Result has 283 places, 303 transitions, 761 flow [2024-11-10 14:24:14,910 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=283, PETRI_TRANSITIONS=303} [2024-11-10 14:24:14,910 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -42 predicate places. [2024-11-10 14:24:14,911 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 303 transitions, 761 flow [2024-11-10 14:24:14,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 458.0) internal successors, (1374), 3 states have internal predecessors, (1374), 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-11-10 14:24:14,912 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:14,912 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:14,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:24:14,914 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:14,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:14,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1103559843, now seen corresponding path program 1 times [2024-11-10 14:24:14,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:14,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124354617] [2024-11-10 14:24:14,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:14,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:14,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:14,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124354617] [2024-11-10 14:24:14,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124354617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:14,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:14,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:14,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587717577] [2024-11-10 14:24:14,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:14,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:14,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:14,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:14,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:15,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-10 14:24:15,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 303 transitions, 761 flow. Second operand has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 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-11-10 14:24:15,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:15,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-10 14:24:15,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:15,361 INFO L124 PetriNetUnfolderBase]: 299/2290 cut-off events. [2024-11-10 14:24:15,362 INFO L125 PetriNetUnfolderBase]: For 359/475 co-relation queries the response was YES. [2024-11-10 14:24:15,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3216 conditions, 2290 events. 299/2290 cut-off events. For 359/475 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 17759 event pairs, 53 based on Foata normal form. 9/2033 useless extension candidates. Maximal degree in co-relation 3137. Up to 335 conditions per place. [2024-11-10 14:24:15,378 INFO L140 encePairwiseOnDemand]: 507/517 looper letters, 35 selfloop transitions, 16 changer transitions 0/316 dead transitions. [2024-11-10 14:24:15,378 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 316 transitions, 918 flow [2024-11-10 14:24:15,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1370 transitions. [2024-11-10 14:24:15,383 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8833010960670535 [2024-11-10 14:24:15,383 INFO L175 Difference]: Start difference. First operand has 283 places, 303 transitions, 761 flow. Second operand 3 states and 1370 transitions. [2024-11-10 14:24:15,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 316 transitions, 918 flow [2024-11-10 14:24:15,386 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 283 places, 316 transitions, 914 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:15,390 INFO L231 Difference]: Finished difference. Result has 285 places, 315 transitions, 899 flow [2024-11-10 14:24:15,390 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=281, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=285, PETRI_TRANSITIONS=315} [2024-11-10 14:24:15,391 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -40 predicate places. [2024-11-10 14:24:15,391 INFO L471 AbstractCegarLoop]: Abstraction has has 285 places, 315 transitions, 899 flow [2024-11-10 14:24:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.0) internal successors, (1344), 3 states have internal predecessors, (1344), 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-11-10 14:24:15,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:15,394 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:15,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:24:15,394 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread_usbErr9ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:15,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:15,395 INFO L85 PathProgramCache]: Analyzing trace with hash -908581891, now seen corresponding path program 1 times [2024-11-10 14:24:15,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:15,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089989501] [2024-11-10 14:24:15,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:15,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:15,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:15,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:15,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089989501] [2024-11-10 14:24:15,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089989501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:15,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:15,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693966264] [2024-11-10 14:24:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:15,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:15,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:15,560 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 447 out of 517 [2024-11-10 14:24:15,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 285 places, 315 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 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-11-10 14:24:15,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:15,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 447 of 517 [2024-11-10 14:24:15,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:15,875 INFO L124 PetriNetUnfolderBase]: 310/2499 cut-off events. [2024-11-10 14:24:15,876 INFO L125 PetriNetUnfolderBase]: For 915/1022 co-relation queries the response was YES. [2024-11-10 14:24:15,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3644 conditions, 2499 events. 310/2499 cut-off events. For 915/1022 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 19873 event pairs, 39 based on Foata normal form. 7/2228 useless extension candidates. Maximal degree in co-relation 3564. Up to 289 conditions per place. [2024-11-10 14:24:15,892 INFO L140 encePairwiseOnDemand]: 511/517 looper letters, 44 selfloop transitions, 9 changer transitions 0/322 dead transitions. [2024-11-10 14:24:15,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 322 transitions, 1039 flow [2024-11-10 14:24:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-11-10 14:24:15,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8839458413926499 [2024-11-10 14:24:15,896 INFO L175 Difference]: Start difference. First operand has 285 places, 315 transitions, 899 flow. Second operand 3 states and 1371 transitions. [2024-11-10 14:24:15,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 322 transitions, 1039 flow [2024-11-10 14:24:15,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 322 transitions, 1003 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:15,904 INFO L231 Difference]: Finished difference. Result has 287 places, 320 transitions, 941 flow [2024-11-10 14:24:15,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=941, PETRI_PLACES=287, PETRI_TRANSITIONS=320} [2024-11-10 14:24:15,905 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -38 predicate places. [2024-11-10 14:24:15,906 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 320 transitions, 941 flow [2024-11-10 14:24:15,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.0) internal successors, (1347), 3 states have internal predecessors, (1347), 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-11-10 14:24:15,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:15,907 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:15,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:24:15,907 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:15,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:15,908 INFO L85 PathProgramCache]: Analyzing trace with hash -276492709, now seen corresponding path program 1 times [2024-11-10 14:24:15,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:15,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574256289] [2024-11-10 14:24:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:15,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:15,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:15,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:15,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574256289] [2024-11-10 14:24:15,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574256289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:15,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:15,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:24:15,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122839862] [2024-11-10 14:24:15,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:15,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:24:15,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:15,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:24:15,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:24:16,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 445 out of 517 [2024-11-10 14:24:16,064 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 320 transitions, 941 flow. Second operand has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-11-10 14:24:16,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:16,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 445 of 517 [2024-11-10 14:24:16,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:16,580 INFO L124 PetriNetUnfolderBase]: 566/3792 cut-off events. [2024-11-10 14:24:16,580 INFO L125 PetriNetUnfolderBase]: For 2165/2437 co-relation queries the response was YES. [2024-11-10 14:24:16,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5976 conditions, 3792 events. 566/3792 cut-off events. For 2165/2437 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 34429 event pairs, 142 based on Foata normal form. 10/3378 useless extension candidates. Maximal degree in co-relation 5505. Up to 601 conditions per place. [2024-11-10 14:24:16,604 INFO L140 encePairwiseOnDemand]: 511/517 looper letters, 49 selfloop transitions, 9 changer transitions 1/327 dead transitions. [2024-11-10 14:24:16,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 327 transitions, 1093 flow [2024-11-10 14:24:16,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:24:16,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:24:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1367 transitions. [2024-11-10 14:24:16,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8813668600902643 [2024-11-10 14:24:16,608 INFO L175 Difference]: Start difference. First operand has 287 places, 320 transitions, 941 flow. Second operand 3 states and 1367 transitions. [2024-11-10 14:24:16,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 327 transitions, 1093 flow [2024-11-10 14:24:16,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 287 places, 327 transitions, 1069 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:16,618 INFO L231 Difference]: Finished difference. Result has 289 places, 324 transitions, 993 flow [2024-11-10 14:24:16,619 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=285, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=993, PETRI_PLACES=289, PETRI_TRANSITIONS=324} [2024-11-10 14:24:16,619 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -36 predicate places. [2024-11-10 14:24:16,620 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 324 transitions, 993 flow [2024-11-10 14:24:16,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 448.3333333333333) internal successors, (1345), 3 states have internal predecessors, (1345), 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-11-10 14:24:16,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:16,621 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:16,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:24:16,621 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:16,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:16,622 INFO L85 PathProgramCache]: Analyzing trace with hash 386129839, now seen corresponding path program 1 times [2024-11-10 14:24:16,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:16,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794560197] [2024-11-10 14:24:16,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:16,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:16,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:16,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794560197] [2024-11-10 14:24:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794560197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:16,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:24:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722682898] [2024-11-10 14:24:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:16,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:24:16,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:16,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:24:16,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:24:16,764 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 460 out of 517 [2024-11-10 14:24:16,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 324 transitions, 993 flow. Second operand has 5 states, 5 states have (on average 462.4) internal successors, (2312), 5 states have internal predecessors, (2312), 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-11-10 14:24:16,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:16,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 460 of 517 [2024-11-10 14:24:16,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:17,495 INFO L124 PetriNetUnfolderBase]: 554/4608 cut-off events. [2024-11-10 14:24:17,496 INFO L125 PetriNetUnfolderBase]: For 1454/1576 co-relation queries the response was YES. [2024-11-10 14:24:17,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6781 conditions, 4608 events. 554/4608 cut-off events. For 1454/1576 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 38869 event pairs, 49 based on Foata normal form. 8/4123 useless extension candidates. Maximal degree in co-relation 6701. Up to 295 conditions per place. [2024-11-10 14:24:17,540 INFO L140 encePairwiseOnDemand]: 509/517 looper letters, 32 selfloop transitions, 8 changer transitions 0/346 dead transitions. [2024-11-10 14:24:17,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 295 places, 346 transitions, 1124 flow [2024-11-10 14:24:17,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:24:17,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 14:24:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3261 transitions. [2024-11-10 14:24:17,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9010776457584968 [2024-11-10 14:24:17,548 INFO L175 Difference]: Start difference. First operand has 289 places, 324 transitions, 993 flow. Second operand 7 states and 3261 transitions. [2024-11-10 14:24:17,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 295 places, 346 transitions, 1124 flow [2024-11-10 14:24:17,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 346 transitions, 1094 flow, removed 6 selfloop flow, removed 2 redundant places. [2024-11-10 14:24:17,559 INFO L231 Difference]: Finished difference. Result has 298 places, 331 transitions, 1021 flow [2024-11-10 14:24:17,560 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=963, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1021, PETRI_PLACES=298, PETRI_TRANSITIONS=331} [2024-11-10 14:24:17,560 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -27 predicate places. [2024-11-10 14:24:17,560 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 331 transitions, 1021 flow [2024-11-10 14:24:17,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 462.4) internal successors, (2312), 5 states have internal predecessors, (2312), 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-11-10 14:24:17,562 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:17,563 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:17,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:24:17,563 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_usbErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:17,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:17,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1503081019, now seen corresponding path program 1 times [2024-11-10 14:24:17,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:17,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157013341] [2024-11-10 14:24:17,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:17,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:24:17,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:24:17,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:24:17,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157013341] [2024-11-10 14:24:17,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157013341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:24:17,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:24:17,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:24:17,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658724672] [2024-11-10 14:24:17,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:24:17,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:24:17,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:24:17,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:24:17,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:24:17,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 517 [2024-11-10 14:24:17,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 331 transitions, 1021 flow. Second operand has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 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-11-10 14:24:17,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:24:17,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 517 [2024-11-10 14:24:17,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:24:18,666 INFO L124 PetriNetUnfolderBase]: 901/7839 cut-off events. [2024-11-10 14:24:18,666 INFO L125 PetriNetUnfolderBase]: For 2422/2625 co-relation queries the response was YES. [2024-11-10 14:24:18,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11614 conditions, 7839 events. 901/7839 cut-off events. For 2422/2625 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 74486 event pairs, 84 based on Foata normal form. 16/7045 useless extension candidates. Maximal degree in co-relation 11530. Up to 554 conditions per place. [2024-11-10 14:24:18,751 INFO L140 encePairwiseOnDemand]: 510/517 looper letters, 34 selfloop transitions, 9 changer transitions 0/358 dead transitions. [2024-11-10 14:24:18,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 358 transitions, 1172 flow [2024-11-10 14:24:18,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 14:24:18,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-10 14:24:18,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 3278 transitions. [2024-11-10 14:24:18,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9057750759878419 [2024-11-10 14:24:18,855 INFO L175 Difference]: Start difference. First operand has 298 places, 331 transitions, 1021 flow. Second operand 7 states and 3278 transitions. [2024-11-10 14:24:18,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 358 transitions, 1172 flow [2024-11-10 14:24:18,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 358 transitions, 1172 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:24:18,870 INFO L231 Difference]: Finished difference. Result has 310 places, 339 transitions, 1089 flow [2024-11-10 14:24:18,870 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=517, PETRI_DIFFERENCE_MINUEND_FLOW=1021, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1089, PETRI_PLACES=310, PETRI_TRANSITIONS=339} [2024-11-10 14:24:18,872 INFO L277 CegarLoopForPetriNet]: 325 programPoint places, -15 predicate places. [2024-11-10 14:24:18,872 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 339 transitions, 1089 flow [2024-11-10 14:24:18,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 464.0) internal successors, (2320), 5 states have internal predecessors, (2320), 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-11-10 14:24:18,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:24:18,874 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 14:24:18,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:24:18,874 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE === [thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE, thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-11-10 14:24:18,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:24:18,875 INFO L85 PathProgramCache]: Analyzing trace with hash 512113711, now seen corresponding path program 1 times [2024-11-10 14:24:18,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:24:18,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389223800] [2024-11-10 14:24:18,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:24:18,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:24:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:24:18,898 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:24:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:24:18,961 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:24:18,961 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:24:18,962 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (42 of 43 remaining) [2024-11-10 14:24:18,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr1ASSERT_VIOLATIONDATA_RACE (41 of 43 remaining) [2024-11-10 14:24:18,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (40 of 43 remaining) [2024-11-10 14:24:18,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (39 of 43 remaining) [2024-11-10 14:24:18,965 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (35 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (33 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (32 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (31 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (30 of 43 remaining) [2024-11-10 14:24:18,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (29 of 43 remaining) [2024-11-10 14:24:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (28 of 43 remaining) [2024-11-10 14:24:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (27 of 43 remaining) [2024-11-10 14:24:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (26 of 43 remaining) [2024-11-10 14:24:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (25 of 43 remaining) [2024-11-10 14:24:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (24 of 43 remaining) [2024-11-10 14:24:18,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (23 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (22 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (21 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (20 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (19 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (18 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (17 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 43 remaining) [2024-11-10 14:24:18,968 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_ath9kErr0ASSERT_VIOLATIONDATA_RACE (15 of 43 remaining) [2024-11-10 14:24:18,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr13ASSERT_VIOLATIONDATA_RACE (14 of 43 remaining) [2024-11-10 14:24:18,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr1ASSERT_VIOLATIONDATA_RACE (13 of 43 remaining) [2024-11-10 14:24:18,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr0ASSERT_VIOLATIONDATA_RACE (12 of 43 remaining) [2024-11-10 14:24:18,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr12ASSERT_VIOLATIONDATA_RACE (11 of 43 remaining) [2024-11-10 14:24:18,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr7ASSERT_VIOLATIONDATA_RACE (10 of 43 remaining) [2024-11-10 14:24:18,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr2ASSERT_VIOLATIONDATA_RACE (9 of 43 remaining) [2024-11-10 14:24:18,969 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr6ASSERT_VIOLATIONDATA_RACE (8 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr11ASSERT_VIOLATIONDATA_RACE (7 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr5ASSERT_VIOLATIONDATA_RACE (6 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr4ASSERT_VIOLATIONDATA_RACE (5 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr3ASSERT_VIOLATIONDATA_RACE (4 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr10ASSERT_VIOLATIONDATA_RACE (3 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr9ASSERT_VIOLATIONDATA_RACE (2 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbErr8ASSERT_VIOLATIONDATA_RACE (1 of 43 remaining) [2024-11-10 14:24:18,970 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread_usbThread1of1ForFork1Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 43 remaining) [2024-11-10 14:24:18,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:24:18,971 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:24:19,071 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-10 14:24:19,072 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:24:19,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:24:19 BasicIcfg [2024-11-10 14:24:19,077 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:24:19,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:24:19,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:24:19,078 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:24:19,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:24:08" (3/4) ... [2024-11-10 14:24:19,080 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:24:19,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:24:19,164 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:24:19,164 INFO L158 Benchmark]: Toolchain (without parser) took 12077.83ms. Allocated memory was 167.8MB in the beginning and 593.5MB in the end (delta: 425.7MB). Free memory was 134.8MB in the beginning and 432.9MB in the end (delta: -298.1MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2024-11-10 14:24:19,164 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:24:19,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 928.10ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 72.6MB in the end (delta: 62.1MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2024-11-10 14:24:19,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.20ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 68.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 14:24:19,240 INFO L158 Benchmark]: Boogie Preprocessor took 37.13ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 65.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:24:19,241 INFO L158 Benchmark]: IcfgBuilder took 844.86ms. Allocated memory is still 167.8MB. Free memory was 65.2MB in the beginning and 106.0MB in the end (delta: -40.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-10 14:24:19,241 INFO L158 Benchmark]: TraceAbstraction took 10098.99ms. Allocated memory was 167.8MB in the beginning and 593.5MB in the end (delta: 425.7MB). Free memory was 106.0MB in the beginning and 450.7MB in the end (delta: -344.7MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. [2024-11-10 14:24:19,241 INFO L158 Benchmark]: Witness Printer took 85.77ms. Allocated memory is still 593.5MB. Free memory was 450.7MB in the beginning and 432.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 14:24:19,242 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 928.10ms. Allocated memory is still 167.8MB. Free memory was 134.8MB in the beginning and 72.6MB in the end (delta: 62.1MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.20ms. Allocated memory is still 167.8MB. Free memory was 72.0MB in the beginning and 68.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.13ms. Allocated memory is still 167.8MB. Free memory was 68.5MB in the beginning and 65.2MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 844.86ms. Allocated memory is still 167.8MB. Free memory was 65.2MB in the beginning and 106.0MB in the end (delta: -40.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10098.99ms. Allocated memory was 167.8MB in the beginning and 593.5MB in the end (delta: 425.7MB). Free memory was 106.0MB in the beginning and 450.7MB in the end (delta: -344.7MB). Peak memory consumption was 83.0MB. Max. memory is 16.1GB. * Witness Printer took 85.77ms. Allocated memory is still 593.5MB. Free memory was 450.7MB in the beginning and 432.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1, t2; VAL [t1=0, t2=0] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={3:0}, t1=0, t2=0] [L1696] 0 int pdev; VAL [mutex={3:0}, pdev=0, t1=0, t2=0] [L1741] 0 int ldv_usb_state; VAL [ldv_usb_state=0, mutex={3:0}, pdev=0, t1=0, t2=0] [L1798] CALL 0 module_init() [L1779] 0 pdev = 1 VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] EXPR 0 pdev==1 VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1780] RET 0 ldv_assert(pdev==1) [L1781] COND TRUE 0 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=0, t2=0] [L1782] 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1782] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread_usb, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1743] 1 ldv_usb_state = 0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1744] 1 int probe_ret; VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1745] COND TRUE 1 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1748] 1 ldv_usb_state==0 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1749] CALL, EXPR 1 ath_ahb_probe() [L1730] 1 int error; VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1731] CALL, EXPR 1 ieee80211_register_hw() [L1717] COND TRUE 1 __VERIFIER_nondet_int() VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1718] FCALL, FORK 1 pthread_create(&t2, ((void *)0), thread_ath9k, ((void *)0)) VAL [ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1719] 1 return 0; VAL [\result=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1731] RET, EXPR 1 ieee80211_register_hw() [L1731] 1 error = ieee80211_register_hw() VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1732] COND FALSE 1 !(\read(error)) VAL [error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1704] COND TRUE 2 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1706] 2 case 1: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1707] CALL 2 ath9k_flush() [L1734] 1 return 0; VAL [\result=0, error=0, ldv_usb_state=0, mutex={3:0}, pdev=1, t1=-1, t2=0] [L1749] RET, EXPR 1 ath_ahb_probe() [L1749] 1 probe_ret = ath_ahb_probe() VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1747] 1 case 0: VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=0, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1752] 1 ldv_usb_state = 1 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=1, probe_ret=0, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=7, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=6, t1=-1, t2=0] [L1753] 1 pdev = 7 VAL [\old(arg)={0:0}, arg={0:0}, ldv_usb_state=1, mutex={3:0}, pdev=6, probe_ret=0, t1=-1, t2=0] [L1699] 2 pdev = 6 VAL [ldv_usb_state=1, mutex={3:0}, pdev=6, t1=-1, t2=0] Now there is a data race on ~pdev~0 between C: pdev = 7 [1753] and C: pdev = 6 [1699] - UnprovableResult [Line: 1700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1779]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1780]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1785]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1786]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1792]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1794]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1795]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1782]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1743]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1773]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1774]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1766]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1760]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1761]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1762]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1753]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1754]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1718]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 521 locations, 43 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.8s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1402 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 455 mSDsluCounter, 307 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46 mSDsCounter, 88 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1377 IncrementalHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 88 mSolverCounterUnsat, 261 mSDtfsCounter, 1377 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1089occurred in iteration=16, InterpolantAutomatonStates: 56, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1245 NumberOfCodeBlocks, 1245 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1112 ConstructedInterpolants, 0 QuantifiedInterpolants, 1194 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-10 14:24:19,272 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE