./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-poker-hand-symm.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/chl-poker-hand-symm.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 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:46,562 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:46,614 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:30:46,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:46,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:46,639 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:46,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:46,640 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:46,640 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:46,640 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:46,641 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:46,641 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:46,641 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:46,642 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:46,642 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:46,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:46,642 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:46,643 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:46,643 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 -> 6f8a234fc2a7dd634bd03f872a0d7e8707283ecf0f996c6ed729f53ab07d6660 [2025-01-09 21:30:46,867 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:46,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:46,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:46,875 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:46,875 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:46,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-poker-hand-symm.wvr.c [2025-01-09 21:30:48,023 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff38796e/5d3bd80b3c4e43e29e9b393b53881751/FLAGf06466e20 [2025-01-09 21:30:48,267 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:48,267 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-poker-hand-symm.wvr.c [2025-01-09 21:30:48,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff38796e/5d3bd80b3c4e43e29e9b393b53881751/FLAGf06466e20 [2025-01-09 21:30:48,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dff38796e/5d3bd80b3c4e43e29e9b393b53881751 [2025-01-09 21:30:48,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:48,591 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:48,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:48,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:48,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:48,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6981aeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48, skipping insertion in model container [2025-01-09 21:30:48,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:48,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:48,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:48,852 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:48,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:48,952 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:48,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48 WrapperNode [2025-01-09 21:30:48,955 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:48,955 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:48,955 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:48,956 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:48,961 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:30:48" (1/1) ... [2025-01-09 21:30:48,999 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:30:48" (1/1) ... [2025-01-09 21:30:49,102 INFO L138 Inliner]: procedures = 24, calls = 298, calls flagged for inlining = 70, calls inlined = 98, statements flattened = 3241 [2025-01-09 21:30:49,103 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:49,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:49,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:49,104 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:49,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,110 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,136 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,240 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,269 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,280 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,299 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:49,301 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:49,301 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:49,301 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:49,302 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (1/1) ... [2025-01-09 21:30:49,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:49,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:49,329 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:30:49,331 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:30:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:49,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:49,350 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:49,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:30:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:30:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:49,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:49,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:49,354 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:30:49,516 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:49,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:52,298 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:52,298 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:59,499 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:59,500 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:30:59,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:59 BoogieIcfgContainer [2025-01-09 21:30:59,500 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:59,502 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:59,502 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:59,505 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:59,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:48" (1/3) ... [2025-01-09 21:30:59,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46851ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:59, skipping insertion in model container [2025-01-09 21:30:59,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:48" (2/3) ... [2025-01-09 21:30:59,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46851ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:59, skipping insertion in model container [2025-01-09 21:30:59,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:59" (3/3) ... [2025-01-09 21:30:59,508 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-poker-hand-symm.wvr.c [2025-01-09 21:30:59,520 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:59,521 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-poker-hand-symm.wvr.c that has 3 procedures, 1062 locations, 1 initial locations, 12 loop locations, and 494 error locations. [2025-01-09 21:30:59,521 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:31:00,752 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:31:00,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1068 places, 1108 transitions, 2230 flow [2025-01-09 21:31:01,322 INFO L124 PetriNetUnfolderBase]: 47/1106 cut-off events. [2025-01-09 21:31:01,323 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:31:01,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1115 conditions, 1106 events. 47/1106 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 5121 event pairs, 0 based on Foata normal form. 0/565 useless extension candidates. Maximal degree in co-relation 764. Up to 7 conditions per place. [2025-01-09 21:31:01,343 INFO L82 GeneralOperation]: Start removeDead. Operand has 1068 places, 1108 transitions, 2230 flow [2025-01-09 21:31:01,375 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1046 places, 1084 transitions, 2180 flow [2025-01-09 21:31:01,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:31:01,395 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;@6d9f64d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:31:01,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 970 error locations. [2025-01-09 21:31:01,403 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:31:01,404 INFO L124 PetriNetUnfolderBase]: 2/70 cut-off events. [2025-01-09 21:31:01,404 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:31:01,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:01,405 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] [2025-01-09 21:31:01,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:31:01,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:01,409 INFO L85 PathProgramCache]: Analyzing trace with hash -2077097591, now seen corresponding path program 1 times [2025-01-09 21:31:01,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:01,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557017201] [2025-01-09 21:31:01,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:01,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:01,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:31:01,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:31:01,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:01,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:01,701 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:31:01,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:01,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557017201] [2025-01-09 21:31:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557017201] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:01,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244121048] [2025-01-09 21:31:01,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:01,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:01,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:01,728 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:01,728 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:01,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:31:01,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1046 places, 1084 transitions, 2180 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:01,745 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:01,745 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:31:01,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:08,325 INFO L124 PetriNetUnfolderBase]: 104/813 cut-off events. [2025-01-09 21:31:08,326 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-01-09 21:31:08,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 957 conditions, 813 events. 104/813 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1993 event pairs, 15 based on Foata normal form. 36/740 useless extension candidates. Maximal degree in co-relation 525. Up to 124 conditions per place. [2025-01-09 21:31:08,332 INFO L140 encePairwiseOnDemand]: 611/1108 looper letters, 29 selfloop transitions, 2 changer transitions 16/589 dead transitions. [2025-01-09 21:31:08,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 589 transitions, 1252 flow [2025-01-09 21:31:08,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:08,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2263 transitions. [2025-01-09 21:31:08,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6808062575210589 [2025-01-09 21:31:08,356 INFO L175 Difference]: Start difference. First operand has 1046 places, 1084 transitions, 2180 flow. Second operand 3 states and 2263 transitions. [2025-01-09 21:31:08,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 589 transitions, 1252 flow [2025-01-09 21:31:08,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 589 transitions, 1244 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:31:08,375 INFO L231 Difference]: Finished difference. Result has 569 places, 573 transitions, 1154 flow [2025-01-09 21:31:08,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1154, PETRI_PLACES=569, PETRI_TRANSITIONS=573} [2025-01-09 21:31:08,384 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -477 predicate places. [2025-01-09 21:31:08,385 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 573 transitions, 1154 flow [2025-01-09 21:31:08,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:08,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:08,386 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] [2025-01-09 21:31:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:31:08,386 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:31:08,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -839397746, now seen corresponding path program 1 times [2025-01-09 21:31:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089875486] [2025-01-09 21:31:08,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:08,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:08,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:31:08,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:31:08,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:08,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:09,000 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:31:09,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:09,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089875486] [2025-01-09 21:31:09,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089875486] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:09,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:09,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:31:09,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717856694] [2025-01-09 21:31:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:09,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:31:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:09,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:31:09,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:31:09,501 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 1108 [2025-01-09 21:31:09,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 573 transitions, 1154 flow. Second operand has 6 states, 6 states have (on average 475.5) internal successors, (2853), 6 states have internal predecessors, (2853), 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:31:09,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:09,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 1108 [2025-01-09 21:31:09,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:12,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:31:18,156 INFO L124 PetriNetUnfolderBase]: 104/789 cut-off events. [2025-01-09 21:31:18,156 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:18,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023 conditions, 789 events. 104/789 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1952 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 930. Up to 185 conditions per place. [2025-01-09 21:31:18,160 INFO L140 encePairwiseOnDemand]: 1060/1108 looper letters, 90 selfloop transitions, 40 changer transitions 0/565 dead transitions. [2025-01-09 21:31:18,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 565 transitions, 1398 flow [2025-01-09 21:31:18,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:18,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2982 transitions. [2025-01-09 21:31:18,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44855595667870035 [2025-01-09 21:31:18,171 INFO L175 Difference]: Start difference. First operand has 569 places, 573 transitions, 1154 flow. Second operand 6 states and 2982 transitions. [2025-01-09 21:31:18,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 565 transitions, 1398 flow [2025-01-09 21:31:18,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 548 places, 565 transitions, 1394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:18,179 INFO L231 Difference]: Finished difference. Result has 548 places, 565 transitions, 1214 flow [2025-01-09 21:31:18,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1134, PETRI_DIFFERENCE_MINUEND_PLACES=543, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=525, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1214, PETRI_PLACES=548, PETRI_TRANSITIONS=565} [2025-01-09 21:31:18,180 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -498 predicate places. [2025-01-09 21:31:18,180 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 565 transitions, 1214 flow [2025-01-09 21:31:18,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 475.5) internal successors, (2853), 6 states have internal predecessors, (2853), 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:31:18,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:18,182 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] [2025-01-09 21:31:18,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:31:18,182 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:31:18,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:18,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1854971659, now seen corresponding path program 1 times [2025-01-09 21:31:18,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:18,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902831067] [2025-01-09 21:31:18,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:18,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:18,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-09 21:31:18,240 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-09 21:31:18,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:18,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:18,272 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:31:18,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:18,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902831067] [2025-01-09 21:31:18,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902831067] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:18,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:18,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:18,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001737944] [2025-01-09 21:31:18,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:18,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:18,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:18,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:18,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:18,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:31:18,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 565 transitions, 1214 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:18,285 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:18,285 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:31:18,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,475 INFO L124 PetriNetUnfolderBase]: 104/788 cut-off events. [2025-01-09 21:31:25,475 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:25,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 788 events. 104/788 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1945 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 838. Up to 124 conditions per place. [2025-01-09 21:31:25,479 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-01-09 21:31:25,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 564 transitions, 1274 flow [2025-01-09 21:31:25,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:31:25,486 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321901323706378 [2025-01-09 21:31:25,486 INFO L175 Difference]: Start difference. First operand has 548 places, 565 transitions, 1214 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:31:25,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 564 transitions, 1274 flow [2025-01-09 21:31:25,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 564 transitions, 1194 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:25,493 INFO L231 Difference]: Finished difference. Result has 544 places, 564 transitions, 1136 flow [2025-01-09 21:31:25,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1132, PETRI_DIFFERENCE_MINUEND_PLACES=542, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1136, PETRI_PLACES=544, PETRI_TRANSITIONS=564} [2025-01-09 21:31:25,494 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -502 predicate places. [2025-01-09 21:31:25,494 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 564 transitions, 1136 flow [2025-01-09 21:31:25,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:25,495 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,496 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, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:25,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:31:25,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:31:25,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,497 INFO L85 PathProgramCache]: Analyzing trace with hash -2121654766, now seen corresponding path program 1 times [2025-01-09 21:31:25,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246274431] [2025-01-09 21:31:25,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:31:25,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:31:25,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,580 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:31:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246274431] [2025-01-09 21:31:25,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246274431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184955546] [2025-01-09 21:31:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,589 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:31:25,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 564 transitions, 1136 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:25,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:31:25,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:31,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:31:33,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:31:35,072 INFO L124 PetriNetUnfolderBase]: 104/787 cut-off events. [2025-01-09 21:31:35,072 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:35,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 922 conditions, 787 events. 104/787 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1950 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 794. Up to 124 conditions per place. [2025-01-09 21:31:35,075 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 2 changer transitions 0/563 dead transitions. [2025-01-09 21:31:35,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 545 places, 563 transitions, 1196 flow [2025-01-09 21:31:35,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:35,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:31:35,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321901323706378 [2025-01-09 21:31:35,083 INFO L175 Difference]: Start difference. First operand has 544 places, 564 transitions, 1136 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:31:35,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 545 places, 563 transitions, 1196 flow [2025-01-09 21:31:35,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 563 transitions, 1192 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:35,089 INFO L231 Difference]: Finished difference. Result has 543 places, 563 transitions, 1134 flow [2025-01-09 21:31:35,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1130, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1134, PETRI_PLACES=543, PETRI_TRANSITIONS=563} [2025-01-09 21:31:35,090 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -503 predicate places. [2025-01-09 21:31:35,090 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 563 transitions, 1134 flow [2025-01-09 21:31:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:35,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:35,091 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:35,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:31:35,091 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:31:35,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:35,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1894734254, now seen corresponding path program 1 times [2025-01-09 21:31:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:35,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439985183] [2025-01-09 21:31:35,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:35,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:35,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:31:35,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:31:35,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:35,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:35,182 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:31:35,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:35,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439985183] [2025-01-09 21:31:35,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439985183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:35,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:35,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:35,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902579693] [2025-01-09 21:31:35,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:35,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:35,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:35,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:35,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:35,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:31:35,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 563 transitions, 1134 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:35,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:35,196 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:31:35,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:37,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:31:42,344 INFO L124 PetriNetUnfolderBase]: 104/786 cut-off events. [2025-01-09 21:31:42,344 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:42,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 786 events. 104/786 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1930 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 746. Up to 124 conditions per place. [2025-01-09 21:31:42,347 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 2 changer transitions 0/562 dead transitions. [2025-01-09 21:31:42,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 562 transitions, 1194 flow [2025-01-09 21:31:42,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:42,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:42,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:31:42,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321901323706378 [2025-01-09 21:31:42,354 INFO L175 Difference]: Start difference. First operand has 543 places, 563 transitions, 1134 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:31:42,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 562 transitions, 1194 flow [2025-01-09 21:31:42,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 562 transitions, 1190 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:42,362 INFO L231 Difference]: Finished difference. Result has 542 places, 562 transitions, 1132 flow [2025-01-09 21:31:42,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1132, PETRI_PLACES=542, PETRI_TRANSITIONS=562} [2025-01-09 21:31:42,363 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -504 predicate places. [2025-01-09 21:31:42,364 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 562 transitions, 1132 flow [2025-01-09 21:31:42,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:42,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:42,366 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:42,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:31:42,366 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:31:42,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:42,366 INFO L85 PathProgramCache]: Analyzing trace with hash -647468259, now seen corresponding path program 1 times [2025-01-09 21:31:42,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:42,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486035167] [2025-01-09 21:31:42,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:42,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:42,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-01-09 21:31:42,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-01-09 21:31:42,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:42,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:42,448 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:31:42,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:42,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486035167] [2025-01-09 21:31:42,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486035167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:42,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:42,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793684123] [2025-01-09 21:31:42,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:42,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:42,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:42,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:42,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:31:42,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 562 transitions, 1132 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:42,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:42,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:31:42,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:47,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:31:49,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:31:51,493 INFO L124 PetriNetUnfolderBase]: 104/785 cut-off events. [2025-01-09 21:31:51,494 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:51,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 785 events. 104/785 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1930 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 698. Up to 124 conditions per place. [2025-01-09 21:31:51,496 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 2 changer transitions 0/561 dead transitions. [2025-01-09 21:31:51,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 561 transitions, 1192 flow [2025-01-09 21:31:51,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:51,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:31:51,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321901323706378 [2025-01-09 21:31:51,504 INFO L175 Difference]: Start difference. First operand has 542 places, 562 transitions, 1132 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:31:51,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 561 transitions, 1192 flow [2025-01-09 21:31:51,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 541 places, 561 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:51,510 INFO L231 Difference]: Finished difference. Result has 541 places, 561 transitions, 1130 flow [2025-01-09 21:31:51,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=561, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1130, PETRI_PLACES=541, PETRI_TRANSITIONS=561} [2025-01-09 21:31:51,513 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -505 predicate places. [2025-01-09 21:31:51,513 INFO L471 AbstractCegarLoop]: Abstraction has has 541 places, 561 transitions, 1130 flow [2025-01-09 21:31:51,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:51,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:51,514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:31:51,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:31:51,514 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:31:51,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:51,515 INFO L85 PathProgramCache]: Analyzing trace with hash 637651473, now seen corresponding path program 1 times [2025-01-09 21:31:51,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:51,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702398588] [2025-01-09 21:31:51,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:51,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:51,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 21:31:51,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 21:31:51,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:51,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:51,603 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:31:51,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:51,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702398588] [2025-01-09 21:31:51,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702398588] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:51,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:51,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:51,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132699703] [2025-01-09 21:31:51,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:51,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:51,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:51,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:51,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:51,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:31:51,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 541 places, 561 transitions, 1130 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:31:51,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:51,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:31:51,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:52,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:32:00,530 INFO L124 PetriNetUnfolderBase]: 104/784 cut-off events. [2025-01-09 21:32:00,530 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:00,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 919 conditions, 784 events. 104/784 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1926 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 650. Up to 124 conditions per place. [2025-01-09 21:32:00,534 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 2 changer transitions 0/560 dead transitions. [2025-01-09 21:32:00,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 560 transitions, 1190 flow [2025-01-09 21:32:00,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:32:00,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321901323706378 [2025-01-09 21:32:00,540 INFO L175 Difference]: Start difference. First operand has 541 places, 561 transitions, 1130 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:32:00,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 560 transitions, 1190 flow [2025-01-09 21:32:00,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 540 places, 560 transitions, 1186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:00,547 INFO L231 Difference]: Finished difference. Result has 540 places, 560 transitions, 1128 flow [2025-01-09 21:32:00,547 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1124, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=540, PETRI_TRANSITIONS=560} [2025-01-09 21:32:00,549 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -506 predicate places. [2025-01-09 21:32:00,549 INFO L471 AbstractCegarLoop]: Abstraction has has 540 places, 560 transitions, 1128 flow [2025-01-09 21:32:00,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:32:00,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:00,550 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:00,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:00,551 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:32:00,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:00,552 INFO L85 PathProgramCache]: Analyzing trace with hash -16417772, now seen corresponding path program 1 times [2025-01-09 21:32:00,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:00,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413210054] [2025-01-09 21:32:00,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:00,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:00,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 250 statements into 1 equivalence classes. [2025-01-09 21:32:00,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 250 of 250 statements. [2025-01-09 21:32:00,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:00,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:00,735 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:32:00,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:00,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413210054] [2025-01-09 21:32:00,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413210054] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:00,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:00,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392323035] [2025-01-09 21:32:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:00,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:00,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:00,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:00,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:32:00,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 540 places, 560 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:32:00,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:00,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:32:00,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:07,329 INFO L124 PetriNetUnfolderBase]: 104/783 cut-off events. [2025-01-09 21:32:07,329 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:07,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 783 events. 104/783 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1923 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 602. Up to 124 conditions per place. [2025-01-09 21:32:07,331 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-01-09 21:32:07,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 559 transitions, 1188 flow [2025-01-09 21:32:07,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:07,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:07,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:32:07,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321901323706378 [2025-01-09 21:32:07,337 INFO L175 Difference]: Start difference. First operand has 540 places, 560 transitions, 1128 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:32:07,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 559 transitions, 1188 flow [2025-01-09 21:32:07,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 559 transitions, 1184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:07,342 INFO L231 Difference]: Finished difference. Result has 539 places, 559 transitions, 1126 flow [2025-01-09 21:32:07,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1122, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=557, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1126, PETRI_PLACES=539, PETRI_TRANSITIONS=559} [2025-01-09 21:32:07,344 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -507 predicate places. [2025-01-09 21:32:07,344 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 559 transitions, 1126 flow [2025-01-09 21:32:07,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:32:07,345 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:07,345 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:07,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:07,345 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:32:07,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:07,346 INFO L85 PathProgramCache]: Analyzing trace with hash 228821171, now seen corresponding path program 1 times [2025-01-09 21:32:07,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:07,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871940889] [2025-01-09 21:32:07,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:07,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:07,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-09 21:32:07,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-09 21:32:07,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:07,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:07,446 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:32:07,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:07,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871940889] [2025-01-09 21:32:07,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871940889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:07,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:07,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:07,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579208644] [2025-01-09 21:32:07,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:07,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:07,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:07,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:07,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:07,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 579 out of 1108 [2025-01-09 21:32:07,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 559 transitions, 1126 flow. Second operand has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:32:07,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:07,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 579 of 1108 [2025-01-09 21:32:07,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:15,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 21:32:17,182 INFO L124 PetriNetUnfolderBase]: 104/782 cut-off events. [2025-01-09 21:32:17,187 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:17,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 782 events. 104/782 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1913 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 554. Up to 124 conditions per place. [2025-01-09 21:32:17,189 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-01-09 21:32:17,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 558 transitions, 1186 flow [2025-01-09 21:32:17,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:17,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:17,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2025-01-09 21:32:17,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5321901323706378 [2025-01-09 21:32:17,199 INFO L175 Difference]: Start difference. First operand has 539 places, 559 transitions, 1126 flow. Second operand 3 states and 1769 transitions. [2025-01-09 21:32:17,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 558 transitions, 1186 flow [2025-01-09 21:32:17,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 558 transitions, 1182 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:17,213 INFO L231 Difference]: Finished difference. Result has 538 places, 558 transitions, 1124 flow [2025-01-09 21:32:17,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1120, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1124, PETRI_PLACES=538, PETRI_TRANSITIONS=558} [2025-01-09 21:32:17,218 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -508 predicate places. [2025-01-09 21:32:17,218 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 558 transitions, 1124 flow [2025-01-09 21:32:17,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 580.3333333333334) internal successors, (1741), 3 states have internal predecessors, (1741), 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:32:17,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:17,219 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:17,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:32:17,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:32:17,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:17,220 INFO L85 PathProgramCache]: Analyzing trace with hash 28742596, now seen corresponding path program 1 times [2025-01-09 21:32:17,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:17,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926368121] [2025-01-09 21:32:17,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:17,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:17,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 324 statements into 1 equivalence classes. [2025-01-09 21:32:17,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 324 of 324 statements. [2025-01-09 21:32:17,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:17,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:17,504 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:32:17,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:17,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926368121] [2025-01-09 21:32:17,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926368121] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:17,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:17,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:17,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099900926] [2025-01-09 21:32:17,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:17,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:17,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:17,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:17,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 1108 [2025-01-09 21:32:17,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 558 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 582.6666666666666) internal successors, (1748), 3 states have internal predecessors, (1748), 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:32:17,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:17,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 1108 [2025-01-09 21:32:17,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:24,147 INFO L124 PetriNetUnfolderBase]: 104/780 cut-off events. [2025-01-09 21:32:24,147 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:32:24,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 780 events. 104/780 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1926 event pairs, 15 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 505. Up to 121 conditions per place. [2025-01-09 21:32:24,149 INFO L140 encePairwiseOnDemand]: 1105/1108 looper letters, 29 selfloop transitions, 1 changer transitions 0/556 dead transitions. [2025-01-09 21:32:24,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 556 transitions, 1180 flow [2025-01-09 21:32:24,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1772 transitions. [2025-01-09 21:32:24,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53309265944645 [2025-01-09 21:32:24,155 INFO L175 Difference]: Start difference. First operand has 538 places, 558 transitions, 1124 flow. Second operand 3 states and 1772 transitions. [2025-01-09 21:32:24,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 556 transitions, 1180 flow [2025-01-09 21:32:24,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 536 places, 556 transitions, 1176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:24,160 INFO L231 Difference]: Finished difference. Result has 536 places, 556 transitions, 1118 flow [2025-01-09 21:32:24,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1108, PETRI_DIFFERENCE_MINUEND_FLOW=1116, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1118, PETRI_PLACES=536, PETRI_TRANSITIONS=556} [2025-01-09 21:32:24,162 INFO L279 CegarLoopForPetriNet]: 1046 programPoint places, -510 predicate places. [2025-01-09 21:32:24,162 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 556 transitions, 1118 flow [2025-01-09 21:32:24,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 582.6666666666666) internal successors, (1748), 3 states have internal predecessors, (1748), 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:32:24,163 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:24,163 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:24,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:32:24,163 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 966 more)] === [2025-01-09 21:32:24,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:24,164 INFO L85 PathProgramCache]: Analyzing trace with hash -894406509, now seen corresponding path program 1 times [2025-01-09 21:32:24,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:24,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002582019] [2025-01-09 21:32:24,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:24,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:24,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 328 statements into 1 equivalence classes. [2025-01-09 21:32:24,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 328 of 328 statements. [2025-01-09 21:32:24,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:24,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:24,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:32:24,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:24,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002582019] [2025-01-09 21:32:24,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002582019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:24,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:24,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:24,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111808909] [2025-01-09 21:32:24,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:24,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:24,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:24,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:24,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:24,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 580 out of 1108 [2025-01-09 21:32:24,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 556 transitions, 1118 flow. Second operand has 3 states, 3 states have (on average 582.6666666666666) internal successors, (1748), 3 states have internal predecessors, (1748), 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:32:24,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:24,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 580 of 1108 [2025-01-09 21:32:24,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand