./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:43,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:43,498 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:29:43,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:43,502 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:43,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:43,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:43,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:43,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:43,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:43,518 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:43,518 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:43,518 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:43,518 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:43,518 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:43,518 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:43,519 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:43,520 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:43,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:43,520 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:43,520 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:43,521 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 [2025-01-09 21:29:43,716 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:43,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:43,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:43,724 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:43,724 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:43,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2025-01-09 21:29:44,822 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9161865a7/bb2913d90f4443608f12d0000c1cffae/FLAG643f15577 [2025-01-09 21:29:45,039 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:45,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2025-01-09 21:29:45,054 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9161865a7/bb2913d90f4443608f12d0000c1cffae/FLAG643f15577 [2025-01-09 21:29:45,379 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9161865a7/bb2913d90f4443608f12d0000c1cffae [2025-01-09 21:29:45,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:45,382 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:45,383 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:45,383 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:45,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:45,387 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e19974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45, skipping insertion in model container [2025-01-09 21:29:45,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,402 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:45,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:45,547 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:45,570 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:45,583 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:45,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45 WrapperNode [2025-01-09 21:29:45,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:45,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:45,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:45,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:45,594 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,599 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,614 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-01-09 21:29:45,614 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:45,615 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:45,615 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:45,615 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:45,621 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,621 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,624 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,636 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,637 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,640 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,645 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:45,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:45,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:45,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:45,651 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (1/1) ... [2025-01-09 21:29:45,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:45,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:45,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:29:45,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:29:45,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:45,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:45,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:29:45,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:29:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-01-09 21:29:45,713 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-01-09 21:29:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:45,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:45,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:45,714 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:29:45,776 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:45,778 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:46,026 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:46,026 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:46,038 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:46,038 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:29:46,039 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:46 BoogieIcfgContainer [2025-01-09 21:29:46,039 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:46,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:46,040 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:46,043 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:46,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:45" (1/3) ... [2025-01-09 21:29:46,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d66384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:46, skipping insertion in model container [2025-01-09 21:29:46,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:45" (2/3) ... [2025-01-09 21:29:46,044 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60d66384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:46, skipping insertion in model container [2025-01-09 21:29:46,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:46" (3/3) ... [2025-01-09 21:29:46,045 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2025-01-09 21:29:46,055 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:46,056 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x4.wvr.c that has 5 procedures, 294 locations, 1 initial locations, 4 loop locations, and 47 error locations. [2025-01-09 21:29:46,056 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:46,129 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:29:46,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 306 places, 307 transitions, 642 flow [2025-01-09 21:29:46,242 INFO L124 PetriNetUnfolderBase]: 14/303 cut-off events. [2025-01-09 21:29:46,244 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:29:46,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 303 events. 14/303 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 644 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. [2025-01-09 21:29:46,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 307 transitions, 642 flow [2025-01-09 21:29:46,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 283 transitions, 590 flow [2025-01-09 21:29:46,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:46,267 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;@342ce6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:46,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-01-09 21:29:46,272 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:46,272 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:29:46,272 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:46,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,273 INFO L206 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] [2025-01-09 21:29:46,273 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:46,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash 898822487, now seen corresponding path program 1 times [2025-01-09 21:29:46,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316649885] [2025-01-09 21:29:46,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:46,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:29:46,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:29:46,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:46,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316649885] [2025-01-09 21:29:46,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316649885] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:46,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341246830] [2025-01-09 21:29:46,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:46,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:46,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 307 [2025-01-09 21:29:46,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 283 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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) [2025-01-09 21:29:46,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 307 [2025-01-09 21:29:46,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:46,614 INFO L124 PetriNetUnfolderBase]: 31/403 cut-off events. [2025-01-09 21:29:46,614 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:29:46,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 403 events. 31/403 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1602 event pairs, 21 based on Foata normal form. 55/375 useless extension candidates. Maximal degree in co-relation 389. Up to 67 conditions per place. [2025-01-09 21:29:46,623 INFO L140 encePairwiseOnDemand]: 299/307 looper letters, 21 selfloop transitions, 2 changer transitions 1/277 dead transitions. [2025-01-09 21:29:46,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 277 transitions, 624 flow [2025-01-09 21:29:46,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:46,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2025-01-09 21:29:46,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9272529858849077 [2025-01-09 21:29:46,636 INFO L175 Difference]: Start difference. First operand has 284 places, 283 transitions, 590 flow. Second operand 3 states and 854 transitions. [2025-01-09 21:29:46,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 277 transitions, 624 flow [2025-01-09 21:29:46,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 277 transitions, 608 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-01-09 21:29:46,645 INFO L231 Difference]: Finished difference. Result has 277 places, 276 transitions, 564 flow [2025-01-09 21:29:46,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=277, PETRI_TRANSITIONS=276} [2025-01-09 21:29:46,649 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -7 predicate places. [2025-01-09 21:29:46,650 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 276 transitions, 564 flow [2025-01-09 21:29:46,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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) [2025-01-09 21:29:46,650 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,650 INFO L206 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] [2025-01-09 21:29:46,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:46,651 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:46,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,651 INFO L85 PathProgramCache]: Analyzing trace with hash 771072117, now seen corresponding path program 1 times [2025-01-09 21:29:46,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245252360] [2025-01-09 21:29:46,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:46,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:29:46,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:29:46,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:46,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245252360] [2025-01-09 21:29:46,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245252360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:46,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738443073] [2025-01-09 21:29:46,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:46,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,686 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:46,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:46,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 307 [2025-01-09 21:29:46,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 276 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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) [2025-01-09 21:29:46,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 307 [2025-01-09 21:29:46,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:46,853 INFO L124 PetriNetUnfolderBase]: 31/401 cut-off events. [2025-01-09 21:29:46,857 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:29:46,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 401 events. 31/401 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1550 event pairs, 21 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 461. Up to 66 conditions per place. [2025-01-09 21:29:46,865 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 20 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-01-09 21:29:46,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 606 flow [2025-01-09 21:29:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:46,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:46,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-01-09 21:29:46,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239956568946797 [2025-01-09 21:29:46,870 INFO L175 Difference]: Start difference. First operand has 277 places, 276 transitions, 564 flow. Second operand 3 states and 851 transitions. [2025-01-09 21:29:46,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 606 flow [2025-01-09 21:29:46,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:46,874 INFO L231 Difference]: Finished difference. Result has 275 places, 275 transitions, 562 flow [2025-01-09 21:29:46,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2025-01-09 21:29:46,875 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -9 predicate places. [2025-01-09 21:29:46,875 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 562 flow [2025-01-09 21:29:46,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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) [2025-01-09 21:29:46,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:46,876 INFO L206 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] [2025-01-09 21:29:46,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:46,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:46,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:46,877 INFO L85 PathProgramCache]: Analyzing trace with hash 655564715, now seen corresponding path program 1 times [2025-01-09 21:29:46,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:46,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404167579] [2025-01-09 21:29:46,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:46,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:46,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-01-09 21:29:46,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-01-09 21:29:46,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:46,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:46,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:46,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:46,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404167579] [2025-01-09 21:29:46,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404167579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:46,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:46,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:46,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643877654] [2025-01-09 21:29:46,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:46,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:46,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:46,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:46,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:46,970 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 307 [2025-01-09 21:29:46,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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) [2025-01-09 21:29:46,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:46,971 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 307 [2025-01-09 21:29:46,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,017 INFO L124 PetriNetUnfolderBase]: 31/373 cut-off events. [2025-01-09 21:29:47,018 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:29:47,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 373 events. 31/373 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1323 event pairs, 21 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 420. Up to 67 conditions per place. [2025-01-09 21:29:47,022 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-01-09 21:29:47,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 274 transitions, 606 flow [2025-01-09 21:29:47,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2025-01-09 21:29:47,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218241042345277 [2025-01-09 21:29:47,024 INFO L175 Difference]: Start difference. First operand has 275 places, 275 transitions, 562 flow. Second operand 3 states and 849 transitions. [2025-01-09 21:29:47,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 274 transitions, 606 flow [2025-01-09 21:29:47,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 274 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,027 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 560 flow [2025-01-09 21:29:47,028 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2025-01-09 21:29:47,028 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -10 predicate places. [2025-01-09 21:29:47,028 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 560 flow [2025-01-09 21:29:47,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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) [2025-01-09 21:29:47,029 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,029 INFO L206 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] [2025-01-09 21:29:47,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:47,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:47,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1377475776, now seen corresponding path program 1 times [2025-01-09 21:29:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79960374] [2025-01-09 21:29:47,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:29:47,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:29:47,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:47,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79960374] [2025-01-09 21:29:47,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79960374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774997240] [2025-01-09 21:29:47,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 307 [2025-01-09 21:29:47,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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) [2025-01-09 21:29:47,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 307 [2025-01-09 21:29:47,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,233 INFO L124 PetriNetUnfolderBase]: 31/345 cut-off events. [2025-01-09 21:29:47,233 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:29:47,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 345 events. 31/345 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1111 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 377. Up to 66 conditions per place. [2025-01-09 21:29:47,240 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 20 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-01-09 21:29:47,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 273 transitions, 602 flow [2025-01-09 21:29:47,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-01-09 21:29:47,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239956568946797 [2025-01-09 21:29:47,246 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 560 flow. Second operand 3 states and 851 transitions. [2025-01-09 21:29:47,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 273 transitions, 602 flow [2025-01-09 21:29:47,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 273 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,287 INFO L231 Difference]: Finished difference. Result has 273 places, 273 transitions, 558 flow [2025-01-09 21:29:47,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=273, PETRI_TRANSITIONS=273} [2025-01-09 21:29:47,288 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -11 predicate places. [2025-01-09 21:29:47,288 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 273 transitions, 558 flow [2025-01-09 21:29:47,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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) [2025-01-09 21:29:47,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,288 INFO L206 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] [2025-01-09 21:29:47,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:47,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:47,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,289 INFO L85 PathProgramCache]: Analyzing trace with hash 875088055, now seen corresponding path program 1 times [2025-01-09 21:29:47,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035782942] [2025-01-09 21:29:47,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:29:47,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:29:47,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:47,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035782942] [2025-01-09 21:29:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035782942] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35909980] [2025-01-09 21:29:47,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 307 [2025-01-09 21:29:47,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 273 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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) [2025-01-09 21:29:47,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,373 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 307 [2025-01-09 21:29:47,373 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,684 INFO L124 PetriNetUnfolderBase]: 102/1390 cut-off events. [2025-01-09 21:29:47,685 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:29:47,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 1390 events. 102/1390 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10374 event pairs, 51 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1504. Up to 144 conditions per place. [2025-01-09 21:29:47,701 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 15 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-01-09 21:29:47,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 272 transitions, 590 flow [2025-01-09 21:29:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-01-09 21:29:47,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9348534201954397 [2025-01-09 21:29:47,704 INFO L175 Difference]: Start difference. First operand has 273 places, 273 transitions, 558 flow. Second operand 3 states and 861 transitions. [2025-01-09 21:29:47,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 272 transitions, 590 flow [2025-01-09 21:29:47,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 272 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,707 INFO L231 Difference]: Finished difference. Result has 272 places, 272 transitions, 556 flow [2025-01-09 21:29:47,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=272, PETRI_TRANSITIONS=272} [2025-01-09 21:29:47,708 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -12 predicate places. [2025-01-09 21:29:47,708 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 272 transitions, 556 flow [2025-01-09 21:29:47,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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) [2025-01-09 21:29:47,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,709 INFO L206 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] [2025-01-09 21:29:47,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:29:47,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:47,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash -313154742, now seen corresponding path program 1 times [2025-01-09 21:29:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968052411] [2025-01-09 21:29:47,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-01-09 21:29:47,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-01-09 21:29:47,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:47,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968052411] [2025-01-09 21:29:47,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968052411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064764881] [2025-01-09 21:29:47,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 307 [2025-01-09 21:29:47,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 272 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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) [2025-01-09 21:29:47,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 307 [2025-01-09 21:29:47,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,830 INFO L124 PetriNetUnfolderBase]: 46/391 cut-off events. [2025-01-09 21:29:47,831 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:29:47,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 391 events. 46/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1682 event pairs, 30 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 481. Up to 88 conditions per place. [2025-01-09 21:29:47,836 INFO L140 encePairwiseOnDemand]: 294/307 looper letters, 26 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2025-01-09 21:29:47,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 268 transitions, 613 flow [2025-01-09 21:29:47,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:47,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2025-01-09 21:29:47,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055374592833876 [2025-01-09 21:29:47,838 INFO L175 Difference]: Start difference. First operand has 272 places, 272 transitions, 556 flow. Second operand 3 states and 834 transitions. [2025-01-09 21:29:47,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 268 transitions, 613 flow [2025-01-09 21:29:47,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 268 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:47,843 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 555 flow [2025-01-09 21:29:47,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-01-09 21:29:47,843 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -19 predicate places. [2025-01-09 21:29:47,843 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 555 flow [2025-01-09 21:29:47,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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) [2025-01-09 21:29:47,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:47,844 INFO L206 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] [2025-01-09 21:29:47,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:29:47,844 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:47,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:47,845 INFO L85 PathProgramCache]: Analyzing trace with hash -293982780, now seen corresponding path program 1 times [2025-01-09 21:29:47,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:47,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984678784] [2025-01-09 21:29:47,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:47,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:47,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:29:47,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:29:47,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:47,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:47,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:47,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984678784] [2025-01-09 21:29:47,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984678784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:47,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:47,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:47,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531217160] [2025-01-09 21:29:47,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:47,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:47,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:47,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:47,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:47,925 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 307 [2025-01-09 21:29:47,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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) [2025-01-09 21:29:47,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:47,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 307 [2025-01-09 21:29:47,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:47,995 INFO L124 PetriNetUnfolderBase]: 46/385 cut-off events. [2025-01-09 21:29:47,995 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:29:47,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 385 events. 46/385 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1605 event pairs, 30 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 446. Up to 86 conditions per place. [2025-01-09 21:29:48,001 INFO L140 encePairwiseOnDemand]: 295/307 looper letters, 24 selfloop transitions, 5 changer transitions 0/262 dead transitions. [2025-01-09 21:29:48,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 262 transitions, 610 flow [2025-01-09 21:29:48,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2025-01-09 21:29:48,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9120521172638436 [2025-01-09 21:29:48,003 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 555 flow. Second operand 3 states and 840 transitions. [2025-01-09 21:29:48,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 262 transitions, 610 flow [2025-01-09 21:29:48,005 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 262 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:48,007 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 555 flow [2025-01-09 21:29:48,008 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2025-01-09 21:29:48,009 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -24 predicate places. [2025-01-09 21:29:48,009 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 555 flow [2025-01-09 21:29:48,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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) [2025-01-09 21:29:48,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,010 INFO L206 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] [2025-01-09 21:29:48,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:29:48,010 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:48,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,010 INFO L85 PathProgramCache]: Analyzing trace with hash -673827190, now seen corresponding path program 1 times [2025-01-09 21:29:48,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393202670] [2025-01-09 21:29:48,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:29:48,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:29:48,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:48,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393202670] [2025-01-09 21:29:48,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393202670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956132869] [2025-01-09 21:29:48,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 307 [2025-01-09 21:29:48,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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) [2025-01-09 21:29:48,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,105 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 307 [2025-01-09 21:29:48,105 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:48,181 INFO L124 PetriNetUnfolderBase]: 54/534 cut-off events. [2025-01-09 21:29:48,182 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-01-09 21:29:48,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 534 events. 54/534 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 2627 event pairs, 21 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 593. Up to 92 conditions per place. [2025-01-09 21:29:48,192 INFO L140 encePairwiseOnDemand]: 293/307 looper letters, 29 selfloop transitions, 6 changer transitions 0/259 dead transitions. [2025-01-09 21:29:48,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 259 transitions, 631 flow [2025-01-09 21:29:48,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:48,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-01-09 21:29:48,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098805646036916 [2025-01-09 21:29:48,194 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 555 flow. Second operand 3 states and 838 transitions. [2025-01-09 21:29:48,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 259 transitions, 631 flow [2025-01-09 21:29:48,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 259 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:48,198 INFO L231 Difference]: Finished difference. Result has 254 places, 253 transitions, 560 flow [2025-01-09 21:29:48,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=254, PETRI_TRANSITIONS=253} [2025-01-09 21:29:48,201 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -30 predicate places. [2025-01-09 21:29:48,201 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 253 transitions, 560 flow [2025-01-09 21:29:48,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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) [2025-01-09 21:29:48,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,201 INFO L206 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] [2025-01-09 21:29:48,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:29:48,203 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:48,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,204 INFO L85 PathProgramCache]: Analyzing trace with hash 992153761, now seen corresponding path program 1 times [2025-01-09 21:29:48,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292331484] [2025-01-09 21:29:48,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:29:48,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:29:48,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:48,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292331484] [2025-01-09 21:29:48,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292331484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:29:48,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287423701] [2025-01-09 21:29:48,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:29:48,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:29:48,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:29:48,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 307 [2025-01-09 21:29:48,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 253 transitions, 560 flow. Second operand has 4 states, 4 states have (on average 281.25) internal successors, (1125), 4 states have internal predecessors, (1125), 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) [2025-01-09 21:29:48,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 307 [2025-01-09 21:29:48,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:48,367 INFO L124 PetriNetUnfolderBase]: 12/421 cut-off events. [2025-01-09 21:29:48,368 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:29:48,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 421 events. 12/421 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1569 event pairs, 0 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 352. Up to 26 conditions per place. [2025-01-09 21:29:48,371 INFO L140 encePairwiseOnDemand]: 301/307 looper letters, 19 selfloop transitions, 5 changer transitions 0/258 dead transitions. [2025-01-09 21:29:48,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 258 transitions, 618 flow [2025-01-09 21:29:48,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:29:48,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:29:48,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1425 transitions. [2025-01-09 21:29:48,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-01-09 21:29:48,373 INFO L175 Difference]: Start difference. First operand has 254 places, 253 transitions, 560 flow. Second operand 5 states and 1425 transitions. [2025-01-09 21:29:48,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 258 transitions, 618 flow [2025-01-09 21:29:48,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 258 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:48,377 INFO L231 Difference]: Finished difference. Result has 261 places, 257 transitions, 592 flow [2025-01-09 21:29:48,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=592, PETRI_PLACES=261, PETRI_TRANSITIONS=257} [2025-01-09 21:29:48,378 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -23 predicate places. [2025-01-09 21:29:48,379 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 257 transitions, 592 flow [2025-01-09 21:29:48,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.25) internal successors, (1125), 4 states have internal predecessors, (1125), 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) [2025-01-09 21:29:48,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,380 INFO L206 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] [2025-01-09 21:29:48,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:29:48,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:48,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1298569842, now seen corresponding path program 1 times [2025-01-09 21:29:48,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738549948] [2025-01-09 21:29:48,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:29:48,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:29:48,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:48,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738549948] [2025-01-09 21:29:48,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738549948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262549840] [2025-01-09 21:29:48,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 307 [2025-01-09 21:29:48,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 257 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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) [2025-01-09 21:29:48,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 307 [2025-01-09 21:29:48,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:48,535 INFO L124 PetriNetUnfolderBase]: 83/727 cut-off events. [2025-01-09 21:29:48,535 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-01-09 21:29:48,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 727 events. 83/727 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4146 event pairs, 10 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 703. Up to 140 conditions per place. [2025-01-09 21:29:48,540 INFO L140 encePairwiseOnDemand]: 295/307 looper letters, 25 selfloop transitions, 5 changer transitions 10/258 dead transitions. [2025-01-09 21:29:48,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 258 transitions, 665 flow [2025-01-09 21:29:48,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:48,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2025-01-09 21:29:48,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9153094462540716 [2025-01-09 21:29:48,542 INFO L175 Difference]: Start difference. First operand has 261 places, 257 transitions, 592 flow. Second operand 3 states and 843 transitions. [2025-01-09 21:29:48,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 258 transitions, 665 flow [2025-01-09 21:29:48,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 258 transitions, 665 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:48,546 INFO L231 Difference]: Finished difference. Result has 257 places, 241 transitions, 576 flow [2025-01-09 21:29:48,546 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=257, PETRI_TRANSITIONS=241} [2025-01-09 21:29:48,547 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -27 predicate places. [2025-01-09 21:29:48,547 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 241 transitions, 576 flow [2025-01-09 21:29:48,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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) [2025-01-09 21:29:48,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:48,547 INFO L206 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] [2025-01-09 21:29:48,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:29:48,548 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:48,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1557513379, now seen corresponding path program 1 times [2025-01-09 21:29:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162150724] [2025-01-09 21:29:48,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:48,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:29:48,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:29:48,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:48,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:48,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:48,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:48,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162150724] [2025-01-09 21:29:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162150724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157457896] [2025-01-09 21:29:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:48,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:48,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:48,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:48,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 307 [2025-01-09 21:29:48,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 241 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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) [2025-01-09 21:29:48,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:48,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 307 [2025-01-09 21:29:48,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,107 INFO L124 PetriNetUnfolderBase]: 746/5762 cut-off events. [2025-01-09 21:29:49,107 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-01-09 21:29:49,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 5762 events. 746/5762 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 65093 event pairs, 276 based on Foata normal form. 0/5092 useless extension candidates. Maximal degree in co-relation 5800. Up to 1027 conditions per place. [2025-01-09 21:29:49,149 INFO L140 encePairwiseOnDemand]: 299/307 looper letters, 19 selfloop transitions, 4 changer transitions 0/244 dead transitions. [2025-01-09 21:29:49,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 244 transitions, 631 flow [2025-01-09 21:29:49,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-01-09 21:29:49,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9381107491856677 [2025-01-09 21:29:49,150 INFO L175 Difference]: Start difference. First operand has 257 places, 241 transitions, 576 flow. Second operand 3 states and 864 transitions. [2025-01-09 21:29:49,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 244 transitions, 631 flow [2025-01-09 21:29:49,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 244 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:49,156 INFO L231 Difference]: Finished difference. Result has 245 places, 241 transitions, 591 flow [2025-01-09 21:29:49,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=245, PETRI_TRANSITIONS=241} [2025-01-09 21:29:49,157 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -39 predicate places. [2025-01-09 21:29:49,157 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 241 transitions, 591 flow [2025-01-09 21:29:49,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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) [2025-01-09 21:29:49,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,158 INFO L206 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] [2025-01-09 21:29:49,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:29:49,158 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:49,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1545275887, now seen corresponding path program 1 times [2025-01-09 21:29:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523149611] [2025-01-09 21:29:49,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:29:49,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:29:49,166 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:49,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523149611] [2025-01-09 21:29:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523149611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795616357] [2025-01-09 21:29:49,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,189 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-01-09 21:29:49,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 241 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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) [2025-01-09 21:29:49,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-01-09 21:29:49,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,384 INFO L124 PetriNetUnfolderBase]: 230/1820 cut-off events. [2025-01-09 21:29:49,384 INFO L125 PetriNetUnfolderBase]: For 47/59 co-relation queries the response was YES. [2025-01-09 21:29:49,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 1820 events. 230/1820 cut-off events. For 47/59 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15410 event pairs, 91 based on Foata normal form. 0/1631 useless extension candidates. Maximal degree in co-relation 1755. Up to 213 conditions per place. [2025-01-09 21:29:49,400 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 22 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-01-09 21:29:49,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 646 flow [2025-01-09 21:29:49,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:29:49,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-01-09 21:29:49,402 INFO L175 Difference]: Start difference. First operand has 245 places, 241 transitions, 591 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:29:49,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 646 flow [2025-01-09 21:29:49,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 243 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:29:49,405 INFO L231 Difference]: Finished difference. Result has 246 places, 240 transitions, 593 flow [2025-01-09 21:29:49,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=246, PETRI_TRANSITIONS=240} [2025-01-09 21:29:49,406 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -38 predicate places. [2025-01-09 21:29:49,406 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 240 transitions, 593 flow [2025-01-09 21:29:49,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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) [2025-01-09 21:29:49,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,406 INFO L206 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] [2025-01-09 21:29:49,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:29:49,406 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:49,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1202388184, now seen corresponding path program 1 times [2025-01-09 21:29:49,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614576366] [2025-01-09 21:29:49,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:29:49,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:29:49,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614576366] [2025-01-09 21:29:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614576366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216070901] [2025-01-09 21:29:49,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,480 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-01-09 21:29:49,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 240 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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) [2025-01-09 21:29:49,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-01-09 21:29:49,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,734 INFO L124 PetriNetUnfolderBase]: 377/2292 cut-off events. [2025-01-09 21:29:49,734 INFO L125 PetriNetUnfolderBase]: For 171/179 co-relation queries the response was YES. [2025-01-09 21:29:49,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3547 conditions, 2292 events. 377/2292 cut-off events. For 171/179 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20710 event pairs, 184 based on Foata normal form. 0/2081 useless extension candidates. Maximal degree in co-relation 3418. Up to 454 conditions per place. [2025-01-09 21:29:49,752 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2025-01-09 21:29:49,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 242 transitions, 646 flow [2025-01-09 21:29:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-01-09 21:29:49,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-01-09 21:29:49,754 INFO L175 Difference]: Start difference. First operand has 246 places, 240 transitions, 593 flow. Second operand 3 states and 857 transitions. [2025-01-09 21:29:49,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 242 transitions, 646 flow [2025-01-09 21:29:49,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 242 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:49,757 INFO L231 Difference]: Finished difference. Result has 245 places, 239 transitions, 591 flow [2025-01-09 21:29:49,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=245, PETRI_TRANSITIONS=239} [2025-01-09 21:29:49,757 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -39 predicate places. [2025-01-09 21:29:49,758 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 239 transitions, 591 flow [2025-01-09 21:29:49,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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) [2025-01-09 21:29:49,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,758 INFO L206 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] [2025-01-09 21:29:49,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:29:49,758 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:49,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,759 INFO L85 PathProgramCache]: Analyzing trace with hash 303032490, now seen corresponding path program 1 times [2025-01-09 21:29:49,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037495135] [2025-01-09 21:29:49,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:29:49,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:29:49,766 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:49,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:49,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:49,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037495135] [2025-01-09 21:29:49,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037495135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:49,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:49,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:49,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511270816] [2025-01-09 21:29:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:49,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:49,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:49,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:49,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:49,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-01-09 21:29:49,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 239 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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) [2025-01-09 21:29:49,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:49,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-01-09 21:29:49,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:49,957 INFO L124 PetriNetUnfolderBase]: 230/1796 cut-off events. [2025-01-09 21:29:49,957 INFO L125 PetriNetUnfolderBase]: For 59/68 co-relation queries the response was YES. [2025-01-09 21:29:49,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 1796 events. 230/1796 cut-off events. For 59/68 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 15138 event pairs, 91 based on Foata normal form. 0/1631 useless extension candidates. Maximal degree in co-relation 2319. Up to 213 conditions per place. [2025-01-09 21:29:49,974 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 22 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-01-09 21:29:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 241 transitions, 646 flow [2025-01-09 21:29:49,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:29:49,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-01-09 21:29:49,976 INFO L175 Difference]: Start difference. First operand has 245 places, 239 transitions, 591 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:29:49,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 241 transitions, 646 flow [2025-01-09 21:29:49,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 241 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:49,980 INFO L231 Difference]: Finished difference. Result has 244 places, 238 transitions, 589 flow [2025-01-09 21:29:49,980 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=244, PETRI_TRANSITIONS=238} [2025-01-09 21:29:49,981 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -40 predicate places. [2025-01-09 21:29:49,981 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 238 transitions, 589 flow [2025-01-09 21:29:49,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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) [2025-01-09 21:29:49,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:49,981 INFO L206 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] [2025-01-09 21:29:49,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:29:49,982 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:49,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:49,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2004174885, now seen corresponding path program 1 times [2025-01-09 21:29:49,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:49,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583745811] [2025-01-09 21:29:49,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:49,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 21:29:49,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 21:29:49,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:49,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:50,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:50,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:50,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583745811] [2025-01-09 21:29:50,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583745811] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:50,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:50,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:50,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855953946] [2025-01-09 21:29:50,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:50,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:50,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:50,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:50,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:50,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-01-09 21:29:50,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 238 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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) [2025-01-09 21:29:50,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:50,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-01-09 21:29:50,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:50,246 INFO L124 PetriNetUnfolderBase]: 267/1786 cut-off events. [2025-01-09 21:29:50,246 INFO L125 PetriNetUnfolderBase]: For 149/152 co-relation queries the response was YES. [2025-01-09 21:29:50,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2694 conditions, 1786 events. 267/1786 cut-off events. For 149/152 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 14655 event pairs, 119 based on Foata normal form. 0/1629 useless extension candidates. Maximal degree in co-relation 2615. Up to 328 conditions per place. [2025-01-09 21:29:50,264 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 23 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2025-01-09 21:29:50,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 240 transitions, 646 flow [2025-01-09 21:29:50,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:29:50,267 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-01-09 21:29:50,267 INFO L175 Difference]: Start difference. First operand has 244 places, 238 transitions, 589 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:29:50,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 240 transitions, 646 flow [2025-01-09 21:29:50,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 240 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:50,271 INFO L231 Difference]: Finished difference. Result has 243 places, 237 transitions, 587 flow [2025-01-09 21:29:50,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=587, PETRI_PLACES=243, PETRI_TRANSITIONS=237} [2025-01-09 21:29:50,271 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -41 predicate places. [2025-01-09 21:29:50,271 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 237 transitions, 587 flow [2025-01-09 21:29:50,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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) [2025-01-09 21:29:50,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:50,272 INFO L206 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] [2025-01-09 21:29:50,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:29:50,272 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:50,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1585262005, now seen corresponding path program 1 times [2025-01-09 21:29:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:50,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171076668] [2025-01-09 21:29:50,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:50,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:29:50,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:29:50,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:50,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:50,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:50,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:50,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171076668] [2025-01-09 21:29:50,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171076668] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:50,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:50,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:50,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288496160] [2025-01-09 21:29:50,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:50,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:50,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:50,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:50,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:50,335 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-01-09 21:29:50,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 237 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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) [2025-01-09 21:29:50,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:50,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-01-09 21:29:50,336 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:50,612 INFO L124 PetriNetUnfolderBase]: 389/2319 cut-off events. [2025-01-09 21:29:50,612 INFO L125 PetriNetUnfolderBase]: For 180/186 co-relation queries the response was YES. [2025-01-09 21:29:50,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3620 conditions, 2319 events. 389/2319 cut-off events. For 180/186 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 20578 event pairs, 184 based on Foata normal form. 0/2150 useless extension candidates. Maximal degree in co-relation 3264. Up to 454 conditions per place. [2025-01-09 21:29:50,643 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2025-01-09 21:29:50,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 239 transitions, 640 flow [2025-01-09 21:29:50,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:50,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:50,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-01-09 21:29:50,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-01-09 21:29:50,646 INFO L175 Difference]: Start difference. First operand has 243 places, 237 transitions, 587 flow. Second operand 3 states and 857 transitions. [2025-01-09 21:29:50,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 239 transitions, 640 flow [2025-01-09 21:29:50,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 239 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:50,651 INFO L231 Difference]: Finished difference. Result has 242 places, 236 transitions, 585 flow [2025-01-09 21:29:50,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=242, PETRI_TRANSITIONS=236} [2025-01-09 21:29:50,651 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -42 predicate places. [2025-01-09 21:29:50,651 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 236 transitions, 585 flow [2025-01-09 21:29:50,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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) [2025-01-09 21:29:50,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:50,652 INFO L206 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] [2025-01-09 21:29:50,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:29:50,652 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:50,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:50,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1367389428, now seen corresponding path program 1 times [2025-01-09 21:29:50,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:50,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636284501] [2025-01-09 21:29:50,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:50,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:50,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:29:50,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:29:50,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:50,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:50,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:50,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:50,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636284501] [2025-01-09 21:29:50,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636284501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:50,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:50,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:50,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664233734] [2025-01-09 21:29:50,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:50,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:50,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:50,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:50,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:50,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-01-09 21:29:50,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 236 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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) [2025-01-09 21:29:50,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:50,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-01-09 21:29:50,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:50,837 INFO L124 PetriNetUnfolderBase]: 160/1386 cut-off events. [2025-01-09 21:29:50,837 INFO L125 PetriNetUnfolderBase]: For 114/121 co-relation queries the response was YES. [2025-01-09 21:29:50,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1987 conditions, 1386 events. 160/1386 cut-off events. For 114/121 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 10294 event pairs, 54 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 1829. Up to 180 conditions per place. [2025-01-09 21:29:50,850 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-01-09 21:29:50,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 638 flow [2025-01-09 21:29:50,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-01-09 21:29:50,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-01-09 21:29:50,852 INFO L175 Difference]: Start difference. First operand has 242 places, 236 transitions, 585 flow. Second operand 3 states and 857 transitions. [2025-01-09 21:29:50,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 238 transitions, 638 flow [2025-01-09 21:29:50,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 238 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:50,855 INFO L231 Difference]: Finished difference. Result has 241 places, 235 transitions, 583 flow [2025-01-09 21:29:50,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=241, PETRI_TRANSITIONS=235} [2025-01-09 21:29:50,856 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -43 predicate places. [2025-01-09 21:29:50,856 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 235 transitions, 583 flow [2025-01-09 21:29:50,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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) [2025-01-09 21:29:50,856 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:50,856 INFO L206 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] [2025-01-09 21:29:50,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:29:50,857 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:50,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -1222433924, now seen corresponding path program 1 times [2025-01-09 21:29:50,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:50,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340632222] [2025-01-09 21:29:50,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:50,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-09 21:29:50,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 21:29:50,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:50,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:50,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:50,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:50,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340632222] [2025-01-09 21:29:50,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340632222] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:50,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:50,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:50,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435826260] [2025-01-09 21:29:50,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:50,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:50,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:50,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:50,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:50,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-01-09 21:29:50,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 235 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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) [2025-01-09 21:29:50,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:50,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-01-09 21:29:50,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,078 INFO L124 PetriNetUnfolderBase]: 267/1729 cut-off events. [2025-01-09 21:29:51,078 INFO L125 PetriNetUnfolderBase]: For 152/155 co-relation queries the response was YES. [2025-01-09 21:29:51,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 1729 events. 267/1729 cut-off events. For 152/155 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 13901 event pairs, 119 based on Foata normal form. 0/1617 useless extension candidates. Maximal degree in co-relation 2418. Up to 328 conditions per place. [2025-01-09 21:29:51,096 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 23 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-01-09 21:29:51,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 237 transitions, 640 flow [2025-01-09 21:29:51,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-01-09 21:29:51,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-01-09 21:29:51,098 INFO L175 Difference]: Start difference. First operand has 241 places, 235 transitions, 583 flow. Second operand 3 states and 855 transitions. [2025-01-09 21:29:51,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 237 transitions, 640 flow [2025-01-09 21:29:51,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 237 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:51,101 INFO L231 Difference]: Finished difference. Result has 240 places, 234 transitions, 581 flow [2025-01-09 21:29:51,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=240, PETRI_TRANSITIONS=234} [2025-01-09 21:29:51,102 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -44 predicate places. [2025-01-09 21:29:51,102 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 234 transitions, 581 flow [2025-01-09 21:29:51,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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) [2025-01-09 21:29:51,102 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:51,103 INFO L206 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] [2025-01-09 21:29:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:29:51,103 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread4Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-01-09 21:29:51,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1581736527, now seen corresponding path program 1 times [2025-01-09 21:29:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:51,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185083653] [2025-01-09 21:29:51,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:51,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-01-09 21:29:51,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-01-09 21:29:51,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:51,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:51,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:51,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185083653] [2025-01-09 21:29:51,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185083653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:51,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:51,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:51,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723657906] [2025-01-09 21:29:51,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:51,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:51,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:51,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:51,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:51,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-01-09 21:29:51,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 234 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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) [2025-01-09 21:29:51,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:51,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-01-09 21:29:51,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:51,267 INFO L124 PetriNetUnfolderBase]: 160/1364 cut-off events. [2025-01-09 21:29:51,267 INFO L125 PetriNetUnfolderBase]: For 113/117 co-relation queries the response was YES. [2025-01-09 21:29:51,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1963 conditions, 1364 events. 160/1364 cut-off events. For 113/117 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10041 event pairs, 54 based on Foata normal form. 0/1277 useless extension candidates. Maximal degree in co-relation 1824. Up to 180 conditions per place. [2025-01-09 21:29:51,277 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 0 selfloop transitions, 0 changer transitions 236/236 dead transitions. [2025-01-09 21:29:51,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 236 transitions, 634 flow [2025-01-09 21:29:51,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:51,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-01-09 21:29:51,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-01-09 21:29:51,279 INFO L175 Difference]: Start difference. First operand has 240 places, 234 transitions, 581 flow. Second operand 3 states and 857 transitions. [2025-01-09 21:29:51,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 236 transitions, 634 flow [2025-01-09 21:29:51,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 236 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:51,282 INFO L231 Difference]: Finished difference. Result has 239 places, 0 transitions, 0 flow [2025-01-09 21:29:51,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=239, PETRI_TRANSITIONS=0} [2025-01-09 21:29:51,283 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -45 predicate places. [2025-01-09 21:29:51,283 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 0 transitions, 0 flow [2025-01-09 21:29:51,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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) [2025-01-09 21:29:51,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2025-01-09 21:29:51,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2025-01-09 21:29:51,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2025-01-09 21:29:51,285 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2025-01-09 21:29:51,286 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (35 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (34 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (33 of 83 remaining) [2025-01-09 21:29:51,287 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2025-01-09 21:29:51,288 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2025-01-09 21:29:51,289 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2025-01-09 21:29:51,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:29:51,290 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:29:51,294 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:29:51,294 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:29:51,297 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:29:51 BasicIcfg [2025-01-09 21:29:51,297 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:29:51,298 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:29:51,298 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:29:51,298 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:29:51,299 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:46" (3/4) ... [2025-01-09 21:29:51,300 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:29:51,302 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:29:51,302 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:29:51,302 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:29:51,302 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-01-09 21:29:51,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-01-09 21:29:51,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:29:51,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-09 21:29:51,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:29:51,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:29:51,362 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:29:51,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:29:51,362 INFO L158 Benchmark]: Toolchain (without parser) took 5980.37ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 109.8MB in the beginning and 332.0MB in the end (delta: -222.2MB). Peak memory consumption was 205.7MB. Max. memory is 16.1GB. [2025-01-09 21:29:51,363 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:29:51,363 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.59ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 97.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:51,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 96.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:51,363 INFO L158 Benchmark]: Boogie Preprocessor took 31.47ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:29:51,363 INFO L158 Benchmark]: RCFGBuilder took 392.15ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 73.6MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:29:51,364 INFO L158 Benchmark]: TraceAbstraction took 5257.33ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 73.6MB in the beginning and 336.4MB in the end (delta: -262.9MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. [2025-01-09 21:29:51,364 INFO L158 Benchmark]: Witness Printer took 63.91ms. Allocated memory is still 570.4MB. Free memory was 336.4MB in the beginning and 332.0MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:29:51,365 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.20ms. Allocated memory is still 226.5MB. Free memory is still 148.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 202.59ms. Allocated memory is still 142.6MB. Free memory was 109.8MB in the beginning and 97.8MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.60ms. Allocated memory is still 142.6MB. Free memory was 97.8MB in the beginning and 96.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.47ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 95.2MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 392.15ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 73.6MB in the end (delta: 21.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5257.33ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 73.6MB in the beginning and 336.4MB in the end (delta: -262.9MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. * Witness Printer took 63.91ms. Allocated memory is still 570.4MB. Free memory was 336.4MB in the beginning and 332.0MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 438 locations, 83 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: 5.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1140 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 388 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1171 IncrementalHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 228 mSDtfsCounter, 1171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred in iteration=12, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1383 NumberOfCodeBlocks, 1383 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1364 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:29:51,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE