./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 f044966ade6b1d79627a5dcb577ad24e14a4ae2ab2467e458af5fa83aa6cd521 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:16:01,693 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:16:01,757 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:16:01,763 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:16:01,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:16:01,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:16:01,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:16:01,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:16:01,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:16:01,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:16:01,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:16:01,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:16:01,815 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:16:01,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:16:01,816 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:16:01,819 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:16:01,819 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:16:01,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:16:01,820 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:16:01,820 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:16:01,820 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:16:01,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:16:01,821 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:16:01,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:16:01,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:16:01,823 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:16:01,823 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:16:01,824 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:16:01,824 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:16:01,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:16:01,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:16:01,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:01,825 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:16:01,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:16:01,826 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:16:01,826 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:16:01,826 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:16:01,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:16:01,827 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:16:01,827 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:16:01,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:16:01,828 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-clean/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-clean/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 -> f044966ade6b1d79627a5dcb577ad24e14a4ae2ab2467e458af5fa83aa6cd521 [2024-10-11 17:16:02,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:16:02,166 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:16:02,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:16:02,170 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:16:02,171 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:16:02,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2024-10-11 17:16:03,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:16:03,806 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:16:03,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-ticket-5.wvr.c [2024-10-11 17:16:03,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5cb141c23/4da721be8a154def962fc31632e50edd/FLAG9492e570d [2024-10-11 17:16:03,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/5cb141c23/4da721be8a154def962fc31632e50edd [2024-10-11 17:16:03,843 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:16:03,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:16:03,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:03,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:16:03,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:16:03,854 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:03" (1/1) ... [2024-10-11 17:16:03,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65bfb0b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:03, skipping insertion in model container [2024-10-11 17:16:03,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:16:03" (1/1) ... [2024-10-11 17:16:03,885 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:16:04,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:04,142 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:16:04,189 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:16:04,208 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:16:04,208 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04 WrapperNode [2024-10-11 17:16:04,209 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:16:04,210 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:04,210 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:16:04,210 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:16:04,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,288 INFO L138 Inliner]: procedures = 23, calls = 61, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 452 [2024-10-11 17:16:04,289 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:16:04,290 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:16:04,290 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:16:04,290 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:16:04,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,303 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,317 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,323 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:16:04,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:16:04,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:16:04,335 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:16:04,335 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (1/1) ... [2024-10-11 17:16:04,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:16:04,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:16:04,370 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:16:04,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:16:04,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:16:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:16:04,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:16:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:16:04,415 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:16:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:16:04,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:16:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-11 17:16:04,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-11 17:16:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:16:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-10-11 17:16:04,416 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-10-11 17:16:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:16:04,416 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:16:04,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:16:04,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:16:04,419 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:16:04,543 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:16:04,546 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:16:05,173 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:16:05,173 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:16:05,458 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:16:05,459 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 17:16:05,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:05 BoogieIcfgContainer [2024-10-11 17:16:05,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:16:05,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:16:05,462 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:16:05,465 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:16:05,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:16:03" (1/3) ... [2024-10-11 17:16:05,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4914dbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:05, skipping insertion in model container [2024-10-11 17:16:05,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:16:04" (2/3) ... [2024-10-11 17:16:05,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4914dbc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:16:05, skipping insertion in model container [2024-10-11 17:16:05,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:16:05" (3/3) ... [2024-10-11 17:16:05,468 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-ticket-5.wvr.c [2024-10-11 17:16:05,487 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:16:05,488 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2024-10-11 17:16:05,488 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:16:05,656 INFO L143 ThreadInstanceAdder]: Constructed 5 joinOtherThreadTransitions. [2024-10-11 17:16:05,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 293 transitions, 621 flow [2024-10-11 17:16:05,814 INFO L124 PetriNetUnfolderBase]: 5/288 cut-off events. [2024-10-11 17:16:05,814 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-11 17:16:05,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309 conditions, 288 events. 5/288 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 354 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 251. Up to 2 conditions per place. [2024-10-11 17:16:05,824 INFO L82 GeneralOperation]: Start removeDead. Operand has 304 places, 293 transitions, 621 flow [2024-10-11 17:16:05,834 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 283 places, 271 transitions, 572 flow [2024-10-11 17:16:05,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:16:05,861 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;@2c5167b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:16:05,861 INFO L334 AbstractCegarLoop]: Starting to check reachability of 129 error locations. [2024-10-11 17:16:05,872 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:16:05,873 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-10-11 17:16:05,873 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:16:05,873 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:05,876 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] [2024-10-11 17:16:05,876 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:05,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:05,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1190657450, now seen corresponding path program 1 times [2024-10-11 17:16:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:05,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473975235] [2024-10-11 17:16:05,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:05,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:06,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:06,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:06,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473975235] [2024-10-11 17:16:06,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473975235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:06,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:06,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919283587] [2024-10-11 17:16:06,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:06,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:06,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:06,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:06,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:06,171 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 293 [2024-10-11 17:16:06,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 271 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:06,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:06,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 293 [2024-10-11 17:16:06,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:11,259 INFO L124 PetriNetUnfolderBase]: 16567/25471 cut-off events. [2024-10-11 17:16:11,259 INFO L125 PetriNetUnfolderBase]: For 3280/3280 co-relation queries the response was YES. [2024-10-11 17:16:11,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50169 conditions, 25471 events. 16567/25471 cut-off events. For 3280/3280 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187080 event pairs, 16564 based on Foata normal form. 1/25381 useless extension candidates. Maximal degree in co-relation 49529. Up to 22035 conditions per place. [2024-10-11 17:16:11,550 INFO L140 encePairwiseOnDemand]: 235/293 looper letters, 34 selfloop transitions, 2 changer transitions 1/215 dead transitions. [2024-10-11 17:16:11,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 215 transitions, 532 flow [2024-10-11 17:16:11,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:11,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2024-10-11 17:16:11,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7804323094425484 [2024-10-11 17:16:11,573 INFO L175 Difference]: Start difference. First operand has 283 places, 271 transitions, 572 flow. Second operand 3 states and 686 transitions. [2024-10-11 17:16:11,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 215 transitions, 532 flow [2024-10-11 17:16:11,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 215 transitions, 512 flow, removed 0 selfloop flow, removed 10 redundant places. [2024-10-11 17:16:11,596 INFO L231 Difference]: Finished difference. Result has 220 places, 214 transitions, 442 flow [2024-10-11 17:16:11,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=442, PETRI_PLACES=220, PETRI_TRANSITIONS=214} [2024-10-11 17:16:11,604 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -63 predicate places. [2024-10-11 17:16:11,606 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 214 transitions, 442 flow [2024-10-11 17:16:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:11,608 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:11,608 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] [2024-10-11 17:16:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:16:11,609 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:11,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1157693730, now seen corresponding path program 1 times [2024-10-11 17:16:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743281498] [2024-10-11 17:16:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:11,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:11,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:11,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743281498] [2024-10-11 17:16:11,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743281498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:11,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:11,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:11,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319458242] [2024-10-11 17:16:11,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:11,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:11,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:11,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:11,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:11,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 293 [2024-10-11 17:16:11,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 214 transitions, 442 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:11,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:11,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 293 [2024-10-11 17:16:11,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:15,128 INFO L124 PetriNetUnfolderBase]: 16567/25469 cut-off events. [2024-10-11 17:16:15,129 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:15,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48447 conditions, 25469 events. 16567/25469 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187153 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48411. Up to 22035 conditions per place. [2024-10-11 17:16:15,339 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 34 selfloop transitions, 2 changer transitions 0/213 dead transitions. [2024-10-11 17:16:15,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 213 transitions, 512 flow [2024-10-11 17:16:15,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:15,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:15,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-10-11 17:16:15,342 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7178612059158134 [2024-10-11 17:16:15,342 INFO L175 Difference]: Start difference. First operand has 220 places, 214 transitions, 442 flow. Second operand 3 states and 631 transitions. [2024-10-11 17:16:15,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 213 transitions, 512 flow [2024-10-11 17:16:15,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 213 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:15,347 INFO L231 Difference]: Finished difference. Result has 218 places, 213 transitions, 440 flow [2024-10-11 17:16:15,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=218, PETRI_TRANSITIONS=213} [2024-10-11 17:16:15,348 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -65 predicate places. [2024-10-11 17:16:15,349 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 213 transitions, 440 flow [2024-10-11 17:16:15,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:15,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:15,350 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] [2024-10-11 17:16:15,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:16:15,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:15,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:15,351 INFO L85 PathProgramCache]: Analyzing trace with hash -94091231, now seen corresponding path program 1 times [2024-10-11 17:16:15,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:15,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179619583] [2024-10-11 17:16:15,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:15,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:15,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:15,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:15,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179619583] [2024-10-11 17:16:15,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179619583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:15,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:15,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:15,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586590822] [2024-10-11 17:16:15,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:15,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:15,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:15,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:15,444 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 293 [2024-10-11 17:16:15,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 213 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:15,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:15,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 293 [2024-10-11 17:16:15,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:18,322 INFO L124 PetriNetUnfolderBase]: 16567/25468 cut-off events. [2024-10-11 17:16:18,322 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:18,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48446 conditions, 25468 events. 16567/25468 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187248 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48402. Up to 22035 conditions per place. [2024-10-11 17:16:18,758 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 34 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2024-10-11 17:16:18,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 212 transitions, 510 flow [2024-10-11 17:16:18,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-10-11 17:16:18,761 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7178612059158134 [2024-10-11 17:16:18,761 INFO L175 Difference]: Start difference. First operand has 218 places, 213 transitions, 440 flow. Second operand 3 states and 631 transitions. [2024-10-11 17:16:18,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 212 transitions, 510 flow [2024-10-11 17:16:18,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 212 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:18,767 INFO L231 Difference]: Finished difference. Result has 217 places, 212 transitions, 438 flow [2024-10-11 17:16:18,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=217, PETRI_TRANSITIONS=212} [2024-10-11 17:16:18,770 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -66 predicate places. [2024-10-11 17:16:18,770 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 212 transitions, 438 flow [2024-10-11 17:16:18,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:18,771 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:18,771 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] [2024-10-11 17:16:18,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:16:18,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:18,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:18,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1317316759, now seen corresponding path program 1 times [2024-10-11 17:16:18,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:18,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305369052] [2024-10-11 17:16:18,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:18,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:18,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:18,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:18,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305369052] [2024-10-11 17:16:18,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305369052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:18,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:18,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:18,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997056048] [2024-10-11 17:16:18,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:18,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:18,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:18,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:18,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:18,864 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 293 [2024-10-11 17:16:18,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 212 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:18,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:18,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 293 [2024-10-11 17:16:18,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:21,893 INFO L124 PetriNetUnfolderBase]: 16567/25467 cut-off events. [2024-10-11 17:16:21,894 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:21,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48445 conditions, 25467 events. 16567/25467 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187282 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48393. Up to 22035 conditions per place. [2024-10-11 17:16:22,029 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 34 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-11 17:16:22,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 211 transitions, 508 flow [2024-10-11 17:16:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:22,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-10-11 17:16:22,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7178612059158134 [2024-10-11 17:16:22,032 INFO L175 Difference]: Start difference. First operand has 217 places, 212 transitions, 438 flow. Second operand 3 states and 631 transitions. [2024-10-11 17:16:22,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 211 transitions, 508 flow [2024-10-11 17:16:22,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 216 places, 211 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:22,036 INFO L231 Difference]: Finished difference. Result has 216 places, 211 transitions, 436 flow [2024-10-11 17:16:22,036 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=432, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=216, PETRI_TRANSITIONS=211} [2024-10-11 17:16:22,037 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -67 predicate places. [2024-10-11 17:16:22,037 INFO L471 AbstractCegarLoop]: Abstraction has has 216 places, 211 transitions, 436 flow [2024-10-11 17:16:22,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:22,038 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:22,038 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] [2024-10-11 17:16:22,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:16:22,039 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:22,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:22,039 INFO L85 PathProgramCache]: Analyzing trace with hash -227766531, now seen corresponding path program 1 times [2024-10-11 17:16:22,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:22,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020024072] [2024-10-11 17:16:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:22,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:22,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:22,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:22,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020024072] [2024-10-11 17:16:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020024072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:22,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704195052] [2024-10-11 17:16:22,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:22,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:22,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:22,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:22,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 293 [2024-10-11 17:16:22,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 216 places, 211 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:22,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:22,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 293 [2024-10-11 17:16:22,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:25,016 INFO L124 PetriNetUnfolderBase]: 16567/25466 cut-off events. [2024-10-11 17:16:25,016 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:25,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48444 conditions, 25466 events. 16567/25466 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187066 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48384. Up to 22035 conditions per place. [2024-10-11 17:16:25,151 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 34 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2024-10-11 17:16:25,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 217 places, 210 transitions, 506 flow [2024-10-11 17:16:25,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:25,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:25,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 631 transitions. [2024-10-11 17:16:25,154 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7178612059158134 [2024-10-11 17:16:25,154 INFO L175 Difference]: Start difference. First operand has 216 places, 211 transitions, 436 flow. Second operand 3 states and 631 transitions. [2024-10-11 17:16:25,154 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 217 places, 210 transitions, 506 flow [2024-10-11 17:16:25,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 210 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:25,157 INFO L231 Difference]: Finished difference. Result has 215 places, 210 transitions, 434 flow [2024-10-11 17:16:25,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=434, PETRI_PLACES=215, PETRI_TRANSITIONS=210} [2024-10-11 17:16:25,159 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -68 predicate places. [2024-10-11 17:16:25,159 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 210 transitions, 434 flow [2024-10-11 17:16:25,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 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-10-11 17:16:25,159 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:25,160 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-10-11 17:16:25,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:16:25,160 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:25,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:25,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1123155377, now seen corresponding path program 1 times [2024-10-11 17:16:25,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:25,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069599638] [2024-10-11 17:16:25,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:25,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:25,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:25,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:25,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069599638] [2024-10-11 17:16:25,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069599638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:25,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:25,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:25,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859461642] [2024-10-11 17:16:25,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:25,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:25,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:25,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:25,260 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 293 [2024-10-11 17:16:25,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 210 transitions, 434 flow. Second operand has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 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-10-11 17:16:25,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:25,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 293 [2024-10-11 17:16:25,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:28,245 INFO L124 PetriNetUnfolderBase]: 16567/25465 cut-off events. [2024-10-11 17:16:28,245 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:28,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48446 conditions, 25465 events. 16567/25465 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187007 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48378. Up to 22038 conditions per place. [2024-10-11 17:16:28,372 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 37 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2024-10-11 17:16:28,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 216 places, 209 transitions, 510 flow [2024-10-11 17:16:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:28,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 625 transitions. [2024-10-11 17:16:28,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7110352673492605 [2024-10-11 17:16:28,375 INFO L175 Difference]: Start difference. First operand has 215 places, 210 transitions, 434 flow. Second operand 3 states and 625 transitions. [2024-10-11 17:16:28,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 216 places, 209 transitions, 510 flow [2024-10-11 17:16:28,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 209 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:28,378 INFO L231 Difference]: Finished difference. Result has 214 places, 209 transitions, 432 flow [2024-10-11 17:16:28,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=214, PETRI_TRANSITIONS=209} [2024-10-11 17:16:28,379 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -69 predicate places. [2024-10-11 17:16:28,379 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 209 transitions, 432 flow [2024-10-11 17:16:28,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 196.33333333333334) internal successors, (589), 3 states have internal predecessors, (589), 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-10-11 17:16:28,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:28,380 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] [2024-10-11 17:16:28,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:16:28,380 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:28,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:28,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1184189583, now seen corresponding path program 1 times [2024-10-11 17:16:28,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:28,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663580850] [2024-10-11 17:16:28,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:28,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:28,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:28,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:28,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:28,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663580850] [2024-10-11 17:16:28,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663580850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:28,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:28,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:28,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973069165] [2024-10-11 17:16:28,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:28,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:28,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:28,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:28,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:28,464 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 293 [2024-10-11 17:16:28,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 209 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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-10-11 17:16:28,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:28,465 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 293 [2024-10-11 17:16:28,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:30,980 INFO L124 PetriNetUnfolderBase]: 16567/25464 cut-off events. [2024-10-11 17:16:30,981 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:31,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48443 conditions, 25464 events. 16567/25464 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187265 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48367. Up to 22036 conditions per place. [2024-10-11 17:16:31,145 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 35 selfloop transitions, 2 changer transitions 0/208 dead transitions. [2024-10-11 17:16:31,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 208 transitions, 504 flow [2024-10-11 17:16:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:31,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:31,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2024-10-11 17:16:31,147 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7155858930602957 [2024-10-11 17:16:31,148 INFO L175 Difference]: Start difference. First operand has 214 places, 209 transitions, 432 flow. Second operand 3 states and 629 transitions. [2024-10-11 17:16:31,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 208 transitions, 504 flow [2024-10-11 17:16:31,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 208 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:31,152 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 430 flow [2024-10-11 17:16:31,154 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=430, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2024-10-11 17:16:31,155 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -70 predicate places. [2024-10-11 17:16:31,155 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 430 flow [2024-10-11 17:16:31,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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-10-11 17:16:31,156 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:31,156 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] [2024-10-11 17:16:31,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:16:31,156 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:31,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:31,156 INFO L85 PathProgramCache]: Analyzing trace with hash -573589795, now seen corresponding path program 1 times [2024-10-11 17:16:31,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:31,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977691748] [2024-10-11 17:16:31,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:31,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:31,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:31,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:31,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977691748] [2024-10-11 17:16:31,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977691748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:31,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:31,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:31,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704460960] [2024-10-11 17:16:31,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:31,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:31,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:31,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:31,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:31,248 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 293 [2024-10-11 17:16:31,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 430 flow. Second operand has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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-10-11 17:16:31,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:31,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 293 [2024-10-11 17:16:31,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:34,322 INFO L124 PetriNetUnfolderBase]: 16567/25463 cut-off events. [2024-10-11 17:16:34,323 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:34,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48442 conditions, 25463 events. 16567/25463 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187172 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48358. Up to 22036 conditions per place. [2024-10-11 17:16:34,456 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 35 selfloop transitions, 2 changer transitions 0/207 dead transitions. [2024-10-11 17:16:34,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 207 transitions, 502 flow [2024-10-11 17:16:34,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:34,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 629 transitions. [2024-10-11 17:16:34,458 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7155858930602957 [2024-10-11 17:16:34,458 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 430 flow. Second operand 3 states and 629 transitions. [2024-10-11 17:16:34,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 207 transitions, 502 flow [2024-10-11 17:16:34,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 207 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:34,462 INFO L231 Difference]: Finished difference. Result has 212 places, 207 transitions, 428 flow [2024-10-11 17:16:34,462 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=428, PETRI_PLACES=212, PETRI_TRANSITIONS=207} [2024-10-11 17:16:34,463 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -71 predicate places. [2024-10-11 17:16:34,463 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 207 transitions, 428 flow [2024-10-11 17:16:34,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.33333333333334) internal successors, (595), 3 states have internal predecessors, (595), 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-10-11 17:16:34,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:34,465 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-10-11 17:16:34,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:16:34,465 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:34,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:34,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1026057, now seen corresponding path program 1 times [2024-10-11 17:16:34,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:34,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95530642] [2024-10-11 17:16:34,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:34,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:34,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:34,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:34,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95530642] [2024-10-11 17:16:34,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95530642] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:34,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:34,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:34,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986145232] [2024-10-11 17:16:34,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:34,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:34,556 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 293 [2024-10-11 17:16:34,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 207 transitions, 428 flow. Second operand has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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-10-11 17:16:34,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:34,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 293 [2024-10-11 17:16:34,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:16:37,098 INFO L124 PetriNetUnfolderBase]: 16567/25462 cut-off events. [2024-10-11 17:16:37,099 INFO L125 PetriNetUnfolderBase]: For 781/781 co-relation queries the response was YES. [2024-10-11 17:16:37,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48442 conditions, 25462 events. 16567/25462 cut-off events. For 781/781 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 187208 event pairs, 16564 based on Foata normal form. 0/25380 useless extension candidates. Maximal degree in co-relation 48350. Up to 22037 conditions per place. [2024-10-11 17:16:37,248 INFO L140 encePairwiseOnDemand]: 290/293 looper letters, 36 selfloop transitions, 2 changer transitions 0/206 dead transitions. [2024-10-11 17:16:37,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 206 transitions, 502 flow [2024-10-11 17:16:37,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:16:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:16:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 627 transitions. [2024-10-11 17:16:37,251 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7133105802047781 [2024-10-11 17:16:37,251 INFO L175 Difference]: Start difference. First operand has 212 places, 207 transitions, 428 flow. Second operand 3 states and 627 transitions. [2024-10-11 17:16:37,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 206 transitions, 502 flow [2024-10-11 17:16:37,252 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 206 transitions, 498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:16:37,254 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 426 flow [2024-10-11 17:16:37,255 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=293, PETRI_DIFFERENCE_MINUEND_FLOW=422, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=426, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2024-10-11 17:16:37,255 INFO L277 CegarLoopForPetriNet]: 283 programPoint places, -72 predicate places. [2024-10-11 17:16:37,256 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 426 flow [2024-10-11 17:16:37,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.33333333333334) internal successors, (592), 3 states have internal predecessors, (592), 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-10-11 17:16:37,256 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:16:37,256 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] [2024-10-11 17:16:37,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:16:37,256 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 125 more)] === [2024-10-11 17:16:37,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:16:37,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1566580625, now seen corresponding path program 1 times [2024-10-11 17:16:37,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:16:37,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272534267] [2024-10-11 17:16:37,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:16:37,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:16:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:16:37,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:16:37,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:16:37,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272534267] [2024-10-11 17:16:37,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272534267] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:16:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:16:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:16:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395339563] [2024-10-11 17:16:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:16:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:16:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:16:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:16:37,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:16:37,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 195 out of 293 [2024-10-11 17:16:37,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 426 flow. Second operand has 3 states, 3 states have (on average 196.0) internal successors, (588), 3 states have internal predecessors, (588), 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-10-11 17:16:37,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:16:37,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 195 of 293 [2024-10-11 17:16:37,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand