./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-subst.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-node-subst.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 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:41,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:41,096 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:41,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:41,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:41,124 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:41,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:41,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:41,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:41,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:41,125 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:41,126 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:41,126 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:41,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:41,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:41,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:41,127 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 -> 3b43103ca9a91605874c4d895f03c4116805b9b245b91cffe9bd63255503e5a0 [2025-01-09 21:30:41,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:41,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:41,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:41,434 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:41,434 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:41,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-09 21:30:42,569 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dbcb0bba/9542f997e2bd41778d2241a331798295/FLAGcca9442d3 [2025-01-09 21:30:42,841 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:42,852 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-subst.wvr.c [2025-01-09 21:30:42,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dbcb0bba/9542f997e2bd41778d2241a331798295/FLAGcca9442d3 [2025-01-09 21:30:43,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0dbcb0bba/9542f997e2bd41778d2241a331798295 [2025-01-09 21:30:43,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:43,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:43,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:43,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:43,156 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:43,157 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:43" (1/1) ... [2025-01-09 21:30:43,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ed0eb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:43, skipping insertion in model container [2025-01-09 21:30:43,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:43" (1/1) ... [2025-01-09 21:30:43,174 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:43,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:43,356 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:43,382 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:43,391 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:43,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:43 WrapperNode [2025-01-09 21:30:43,392 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:43,393 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:43,393 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:43,393 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:43,397 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:43" (1/1) ... [2025-01-09 21:30:43,410 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:43" (1/1) ... [2025-01-09 21:30:43,439 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 779 [2025-01-09 21:30:43,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:43,440 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:43,440 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:43,440 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:43,446 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:43" (1/1) ... [2025-01-09 21:30:43,446 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:43" (1/1) ... [2025-01-09 21:30:43,450 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:43" (1/1) ... [2025-01-09 21:30:43,451 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:43" (1/1) ... [2025-01-09 21:30:43,469 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:43" (1/1) ... [2025-01-09 21:30:43,471 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:43" (1/1) ... [2025-01-09 21:30:43,477 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:43" (1/1) ... [2025-01-09 21:30:43,482 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:43" (1/1) ... [2025-01-09 21:30:43,483 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:43" (1/1) ... [2025-01-09 21:30:43,489 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:43,490 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:43,490 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:43,490 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:43,491 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:43" (1/1) ... [2025-01-09 21:30:43,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:43,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:43,518 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:43,522 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:43,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:43,536 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:43,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:43,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:43,538 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:43,639 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:43,640 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:44,364 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:44,364 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:44,386 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:44,386 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:44,387 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:44 BoogieIcfgContainer [2025-01-09 21:30:44,387 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:44,417 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:44,417 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:44,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:44,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:43" (1/3) ... [2025-01-09 21:30:44,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50103e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:44, skipping insertion in model container [2025-01-09 21:30:44,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:43" (2/3) ... [2025-01-09 21:30:44,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50103e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:44, skipping insertion in model container [2025-01-09 21:30:44,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:44" (3/3) ... [2025-01-09 21:30:44,433 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-subst.wvr.c [2025-01-09 21:30:44,448 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:44,449 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-subst.wvr.c that has 4 procedures, 1007 locations, 1 initial locations, 6 loop locations, and 116 error locations. [2025-01-09 21:30:44,450 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:44,637 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:44,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1016 places, 1048 transitions, 2117 flow [2025-01-09 21:30:45,005 INFO L124 PetriNetUnfolderBase]: 42/1045 cut-off events. [2025-01-09 21:30:45,008 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:45,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1058 conditions, 1045 events. 42/1045 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2178 event pairs, 0 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-01-09 21:30:45,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 1016 places, 1048 transitions, 2117 flow [2025-01-09 21:30:45,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 993 places, 1022 transitions, 2062 flow [2025-01-09 21:30:45,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:45,064 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;@57e6fb78, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:45,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 194 error locations. [2025-01-09 21:30:45,070 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:45,070 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:30:45,070 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:45,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:45,071 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] [2025-01-09 21:30:45,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:45,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:45,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1556699695, now seen corresponding path program 1 times [2025-01-09 21:30:45,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:45,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419519828] [2025-01-09 21:30:45,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:45,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:45,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:30:45,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:30:45,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:45,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:45,199 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:30:45,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:45,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419519828] [2025-01-09 21:30:45,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419519828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:45,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:45,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:45,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084228005] [2025-01-09 21:30:45,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:45,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:45,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:45,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:45,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:45,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-01-09 21:30:45,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 993 places, 1022 transitions, 2062 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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:30:45,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:45,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-01-09 21:30:45,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,078 INFO L124 PetriNetUnfolderBase]: 86/2508 cut-off events. [2025-01-09 21:30:46,078 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-09 21:30:46,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 2508 events. 86/2508 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 14343 event pairs, 39 based on Foata normal form. 62/2119 useless extension candidates. Maximal degree in co-relation 1937. Up to 89 conditions per place. [2025-01-09 21:30:46,112 INFO L140 encePairwiseOnDemand]: 1023/1048 looper letters, 19 selfloop transitions, 2 changer transitions 16/999 dead transitions. [2025-01-09 21:30:46,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 994 places, 999 transitions, 2058 flow [2025-01-09 21:30:46,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3047 transitions. [2025-01-09 21:30:46,132 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.969147582697201 [2025-01-09 21:30:46,134 INFO L175 Difference]: Start difference. First operand has 993 places, 1022 transitions, 2062 flow. Second operand 3 states and 3047 transitions. [2025-01-09 21:30:46,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 994 places, 999 transitions, 2058 flow [2025-01-09 21:30:46,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 999 transitions, 2046 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:46,151 INFO L231 Difference]: Finished difference. Result has 988 places, 983 transitions, 1976 flow [2025-01-09 21:30:46,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=2004, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=999, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=997, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1976, PETRI_PLACES=988, PETRI_TRANSITIONS=983} [2025-01-09 21:30:46,156 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -5 predicate places. [2025-01-09 21:30:46,156 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 983 transitions, 1976 flow [2025-01-09 21:30:46,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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:30:46,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:46,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:46,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:46,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,159 INFO L85 PathProgramCache]: Analyzing trace with hash -890879393, now seen corresponding path program 1 times [2025-01-09 21:30:46,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175168849] [2025-01-09 21:30:46,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:30:46,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:30:46,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,209 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:30:46,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175168849] [2025-01-09 21:30:46,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175168849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259208777] [2025-01-09 21:30:46,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-01-09 21:30:46,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 983 transitions, 1976 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 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:30:46,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-01-09 21:30:46,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,960 INFO L124 PetriNetUnfolderBase]: 212/3960 cut-off events. [2025-01-09 21:30:46,960 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 21:30:46,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4280 conditions, 3960 events. 212/3960 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 29586 event pairs, 132 based on Foata normal form. 0/3319 useless extension candidates. Maximal degree in co-relation 4237. Up to 257 conditions per place. [2025-01-09 21:30:47,003 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/973 dead transitions. [2025-01-09 21:30:47,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 964 places, 973 transitions, 2010 flow [2025-01-09 21:30:47,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:47,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:47,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-01-09 21:30:47,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-01-09 21:30:47,010 INFO L175 Difference]: Start difference. First operand has 988 places, 983 transitions, 1976 flow. Second operand 3 states and 2998 transitions. [2025-01-09 21:30:47,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 964 places, 973 transitions, 2010 flow [2025-01-09 21:30:47,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 973 transitions, 2006 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:47,025 INFO L231 Difference]: Finished difference. Result has 962 places, 973 transitions, 1954 flow [2025-01-09 21:30:47,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1952, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=973, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=972, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1954, PETRI_PLACES=962, PETRI_TRANSITIONS=973} [2025-01-09 21:30:47,027 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2025-01-09 21:30:47,027 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 973 transitions, 1954 flow [2025-01-09 21:30:47,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 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:30:47,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:47,029 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:47,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:47,029 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:47,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:47,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1198826678, now seen corresponding path program 1 times [2025-01-09 21:30:47,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:47,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639066271] [2025-01-09 21:30:47,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:47,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:47,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:30:47,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:30:47,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:47,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:47,104 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:30:47,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:47,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639066271] [2025-01-09 21:30:47,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639066271] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:47,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:47,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:47,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652697478] [2025-01-09 21:30:47,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:47,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:47,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:47,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:47,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:47,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-01-09 21:30:47,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 973 transitions, 1954 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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:30:47,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:47,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-01-09 21:30:47,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:47,649 INFO L124 PetriNetUnfolderBase]: 62/2211 cut-off events. [2025-01-09 21:30:47,649 INFO L125 PetriNetUnfolderBase]: For 9/16 co-relation queries the response was YES. [2025-01-09 21:30:47,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2287 conditions, 2211 events. 62/2211 cut-off events. For 9/16 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 11132 event pairs, 21 based on Foata normal form. 0/1845 useless extension candidates. Maximal degree in co-relation 2244. Up to 62 conditions per place. [2025-01-09 21:30:47,686 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/972 dead transitions. [2025-01-09 21:30:47,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 963 places, 972 transitions, 1994 flow [2025-01-09 21:30:47,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:47,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:47,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2025-01-09 21:30:47,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621501272264631 [2025-01-09 21:30:47,691 INFO L175 Difference]: Start difference. First operand has 962 places, 973 transitions, 1954 flow. Second operand 3 states and 3025 transitions. [2025-01-09 21:30:47,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 963 places, 972 transitions, 1994 flow [2025-01-09 21:30:47,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 962 places, 972 transitions, 1993 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:47,708 INFO L231 Difference]: Finished difference. Result has 962 places, 972 transitions, 1955 flow [2025-01-09 21:30:47,711 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1951, PETRI_DIFFERENCE_MINUEND_PLACES=960, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=972, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=970, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1955, PETRI_PLACES=962, PETRI_TRANSITIONS=972} [2025-01-09 21:30:47,712 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -31 predicate places. [2025-01-09 21:30:47,712 INFO L471 AbstractCegarLoop]: Abstraction has has 962 places, 972 transitions, 1955 flow [2025-01-09 21:30:47,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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:30:47,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:47,715 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] [2025-01-09 21:30:47,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:47,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:47,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2126581344, now seen corresponding path program 1 times [2025-01-09 21:30:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:47,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696666071] [2025-01-09 21:30:47,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:47,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:47,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:30:47,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:30:47,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:47,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:47,785 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:30:47,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:47,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696666071] [2025-01-09 21:30:47,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696666071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:47,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:47,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:47,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203977965] [2025-01-09 21:30:47,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:47,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:47,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:47,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:47,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:47,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-01-09 21:30:47,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 962 places, 972 transitions, 1955 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 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:30:47,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:47,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-01-09 21:30:47,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,293 INFO L124 PetriNetUnfolderBase]: 116/2624 cut-off events. [2025-01-09 21:30:48,293 INFO L125 PetriNetUnfolderBase]: For 17/119 co-relation queries the response was YES. [2025-01-09 21:30:48,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2795 conditions, 2624 events. 116/2624 cut-off events. For 17/119 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 15918 event pairs, 60 based on Foata normal form. 0/2222 useless extension candidates. Maximal degree in co-relation 2753. Up to 149 conditions per place. [2025-01-09 21:30:48,387 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/962 dead transitions. [2025-01-09 21:30:48,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 954 places, 962 transitions, 1989 flow [2025-01-09 21:30:48,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-01-09 21:30:48,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-01-09 21:30:48,400 INFO L175 Difference]: Start difference. First operand has 962 places, 972 transitions, 1955 flow. Second operand 3 states and 2998 transitions. [2025-01-09 21:30:48,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 954 places, 962 transitions, 1989 flow [2025-01-09 21:30:48,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 962 transitions, 1985 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:48,418 INFO L231 Difference]: Finished difference. Result has 952 places, 962 transitions, 1933 flow [2025-01-09 21:30:48,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1931, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=962, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=961, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1933, PETRI_PLACES=952, PETRI_TRANSITIONS=962} [2025-01-09 21:30:48,423 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2025-01-09 21:30:48,427 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 962 transitions, 1933 flow [2025-01-09 21:30:48,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 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:30:48,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:48,430 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1478355630, now seen corresponding path program 1 times [2025-01-09 21:30:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183684613] [2025-01-09 21:30:48,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:30:48,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:30:48,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:48,497 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:30:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183684613] [2025-01-09 21:30:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183684613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:48,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:48,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612594191] [2025-01-09 21:30:48,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:48,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:48,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:48,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:48,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:48,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1048 [2025-01-09 21:30:48,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 962 transitions, 1933 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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:30:48,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1048 [2025-01-09 21:30:48,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,849 INFO L124 PetriNetUnfolderBase]: 74/1837 cut-off events. [2025-01-09 21:30:48,850 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-01-09 21:30:48,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1837 events. 74/1837 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8438 event pairs, 39 based on Foata normal form. 0/1563 useless extension candidates. Maximal degree in co-relation 1895. Up to 89 conditions per place. [2025-01-09 21:30:48,871 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 19 selfloop transitions, 2 changer transitions 0/961 dead transitions. [2025-01-09 21:30:48,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 961 transitions, 1973 flow [2025-01-09 21:30:48,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:48,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3025 transitions. [2025-01-09 21:30:48,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9621501272264631 [2025-01-09 21:30:48,877 INFO L175 Difference]: Start difference. First operand has 952 places, 962 transitions, 1933 flow. Second operand 3 states and 3025 transitions. [2025-01-09 21:30:48,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 961 transitions, 1973 flow [2025-01-09 21:30:48,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 952 places, 961 transitions, 1972 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:48,889 INFO L231 Difference]: Finished difference. Result has 952 places, 961 transitions, 1934 flow [2025-01-09 21:30:48,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1930, PETRI_DIFFERENCE_MINUEND_PLACES=950, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=961, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=959, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1934, PETRI_PLACES=952, PETRI_TRANSITIONS=961} [2025-01-09 21:30:48,892 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -41 predicate places. [2025-01-09 21:30:48,893 INFO L471 AbstractCegarLoop]: Abstraction has has 952 places, 961 transitions, 1934 flow [2025-01-09 21:30:48,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 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:30:48,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,895 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] [2025-01-09 21:30:48,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:48,895 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:48,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash -272473830, now seen corresponding path program 1 times [2025-01-09 21:30:48,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083791467] [2025-01-09 21:30:48,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:30:48,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:30:48,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:48,934 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:30:48,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:48,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083791467] [2025-01-09 21:30:48,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083791467] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:48,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:48,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:48,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826457982] [2025-01-09 21:30:48,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:48,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:48,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:48,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:48,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:48,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 987 out of 1048 [2025-01-09 21:30:48,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 952 places, 961 transitions, 1934 flow. Second operand has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 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:30:48,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 987 of 1048 [2025-01-09 21:30:48,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,659 INFO L124 PetriNetUnfolderBase]: 226/3707 cut-off events. [2025-01-09 21:30:49,659 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2025-01-09 21:30:49,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3998 conditions, 3707 events. 226/3707 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 26790 event pairs, 132 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 3956. Up to 274 conditions per place. [2025-01-09 21:30:49,702 INFO L140 encePairwiseOnDemand]: 1037/1048 looper letters, 26 selfloop transitions, 1 changer transitions 0/951 dead transitions. [2025-01-09 21:30:49,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 944 places, 951 transitions, 1968 flow [2025-01-09 21:30:49,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2998 transitions. [2025-01-09 21:30:49,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9535623409669212 [2025-01-09 21:30:49,706 INFO L175 Difference]: Start difference. First operand has 952 places, 961 transitions, 1934 flow. Second operand 3 states and 2998 transitions. [2025-01-09 21:30:49,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 944 places, 951 transitions, 1968 flow [2025-01-09 21:30:49,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 951 transitions, 1964 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:49,717 INFO L231 Difference]: Finished difference. Result has 942 places, 951 transitions, 1912 flow [2025-01-09 21:30:49,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1910, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=951, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=950, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1912, PETRI_PLACES=942, PETRI_TRANSITIONS=951} [2025-01-09 21:30:49,721 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-01-09 21:30:49,721 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 951 transitions, 1912 flow [2025-01-09 21:30:49,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 988.0) internal successors, (2964), 3 states have internal predecessors, (2964), 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:30:49,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,723 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] [2025-01-09 21:30:49,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:49,723 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:49,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1951928410, now seen corresponding path program 1 times [2025-01-09 21:30:49,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795525273] [2025-01-09 21:30:49,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:30:49,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:30:49,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,782 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:30:49,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795525273] [2025-01-09 21:30:49,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795525273] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993226467] [2025-01-09 21:30:49,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1009 out of 1048 [2025-01-09 21:30:49,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 951 transitions, 1912 flow. Second operand has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 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:30:49,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1009 of 1048 [2025-01-09 21:30:49,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,938 INFO L124 PetriNetUnfolderBase]: 25/1251 cut-off events. [2025-01-09 21:30:49,938 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:49,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 1251 events. 25/1251 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 3297 event pairs, 2 based on Foata normal form. 0/1097 useless extension candidates. Maximal degree in co-relation 1236. Up to 16 conditions per place. [2025-01-09 21:30:49,952 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 11 selfloop transitions, 2 changer transitions 0/950 dead transitions. [2025-01-09 21:30:49,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 950 transitions, 1936 flow [2025-01-09 21:30:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3041 transitions. [2025-01-09 21:30:49,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672391857506362 [2025-01-09 21:30:49,957 INFO L175 Difference]: Start difference. First operand has 942 places, 951 transitions, 1912 flow. Second operand 3 states and 3041 transitions. [2025-01-09 21:30:49,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 950 transitions, 1936 flow [2025-01-09 21:30:49,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 942 places, 950 transitions, 1935 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:50,012 INFO L231 Difference]: Finished difference. Result has 942 places, 950 transitions, 1913 flow [2025-01-09 21:30:50,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1909, PETRI_DIFFERENCE_MINUEND_PLACES=940, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=950, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=948, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1913, PETRI_PLACES=942, PETRI_TRANSITIONS=950} [2025-01-09 21:30:50,016 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -51 predicate places. [2025-01-09 21:30:50,016 INFO L471 AbstractCegarLoop]: Abstraction has has 942 places, 950 transitions, 1913 flow [2025-01-09 21:30:50,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1010.3333333333334) internal successors, (3031), 3 states have internal predecessors, (3031), 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:30:50,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:50,018 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] [2025-01-09 21:30:50,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:50,018 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:50,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash -43559016, now seen corresponding path program 1 times [2025-01-09 21:30:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:50,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-01-09 21:30:50,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:50,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:50,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:30:50,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:30:50,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:50,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:50,068 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:30:50,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:50,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-01-09 21:30:50,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240293658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:50,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:50,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:50,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297018676] [2025-01-09 21:30:50,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:50,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:50,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:50,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:50,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:50,100 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:50,104 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 942 places, 950 transitions, 1913 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:50,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:50,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:50,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:50,502 INFO L124 PetriNetUnfolderBase]: 41/1852 cut-off events. [2025-01-09 21:30:50,502 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:30:50,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 1852 events. 41/1852 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8320 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1852. Up to 25 conditions per place. [2025-01-09 21:30:50,531 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/949 dead transitions. [2025-01-09 21:30:50,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 943 places, 949 transitions, 1939 flow [2025-01-09 21:30:50,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:50,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:50,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:50,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:50,538 INFO L175 Difference]: Start difference. First operand has 942 places, 950 transitions, 1913 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:50,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 943 places, 949 transitions, 1939 flow [2025-01-09 21:30:50,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 941 places, 949 transitions, 1935 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:50,555 INFO L231 Difference]: Finished difference. Result has 941 places, 949 transitions, 1911 flow [2025-01-09 21:30:50,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1907, PETRI_DIFFERENCE_MINUEND_PLACES=939, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=949, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=947, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1911, PETRI_PLACES=941, PETRI_TRANSITIONS=949} [2025-01-09 21:30:50,558 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -52 predicate places. [2025-01-09 21:30:50,558 INFO L471 AbstractCegarLoop]: Abstraction has has 941 places, 949 transitions, 1911 flow [2025-01-09 21:30:50,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:50,561 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:50,561 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] [2025-01-09 21:30:50,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:50,562 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:50,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:50,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2093265919, now seen corresponding path program 1 times [2025-01-09 21:30:50,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:50,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114758844] [2025-01-09 21:30:50,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:50,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:30:50,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:30:50,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:50,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:50,635 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:30:50,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:50,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114758844] [2025-01-09 21:30:50,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114758844] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:50,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:50,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:50,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493293839] [2025-01-09 21:30:50,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:50,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:50,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:50,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:50,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:50,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:50,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 941 places, 949 transitions, 1911 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:50,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:50,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:50,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:51,047 INFO L124 PetriNetUnfolderBase]: 41/1851 cut-off events. [2025-01-09 21:30:51,047 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:30:51,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1894 conditions, 1851 events. 41/1851 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 8303 event pairs, 6 based on Foata normal form. 0/1601 useless extension candidates. Maximal degree in co-relation 1851. Up to 25 conditions per place. [2025-01-09 21:30:51,074 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/948 dead transitions. [2025-01-09 21:30:51,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 942 places, 948 transitions, 1937 flow [2025-01-09 21:30:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:51,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:51,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:51,079 INFO L175 Difference]: Start difference. First operand has 941 places, 949 transitions, 1911 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:51,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 942 places, 948 transitions, 1937 flow [2025-01-09 21:30:51,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 940 places, 948 transitions, 1933 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:51,093 INFO L231 Difference]: Finished difference. Result has 940 places, 948 transitions, 1909 flow [2025-01-09 21:30:51,095 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1905, PETRI_DIFFERENCE_MINUEND_PLACES=938, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=948, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1909, PETRI_PLACES=940, PETRI_TRANSITIONS=948} [2025-01-09 21:30:51,095 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -53 predicate places. [2025-01-09 21:30:51,095 INFO L471 AbstractCegarLoop]: Abstraction has has 940 places, 948 transitions, 1909 flow [2025-01-09 21:30:51,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:51,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:51,098 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:51,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:51,098 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:51,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:51,098 INFO L85 PathProgramCache]: Analyzing trace with hash -1685729791, now seen corresponding path program 1 times [2025-01-09 21:30:51,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:51,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759443231] [2025-01-09 21:30:51,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:51,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:51,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:30:51,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:30:51,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:51,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:51,134 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:30:51,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:51,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759443231] [2025-01-09 21:30:51,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759443231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:51,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:51,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016323567] [2025-01-09 21:30:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:51,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:51,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:51,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:51,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:51,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:51,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 940 places, 948 transitions, 1909 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:51,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:51,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:51,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:51,354 INFO L124 PetriNetUnfolderBase]: 22/1098 cut-off events. [2025-01-09 21:30:51,355 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-01-09 21:30:51,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1128 conditions, 1098 events. 22/1098 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2520 event pairs, 2 based on Foata normal form. 0/972 useless extension candidates. Maximal degree in co-relation 1085. Up to 17 conditions per place. [2025-01-09 21:30:51,369 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/947 dead transitions. [2025-01-09 21:30:51,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 941 places, 947 transitions, 1935 flow [2025-01-09 21:30:51,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:51,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:51,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:51,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:51,374 INFO L175 Difference]: Start difference. First operand has 940 places, 948 transitions, 1909 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:51,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 941 places, 947 transitions, 1935 flow [2025-01-09 21:30:51,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 939 places, 947 transitions, 1931 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:51,388 INFO L231 Difference]: Finished difference. Result has 939 places, 947 transitions, 1907 flow [2025-01-09 21:30:51,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1903, PETRI_DIFFERENCE_MINUEND_PLACES=937, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=945, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1907, PETRI_PLACES=939, PETRI_TRANSITIONS=947} [2025-01-09 21:30:51,390 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -54 predicate places. [2025-01-09 21:30:51,390 INFO L471 AbstractCegarLoop]: Abstraction has has 939 places, 947 transitions, 1907 flow [2025-01-09 21:30:51,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:51,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:51,392 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] [2025-01-09 21:30:51,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:51,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:51,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash -2109680586, now seen corresponding path program 1 times [2025-01-09 21:30:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:51,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098686112] [2025-01-09 21:30:51,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:51,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:30:51,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:30:51,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:51,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:51,453 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:30:51,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:51,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098686112] [2025-01-09 21:30:51,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098686112] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:51,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:51,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:51,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38844655] [2025-01-09 21:30:51,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:51,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:51,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:51,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:51,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:51,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:51,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 939 places, 947 transitions, 1907 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:51,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:51,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:51,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:51,704 INFO L124 PetriNetUnfolderBase]: 32/1399 cut-off events. [2025-01-09 21:30:51,704 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-01-09 21:30:51,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1439 conditions, 1399 events. 32/1399 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4824 event pairs, 6 based on Foata normal form. 0/1222 useless extension candidates. Maximal degree in co-relation 1396. Up to 25 conditions per place. [2025-01-09 21:30:51,715 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-01-09 21:30:51,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 940 places, 946 transitions, 1933 flow [2025-01-09 21:30:51,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:51,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:51,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:51,719 INFO L175 Difference]: Start difference. First operand has 939 places, 947 transitions, 1907 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:51,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 940 places, 946 transitions, 1933 flow [2025-01-09 21:30:51,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 938 places, 946 transitions, 1929 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:51,727 INFO L231 Difference]: Finished difference. Result has 938 places, 946 transitions, 1905 flow [2025-01-09 21:30:51,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=936, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=938, PETRI_TRANSITIONS=946} [2025-01-09 21:30:51,729 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -55 predicate places. [2025-01-09 21:30:51,729 INFO L471 AbstractCegarLoop]: Abstraction has has 938 places, 946 transitions, 1905 flow [2025-01-09 21:30:51,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:51,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:51,731 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] [2025-01-09 21:30:51,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:51,731 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:51,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:51,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1498021393, now seen corresponding path program 1 times [2025-01-09 21:30:51,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:51,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198028223] [2025-01-09 21:30:51,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:51,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:51,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:30:51,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:30:51,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:51,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:51,758 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:30:51,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:51,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198028223] [2025-01-09 21:30:51,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198028223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:51,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:51,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:51,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656420403] [2025-01-09 21:30:51,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:51,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:51,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:51,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:51,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:51,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:51,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 938 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:51,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:51,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:51,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:51,955 INFO L124 PetriNetUnfolderBase]: 32/1398 cut-off events. [2025-01-09 21:30:51,956 INFO L125 PetriNetUnfolderBase]: For 4/28 co-relation queries the response was YES. [2025-01-09 21:30:51,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1438 conditions, 1398 events. 32/1398 cut-off events. For 4/28 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4801 event pairs, 6 based on Foata normal form. 0/1223 useless extension candidates. Maximal degree in co-relation 1395. Up to 25 conditions per place. [2025-01-09 21:30:51,975 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2025-01-09 21:30:51,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 945 transitions, 1931 flow [2025-01-09 21:30:51,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:51,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:51,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:51,979 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:51,979 INFO L175 Difference]: Start difference. First operand has 938 places, 946 transitions, 1905 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:51,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 945 transitions, 1931 flow [2025-01-09 21:30:51,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:51,988 INFO L231 Difference]: Finished difference. Result has 937 places, 945 transitions, 1903 flow [2025-01-09 21:30:51,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=937, PETRI_TRANSITIONS=945} [2025-01-09 21:30:51,990 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -56 predicate places. [2025-01-09 21:30:51,990 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 945 transitions, 1903 flow [2025-01-09 21:30:51,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:51,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:51,991 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] [2025-01-09 21:30:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:51,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:51,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1377015637, now seen corresponding path program 1 times [2025-01-09 21:30:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976620503] [2025-01-09 21:30:51,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:51,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 21:30:52,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 21:30:52,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,021 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:30:52,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976620503] [2025-01-09 21:30:52,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976620503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904369900] [2025-01-09 21:30:52,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:52,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:52,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:52,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,145 INFO L124 PetriNetUnfolderBase]: 19/974 cut-off events. [2025-01-09 21:30:52,145 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:52,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1003 conditions, 974 events. 19/974 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2056 event pairs, 2 based on Foata normal form. 0/874 useless extension candidates. Maximal degree in co-relation 960. Up to 17 conditions per place. [2025-01-09 21:30:52,156 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2025-01-09 21:30:52,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 944 transitions, 1929 flow [2025-01-09 21:30:52,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:52,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:52,160 INFO L175 Difference]: Start difference. First operand has 937 places, 945 transitions, 1903 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:52,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 944 transitions, 1929 flow [2025-01-09 21:30:52,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:52,169 INFO L231 Difference]: Finished difference. Result has 936 places, 944 transitions, 1901 flow [2025-01-09 21:30:52,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=936, PETRI_TRANSITIONS=944} [2025-01-09 21:30:52,171 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -57 predicate places. [2025-01-09 21:30:52,171 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 944 transitions, 1901 flow [2025-01-09 21:30:52,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:52,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,172 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] [2025-01-09 21:30:52,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:52,172 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:52,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,173 INFO L85 PathProgramCache]: Analyzing trace with hash 426291492, now seen corresponding path program 1 times [2025-01-09 21:30:52,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759939336] [2025-01-09 21:30:52,173 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:30:52,181 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:30:52,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,201 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:30:52,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759939336] [2025-01-09 21:30:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759939336] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448025219] [2025-01-09 21:30:52,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:52,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:52,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:52,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,357 INFO L124 PetriNetUnfolderBase]: 29/1209 cut-off events. [2025-01-09 21:30:52,358 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-01-09 21:30:52,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 1209 events. 29/1209 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3080 event pairs, 6 based on Foata normal form. 0/1065 useless extension candidates. Maximal degree in co-relation 1203. Up to 25 conditions per place. [2025-01-09 21:30:52,371 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2025-01-09 21:30:52,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 943 transitions, 1927 flow [2025-01-09 21:30:52,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:52,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:52,375 INFO L175 Difference]: Start difference. First operand has 936 places, 944 transitions, 1901 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:52,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 943 transitions, 1927 flow [2025-01-09 21:30:52,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 943 transitions, 1923 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:52,385 INFO L231 Difference]: Finished difference. Result has 935 places, 943 transitions, 1899 flow [2025-01-09 21:30:52,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=935, PETRI_TRANSITIONS=943} [2025-01-09 21:30:52,387 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -58 predicate places. [2025-01-09 21:30:52,387 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 943 transitions, 1899 flow [2025-01-09 21:30:52,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:52,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,388 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] [2025-01-09 21:30:52,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:52,389 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:52,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,389 INFO L85 PathProgramCache]: Analyzing trace with hash -780458827, now seen corresponding path program 1 times [2025-01-09 21:30:52,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-01-09 21:30:52,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:30:52,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:30:52,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,427 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:30:52,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019529613] [2025-01-09 21:30:52,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1019529613] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878843315] [2025-01-09 21:30:52,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1008 out of 1048 [2025-01-09 21:30:52,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:52,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1008 of 1048 [2025-01-09 21:30:52,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,580 INFO L124 PetriNetUnfolderBase]: 29/1170 cut-off events. [2025-01-09 21:30:52,580 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-01-09 21:30:52,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1170 events. 29/1170 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2947 event pairs, 6 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 1164. Up to 25 conditions per place. [2025-01-09 21:30:52,592 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-01-09 21:30:52,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 942 transitions, 1925 flow [2025-01-09 21:30:52,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3039 transitions. [2025-01-09 21:30:52,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9666030534351145 [2025-01-09 21:30:52,596 INFO L175 Difference]: Start difference. First operand has 935 places, 943 transitions, 1899 flow. Second operand 3 states and 3039 transitions. [2025-01-09 21:30:52,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 942 transitions, 1925 flow [2025-01-09 21:30:52,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:52,605 INFO L231 Difference]: Finished difference. Result has 934 places, 942 transitions, 1897 flow [2025-01-09 21:30:52,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=934, PETRI_TRANSITIONS=942} [2025-01-09 21:30:52,607 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -59 predicate places. [2025-01-09 21:30:52,607 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 942 transitions, 1897 flow [2025-01-09 21:30:52,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1009.3333333333334) internal successors, (3028), 3 states have internal predecessors, (3028), 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:30:52,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,608 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] [2025-01-09 21:30:52,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:52,608 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:30:52,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,609 INFO L85 PathProgramCache]: Analyzing trace with hash -2077012427, now seen corresponding path program 1 times [2025-01-09 21:30:52,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314364760] [2025-01-09 21:30:52,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:30:52,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:30:52,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,093 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:30:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314364760] [2025-01-09 21:30:53,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314364760] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:53,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023881002] [2025-01-09 21:30:53,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:53,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:53,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:53,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1048 [2025-01-09 21:30:53,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 942 transitions, 1897 flow. Second operand has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 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:30:53,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1048 [2025-01-09 21:30:53,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:06,576 INFO L124 PetriNetUnfolderBase]: 15256/84668 cut-off events. [2025-01-09 21:31:06,577 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-01-09 21:31:06,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107097 conditions, 84668 events. 15256/84668 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1250568 event pairs, 14040 based on Foata normal form. 0/73978 useless extension candidates. Maximal degree in co-relation 107055. Up to 22026 conditions per place. [2025-01-09 21:31:07,172 INFO L140 encePairwiseOnDemand]: 1030/1048 looper letters, 87 selfloop transitions, 15 changer transitions 0/939 dead transitions. [2025-01-09 21:31:07,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 939 transitions, 2095 flow [2025-01-09 21:31:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:07,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:07,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5619 transitions. [2025-01-09 21:31:07,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8936068702290076 [2025-01-09 21:31:07,180 INFO L175 Difference]: Start difference. First operand has 934 places, 942 transitions, 1897 flow. Second operand 6 states and 5619 transitions. [2025-01-09 21:31:07,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 939 transitions, 2095 flow [2025-01-09 21:31:07,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 939 transitions, 2091 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:07,192 INFO L231 Difference]: Finished difference. Result has 934 places, 939 transitions, 1917 flow [2025-01-09 21:31:07,193 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=924, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1917, PETRI_PLACES=934, PETRI_TRANSITIONS=939} [2025-01-09 21:31:07,193 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -59 predicate places. [2025-01-09 21:31:07,193 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 939 transitions, 1917 flow [2025-01-09 21:31:07,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 920.5) internal successors, (5523), 6 states have internal predecessors, (5523), 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:07,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:07,195 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] [2025-01-09 21:31:07,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:31:07,195 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:31:07,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:07,196 INFO L85 PathProgramCache]: Analyzing trace with hash -259625384, now seen corresponding path program 1 times [2025-01-09 21:31:07,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-01-09 21:31:07,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:07,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:07,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:31:07,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:31:07,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:07,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:07,246 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:07,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:07,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064561013] [2025-01-09 21:31:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064561013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:07,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:07,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:07,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92451173] [2025-01-09 21:31:07,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:07,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:07,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:07,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:07,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:07,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-01-09 21:31:07,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 939 transitions, 1917 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 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:07,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:07,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-01-09 21:31:07,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:07,766 INFO L124 PetriNetUnfolderBase]: 61/2110 cut-off events. [2025-01-09 21:31:07,766 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:31:07,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2195 conditions, 2110 events. 61/2110 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 10748 event pairs, 20 based on Foata normal form. 0/1818 useless extension candidates. Maximal degree in co-relation 2152. Up to 50 conditions per place. [2025-01-09 21:31:07,787 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/938 dead transitions. [2025-01-09 21:31:07,787 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 938 transitions, 1945 flow [2025-01-09 21:31:07,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:07,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:07,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-01-09 21:31:07,790 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-01-09 21:31:07,790 INFO L175 Difference]: Start difference. First operand has 934 places, 939 transitions, 1917 flow. Second operand 3 states and 3037 transitions. [2025-01-09 21:31:07,791 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 938 transitions, 1945 flow [2025-01-09 21:31:07,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 938 transitions, 1915 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:07,801 INFO L231 Difference]: Finished difference. Result has 930 places, 938 transitions, 1889 flow [2025-01-09 21:31:07,802 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1889, PETRI_PLACES=930, PETRI_TRANSITIONS=938} [2025-01-09 21:31:07,802 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -63 predicate places. [2025-01-09 21:31:07,802 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 938 transitions, 1889 flow [2025-01-09 21:31:07,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 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:07,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:07,803 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] [2025-01-09 21:31:07,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:31:07,803 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:31:07,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:07,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1349357574, now seen corresponding path program 1 times [2025-01-09 21:31:07,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:07,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141451642] [2025-01-09 21:31:07,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:07,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:07,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 21:31:07,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 21:31:07,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:07,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:07,852 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:07,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:07,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141451642] [2025-01-09 21:31:07,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141451642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:07,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:07,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:07,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130880070] [2025-01-09 21:31:07,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:07,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:07,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:07,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:07,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:07,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-01-09 21:31:07,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 938 transitions, 1889 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 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:07,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:07,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-01-09 21:31:07,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:08,099 INFO L124 PetriNetUnfolderBase]: 47/1835 cut-off events. [2025-01-09 21:31:08,100 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-01-09 21:31:08,115 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1889 conditions, 1835 events. 47/1835 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 7500 event pairs, 12 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 1846. Up to 38 conditions per place. [2025-01-09 21:31:08,123 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/937 dead transitions. [2025-01-09 21:31:08,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 937 transitions, 1917 flow [2025-01-09 21:31:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:08,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-01-09 21:31:08,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-01-09 21:31:08,126 INFO L175 Difference]: Start difference. First operand has 930 places, 938 transitions, 1889 flow. Second operand 3 states and 3037 transitions. [2025-01-09 21:31:08,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 937 transitions, 1917 flow [2025-01-09 21:31:08,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 937 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:08,135 INFO L231 Difference]: Finished difference. Result has 929 places, 937 transitions, 1887 flow [2025-01-09 21:31:08,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1883, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=937, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=935, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1887, PETRI_PLACES=929, PETRI_TRANSITIONS=937} [2025-01-09 21:31:08,136 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -64 predicate places. [2025-01-09 21:31:08,136 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 937 transitions, 1887 flow [2025-01-09 21:31:08,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 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,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:08,137 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] [2025-01-09 21:31:08,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:31:08,137 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:31:08,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:08,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1086963712, now seen corresponding path program 1 times [2025-01-09 21:31:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:08,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592109873] [2025-01-09 21:31:08,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:08,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:08,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 21:31:08,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 21:31:08,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:08,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:08,201 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:08,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:08,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592109873] [2025-01-09 21:31:08,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592109873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:08,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:08,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:08,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715376844] [2025-01-09 21:31:08,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:08,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:08,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:08,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:08,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:08,225 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1007 out of 1048 [2025-01-09 21:31:08,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 937 transitions, 1887 flow. Second operand has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 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,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:08,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1007 of 1048 [2025-01-09 21:31:08,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:08,425 INFO L124 PetriNetUnfolderBase]: 52/1631 cut-off events. [2025-01-09 21:31:08,426 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-01-09 21:31:08,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1695 conditions, 1631 events. 52/1631 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 6134 event pairs, 20 based on Foata normal form. 0/1424 useless extension candidates. Maximal degree in co-relation 1652. Up to 50 conditions per place. [2025-01-09 21:31:08,444 INFO L140 encePairwiseOnDemand]: 1045/1048 looper letters, 13 selfloop transitions, 2 changer transitions 0/936 dead transitions. [2025-01-09 21:31:08,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 936 transitions, 1915 flow [2025-01-09 21:31:08,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:08,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:08,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3037 transitions. [2025-01-09 21:31:08,449 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9659669211195929 [2025-01-09 21:31:08,449 INFO L175 Difference]: Start difference. First operand has 929 places, 937 transitions, 1887 flow. Second operand 3 states and 3037 transitions. [2025-01-09 21:31:08,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 936 transitions, 1915 flow [2025-01-09 21:31:08,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 928 places, 936 transitions, 1911 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:08,457 INFO L231 Difference]: Finished difference. Result has 928 places, 936 transitions, 1885 flow [2025-01-09 21:31:08,458 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1048, PETRI_DIFFERENCE_MINUEND_FLOW=1881, PETRI_DIFFERENCE_MINUEND_PLACES=926, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=936, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=934, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1885, PETRI_PLACES=928, PETRI_TRANSITIONS=936} [2025-01-09 21:31:08,458 INFO L279 CegarLoopForPetriNet]: 993 programPoint places, -65 predicate places. [2025-01-09 21:31:08,459 INFO L471 AbstractCegarLoop]: Abstraction has has 928 places, 936 transitions, 1885 flow [2025-01-09 21:31:08,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1008.3333333333334) internal successors, (3025), 3 states have internal predecessors, (3025), 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,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:08,460 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] [2025-01-09 21:31:08,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:31:08,460 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 190 more)] === [2025-01-09 21:31:08,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:08,461 INFO L85 PathProgramCache]: Analyzing trace with hash -847771117, now seen corresponding path program 1 times [2025-01-09 21:31:08,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:08,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206559423] [2025-01-09 21:31:08,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:08,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:08,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 21:31:08,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 21:31:08,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:08,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:08,589 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:08,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:08,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206559423] [2025-01-09 21:31:08,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206559423] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:08,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:08,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:08,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508830347] [2025-01-09 21:31:08,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:08,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:08,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:08,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:08,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:08,803 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 919 out of 1048 [2025-01-09 21:31:08,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 928 places, 936 transitions, 1885 flow. Second operand has 3 states, 3 states have (on average 921.0) internal successors, (2763), 3 states have internal predecessors, (2763), 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,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:08,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 919 of 1048 [2025-01-09 21:31:08,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand