./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.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/popl20-prod-cons-eq.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 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:47,263 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:47,306 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:33:47,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:47,311 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:47,334 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:47,335 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:47,335 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:47,336 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:47,336 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:47,337 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:47,337 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:47,337 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:47,337 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:47,338 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:47,339 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:47,339 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:47,339 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:47,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:47,339 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:47,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:47,340 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:47,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:47,340 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:47,341 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:47,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:47,341 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 -> 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea [2025-01-09 21:33:47,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:47,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:47,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:47,574 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:47,575 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:47,576 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-01-09 21:33:48,686 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7eb96b109/d2f33431a3084379aa08d0da2b9a650d/FLAG6af49514b [2025-01-09 21:33:48,948 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:48,952 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2025-01-09 21:33:48,962 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7eb96b109/d2f33431a3084379aa08d0da2b9a650d/FLAG6af49514b [2025-01-09 21:33:48,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7eb96b109/d2f33431a3084379aa08d0da2b9a650d [2025-01-09 21:33:48,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:48,980 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:48,982 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:48,982 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:48,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:48,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:48" (1/1) ... [2025-01-09 21:33:48,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3249ac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:48, skipping insertion in model container [2025-01-09 21:33:48,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:48" (1/1) ... [2025-01-09 21:33:49,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:49,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:49,206 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:49,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:49,275 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:49,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49 WrapperNode [2025-01-09 21:33:49,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:49,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:49,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:49,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:49,282 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:33:49" (1/1) ... [2025-01-09 21:33:49,300 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:33:49" (1/1) ... [2025-01-09 21:33:49,344 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 817 [2025-01-09 21:33:49,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:49,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:49,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:49,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:49,353 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,362 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,362 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,378 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,380 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,384 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,386 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,391 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:49,392 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:49,392 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:49,392 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:49,393 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (1/1) ... [2025-01-09 21:33:49,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:49,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:49,425 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:33:49,431 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:33:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:49,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:49,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:49,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:49,448 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:33:49,564 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:49,565 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:50,471 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:50,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:51,106 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:51,109 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:51,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:51 BoogieIcfgContainer [2025-01-09 21:33:51,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:51,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:51,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:51,118 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:51,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:48" (1/3) ... [2025-01-09 21:33:51,119 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6825176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:51, skipping insertion in model container [2025-01-09 21:33:51,119 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:49" (2/3) ... [2025-01-09 21:33:51,120 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6825176e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:51, skipping insertion in model container [2025-01-09 21:33:51,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:51" (3/3) ... [2025-01-09 21:33:51,121 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2025-01-09 21:33:51,133 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:51,135 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-prod-cons-eq.wvr.c that has 4 procedures, 808 locations, 1 initial locations, 9 loop locations, and 133 error locations. [2025-01-09 21:33:51,135 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:51,303 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:51,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 817 places, 846 transitions, 1713 flow [2025-01-09 21:33:51,583 INFO L124 PetriNetUnfolderBase]: 39/843 cut-off events. [2025-01-09 21:33:51,584 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:51,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 856 conditions, 843 events. 39/843 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1579 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 599. Up to 2 conditions per place. [2025-01-09 21:33:51,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 817 places, 846 transitions, 1713 flow [2025-01-09 21:33:51,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 798 places, 826 transitions, 1670 flow [2025-01-09 21:33:51,618 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:51,629 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;@b08b19b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:51,630 INFO L334 AbstractCegarLoop]: Starting to check reachability of 234 error locations. [2025-01-09 21:33:51,635 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:51,636 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:33:51,636 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:51,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:51,637 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:33:51,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:51,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash 703921968, now seen corresponding path program 1 times [2025-01-09 21:33:51,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:51,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-01-09 21:33:51,647 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:51,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:51,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:33:51,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:33:51,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:51,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:51,791 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:33:51,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:51,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610469133] [2025-01-09 21:33:51,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610469133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:51,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:51,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:51,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532533799] [2025-01-09 21:33:51,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:51,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:51,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:51,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:51,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:51,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-01-09 21:33:51,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 826 transitions, 1670 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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:33:51,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:51,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-01-09 21:33:51,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:52,182 INFO L124 PetriNetUnfolderBase]: 58/1094 cut-off events. [2025-01-09 21:33:52,183 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-01-09 21:33:52,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1094 events. 58/1094 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3563 event pairs, 19 based on Foata normal form. 65/966 useless extension candidates. Maximal degree in co-relation 784. Up to 65 conditions per place. [2025-01-09 21:33:52,194 INFO L140 encePairwiseOnDemand]: 770/846 looper letters, 14 selfloop transitions, 2 changer transitions 12/752 dead transitions. [2025-01-09 21:33:52,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 752 transitions, 1554 flow [2025-01-09 21:33:52,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:52,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:52,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2349 transitions. [2025-01-09 21:33:52,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.925531914893617 [2025-01-09 21:33:52,217 INFO L175 Difference]: Start difference. First operand has 798 places, 826 transitions, 1670 flow. Second operand 3 states and 2349 transitions. [2025-01-09 21:33:52,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 752 transitions, 1554 flow [2025-01-09 21:33:52,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 752 transitions, 1542 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:52,238 INFO L231 Difference]: Finished difference. Result has 742 places, 740 transitions, 1490 flow [2025-01-09 21:33:52,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=742, PETRI_TRANSITIONS=740} [2025-01-09 21:33:52,247 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -56 predicate places. [2025-01-09 21:33:52,247 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 740 transitions, 1490 flow [2025-01-09 21:33:52,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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:33:52,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:52,249 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:52,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:52,250 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:52,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1230828262, now seen corresponding path program 1 times [2025-01-09 21:33:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:52,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741457299] [2025-01-09 21:33:52,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:52,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:52,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:33:52,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:33:52,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:52,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:52,314 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:33:52,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:52,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741457299] [2025-01-09 21:33:52,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741457299] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:52,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:52,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:52,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728030602] [2025-01-09 21:33:52,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:52,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:52,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:52,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:52,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:52,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 846 [2025-01-09 21:33:52,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 740 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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:33:52,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:52,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 846 [2025-01-09 21:33:52,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:52,642 INFO L124 PetriNetUnfolderBase]: 118/1177 cut-off events. [2025-01-09 21:33:52,642 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:33:52,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1177 events. 118/1177 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4364 event pairs, 67 based on Foata normal form. 0/984 useless extension candidates. Maximal degree in co-relation 1344. Up to 168 conditions per place. [2025-01-09 21:33:52,656 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 21 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2025-01-09 21:33:52,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 739 transitions, 1534 flow [2025-01-09 21:33:52,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:52,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2025-01-09 21:33:52,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8912529550827423 [2025-01-09 21:33:52,661 INFO L175 Difference]: Start difference. First operand has 742 places, 740 transitions, 1490 flow. Second operand 3 states and 2262 transitions. [2025-01-09 21:33:52,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 739 transitions, 1534 flow [2025-01-09 21:33:52,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 739 transitions, 1530 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:52,672 INFO L231 Difference]: Finished difference. Result has 729 places, 739 transitions, 1488 flow [2025-01-09 21:33:52,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=729, PETRI_TRANSITIONS=739} [2025-01-09 21:33:52,674 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -69 predicate places. [2025-01-09 21:33:52,674 INFO L471 AbstractCegarLoop]: Abstraction has has 729 places, 739 transitions, 1488 flow [2025-01-09 21:33:52,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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:33:52,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:52,677 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] [2025-01-09 21:33:52,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:52,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:52,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:52,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1790820578, now seen corresponding path program 1 times [2025-01-09 21:33:52,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:52,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816252366] [2025-01-09 21:33:52,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:52,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:52,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:33:52,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:33:52,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:52,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:52,737 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:33:52,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:52,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816252366] [2025-01-09 21:33:52,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816252366] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:52,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:52,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:52,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155133880] [2025-01-09 21:33:52,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:52,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:52,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:52,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:52,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:52,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 846 [2025-01-09 21:33:52,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 739 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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:33:52,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:52,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 846 [2025-01-09 21:33:52,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:53,003 INFO L124 PetriNetUnfolderBase]: 172/1301 cut-off events. [2025-01-09 21:33:53,004 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-01-09 21:33:53,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 1301 events. 172/1301 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 5338 event pairs, 99 based on Foata normal form. 0/1126 useless extension candidates. Maximal degree in co-relation 1564. Up to 235 conditions per place. [2025-01-09 21:33:53,018 INFO L140 encePairwiseOnDemand]: 837/846 looper letters, 27 selfloop transitions, 3 changer transitions 0/738 dead transitions. [2025-01-09 21:33:53,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 738 transitions, 1548 flow [2025-01-09 21:33:53,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:53,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:53,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2256 transitions. [2025-01-09 21:33:53,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2025-01-09 21:33:53,023 INFO L175 Difference]: Start difference. First operand has 729 places, 739 transitions, 1488 flow. Second operand 3 states and 2256 transitions. [2025-01-09 21:33:53,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 738 transitions, 1548 flow [2025-01-09 21:33:53,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 738 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:53,030 INFO L231 Difference]: Finished difference. Result has 723 places, 733 transitions, 1478 flow [2025-01-09 21:33:53,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=723, PETRI_TRANSITIONS=733} [2025-01-09 21:33:53,032 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -75 predicate places. [2025-01-09 21:33:53,032 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 733 transitions, 1478 flow [2025-01-09 21:33:53,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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:33:53,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:53,033 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:33:53,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:53,033 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:53,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:53,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1722490644, now seen corresponding path program 1 times [2025-01-09 21:33:53,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:53,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662451768] [2025-01-09 21:33:53,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:53,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:53,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:33:53,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:33:53,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:53,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:53,077 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:33:53,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:53,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662451768] [2025-01-09 21:33:53,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662451768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:53,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:53,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:53,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503269320] [2025-01-09 21:33:53,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:53,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:53,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:53,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:53,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:53,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 846 [2025-01-09 21:33:53,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 733 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:33:53,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:53,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 846 [2025-01-09 21:33:53,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:53,550 INFO L124 PetriNetUnfolderBase]: 418/2446 cut-off events. [2025-01-09 21:33:53,550 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2025-01-09 21:33:53,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 2446 events. 418/2446 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 13248 event pairs, 235 based on Foata normal form. 0/2000 useless extension candidates. Maximal degree in co-relation 1984. Up to 557 conditions per place. [2025-01-09 21:33:53,567 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 26 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2025-01-09 21:33:53,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 732 transitions, 1532 flow [2025-01-09 21:33:53,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:53,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2025-01-09 21:33:53,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8873128447596532 [2025-01-09 21:33:53,571 INFO L175 Difference]: Start difference. First operand has 723 places, 733 transitions, 1478 flow. Second operand 3 states and 2252 transitions. [2025-01-09 21:33:53,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 732 transitions, 1532 flow [2025-01-09 21:33:53,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 732 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:53,579 INFO L231 Difference]: Finished difference. Result has 722 places, 732 transitions, 1474 flow [2025-01-09 21:33:53,580 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=722, PETRI_TRANSITIONS=732} [2025-01-09 21:33:53,581 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -76 predicate places. [2025-01-09 21:33:53,581 INFO L471 AbstractCegarLoop]: Abstraction has has 722 places, 732 transitions, 1474 flow [2025-01-09 21:33:53,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:33:53,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:53,582 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:53,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:53,582 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:53,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:53,583 INFO L85 PathProgramCache]: Analyzing trace with hash 833908707, now seen corresponding path program 1 times [2025-01-09 21:33:53,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:53,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969718515] [2025-01-09 21:33:53,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:53,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:53,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-01-09 21:33:53,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-01-09 21:33:53,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:53,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:53,631 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:33:53,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:53,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969718515] [2025-01-09 21:33:53,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969718515] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:53,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:53,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:53,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127850546] [2025-01-09 21:33:53,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:53,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:53,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:53,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:53,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:53,655 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-01-09 21:33:53,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 732 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:33:53,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:53,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-01-09 21:33:53,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:53,799 INFO L124 PetriNetUnfolderBase]: 58/1053 cut-off events. [2025-01-09 21:33:53,799 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-01-09 21:33:53,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1053 events. 58/1053 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3331 event pairs, 19 based on Foata normal form. 0/901 useless extension candidates. Maximal degree in co-relation 1080. Up to 67 conditions per place. [2025-01-09 21:33:53,806 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2025-01-09 21:33:53,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 731 transitions, 1508 flow [2025-01-09 21:33:53,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:53,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-01-09 21:33:53,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-01-09 21:33:53,809 INFO L175 Difference]: Start difference. First operand has 722 places, 732 transitions, 1474 flow. Second operand 3 states and 2272 transitions. [2025-01-09 21:33:53,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 731 transitions, 1508 flow [2025-01-09 21:33:53,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 731 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:53,817 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1472 flow [2025-01-09 21:33:53,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-01-09 21:33:53,818 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-01-09 21:33:53,818 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1472 flow [2025-01-09 21:33:53,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:33:53,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:53,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:53,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:53,819 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:53,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:53,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1689701691, now seen corresponding path program 1 times [2025-01-09 21:33:53,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:53,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041060534] [2025-01-09 21:33:53,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:53,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:53,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:33:53,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:33:53,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:53,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:53,866 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:33:53,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:53,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041060534] [2025-01-09 21:33:53,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041060534] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:53,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:53,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:53,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823849360] [2025-01-09 21:33:53,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:53,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:53,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:53,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:53,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:53,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-01-09 21:33:53,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:33:53,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:53,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-01-09 21:33:53,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,053 INFO L124 PetriNetUnfolderBase]: 68/1036 cut-off events. [2025-01-09 21:33:54,053 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:33:54,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 1036 events. 68/1036 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3231 event pairs, 11 based on Foata normal form. 0/891 useless extension candidates. Maximal degree in co-relation 1077. Up to 47 conditions per place. [2025-01-09 21:33:54,061 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 21 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2025-01-09 21:33:54,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1536 flow [2025-01-09 21:33:54,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-01-09 21:33:54,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9003152088258471 [2025-01-09 21:33:54,065 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1472 flow. Second operand 3 states and 2285 transitions. [2025-01-09 21:33:54,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1536 flow [2025-01-09 21:33:54,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 737 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,074 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1484 flow [2025-01-09 21:33:54,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2025-01-09 21:33:54,076 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2025-01-09 21:33:54,076 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1484 flow [2025-01-09 21:33:54,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:33:54,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,078 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] [2025-01-09 21:33:54,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:54,078 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:54,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1776280805, now seen corresponding path program 1 times [2025-01-09 21:33:54,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732473965] [2025-01-09 21:33:54,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-01-09 21:33:54,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-01-09 21:33:54,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,127 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:33:54,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732473965] [2025-01-09 21:33:54,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732473965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402106251] [2025-01-09 21:33:54,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-01-09 21:33:54,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:33:54,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-01-09 21:33:54,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,404 INFO L124 PetriNetUnfolderBase]: 230/1671 cut-off events. [2025-01-09 21:33:54,404 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2025-01-09 21:33:54,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1671 events. 230/1671 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 8179 event pairs, 131 based on Foata normal form. 0/1390 useless extension candidates. Maximal degree in co-relation 1443. Up to 310 conditions per place. [2025-01-09 21:33:54,416 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 20 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2025-01-09 21:33:54,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 730 transitions, 1526 flow [2025-01-09 21:33:54,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-01-09 21:33:54,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928289992119779 [2025-01-09 21:33:54,420 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1484 flow. Second operand 3 states and 2266 transitions. [2025-01-09 21:33:54,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 730 transitions, 1526 flow [2025-01-09 21:33:54,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 730 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,427 INFO L231 Difference]: Finished difference. Result has 720 places, 730 transitions, 1480 flow [2025-01-09 21:33:54,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=720, PETRI_TRANSITIONS=730} [2025-01-09 21:33:54,429 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -78 predicate places. [2025-01-09 21:33:54,429 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 730 transitions, 1480 flow [2025-01-09 21:33:54,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:33:54,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,431 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] [2025-01-09 21:33:54,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:54,431 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:54,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,431 INFO L85 PathProgramCache]: Analyzing trace with hash -1509989760, now seen corresponding path program 1 times [2025-01-09 21:33:54,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588632509] [2025-01-09 21:33:54,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:33:54,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:33:54,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,468 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:33:54,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588632509] [2025-01-09 21:33:54,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588632509] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306956149] [2025-01-09 21:33:54,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-01-09 21:33:54,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 730 transitions, 1480 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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:33:54,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-01-09 21:33:54,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,652 INFO L124 PetriNetUnfolderBase]: 70/1098 cut-off events. [2025-01-09 21:33:54,652 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:33:54,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1098 events. 70/1098 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3753 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1148. Up to 86 conditions per place. [2025-01-09 21:33:54,678 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2025-01-09 21:33:54,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 729 transitions, 1514 flow [2025-01-09 21:33:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-01-09 21:33:54,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959810874704491 [2025-01-09 21:33:54,682 INFO L175 Difference]: Start difference. First operand has 720 places, 730 transitions, 1480 flow. Second operand 3 states and 2274 transitions. [2025-01-09 21:33:54,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 729 transitions, 1514 flow [2025-01-09 21:33:54,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 729 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,688 INFO L231 Difference]: Finished difference. Result has 719 places, 729 transitions, 1478 flow [2025-01-09 21:33:54,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=719, PETRI_TRANSITIONS=729} [2025-01-09 21:33:54,689 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -79 predicate places. [2025-01-09 21:33:54,690 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 729 transitions, 1478 flow [2025-01-09 21:33:54,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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:33:54,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,691 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] [2025-01-09 21:33:54,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:54,691 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:54,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1452816857, now seen corresponding path program 1 times [2025-01-09 21:33:54,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582134799] [2025-01-09 21:33:54,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:33:54,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:33:54,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,717 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:33:54,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582134799] [2025-01-09 21:33:54,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582134799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418273941] [2025-01-09 21:33:54,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,730 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-01-09 21:33:54,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 729 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:33:54,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-01-09 21:33:54,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,892 INFO L124 PetriNetUnfolderBase]: 110/1240 cut-off events. [2025-01-09 21:33:54,892 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:33:54,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1240 events. 110/1240 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4973 event pairs, 53 based on Foata normal form. 0/1047 useless extension candidates. Maximal degree in co-relation 1346. Up to 142 conditions per place. [2025-01-09 21:33:54,901 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2025-01-09 21:33:54,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 728 transitions, 1514 flow [2025-01-09 21:33:54,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-01-09 21:33:54,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-01-09 21:33:54,905 INFO L175 Difference]: Start difference. First operand has 719 places, 729 transitions, 1478 flow. Second operand 3 states and 2272 transitions. [2025-01-09 21:33:54,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 728 transitions, 1514 flow [2025-01-09 21:33:54,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 728 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,912 INFO L231 Difference]: Finished difference. Result has 718 places, 728 transitions, 1476 flow [2025-01-09 21:33:54,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=716, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=718, PETRI_TRANSITIONS=728} [2025-01-09 21:33:54,914 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -80 predicate places. [2025-01-09 21:33:54,914 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 728 transitions, 1476 flow [2025-01-09 21:33:54,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:33:54,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:54,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:54,916 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:54,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1166688216, now seen corresponding path program 1 times [2025-01-09 21:33:54,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261668562] [2025-01-09 21:33:54,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:33:54,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:33:54,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,969 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:33:54,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261668562] [2025-01-09 21:33:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261668562] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759407976] [2025-01-09 21:33:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 846 [2025-01-09 21:33:54,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 728 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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:33:54,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 846 [2025-01-09 21:33:54,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,243 INFO L124 PetriNetUnfolderBase]: 208/1516 cut-off events. [2025-01-09 21:33:55,243 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 21:33:55,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1516 events. 208/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7085 event pairs, 129 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 1797. Up to 291 conditions per place. [2025-01-09 21:33:55,255 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 21 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2025-01-09 21:33:55,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 727 transitions, 1520 flow [2025-01-09 21:33:55,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2025-01-09 21:33:55,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8920409771473601 [2025-01-09 21:33:55,259 INFO L175 Difference]: Start difference. First operand has 718 places, 728 transitions, 1476 flow. Second operand 3 states and 2264 transitions. [2025-01-09 21:33:55,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 727 transitions, 1520 flow [2025-01-09 21:33:55,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 727 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,267 INFO L231 Difference]: Finished difference. Result has 717 places, 727 transitions, 1474 flow [2025-01-09 21:33:55,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=717, PETRI_TRANSITIONS=727} [2025-01-09 21:33:55,268 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -81 predicate places. [2025-01-09 21:33:55,268 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 727 transitions, 1474 flow [2025-01-09 21:33:55,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 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:33:55,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,270 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] [2025-01-09 21:33:55,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:55,270 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:55,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1831843840, now seen corresponding path program 1 times [2025-01-09 21:33:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613969749] [2025-01-09 21:33:55,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:33:55,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:33:55,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,299 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:33:55,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613969749] [2025-01-09 21:33:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613969749] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890611276] [2025-01-09 21:33:55,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-01-09 21:33:55,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 727 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:33:55,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-01-09 21:33:55,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,506 INFO L124 PetriNetUnfolderBase]: 110/1238 cut-off events. [2025-01-09 21:33:55,506 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:33:55,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1238 events. 110/1238 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4926 event pairs, 53 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1331. Up to 145 conditions per place. [2025-01-09 21:33:55,514 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 20 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2025-01-09 21:33:55,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 726 transitions, 1516 flow [2025-01-09 21:33:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2025-01-09 21:33:55,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8928289992119779 [2025-01-09 21:33:55,517 INFO L175 Difference]: Start difference. First operand has 717 places, 727 transitions, 1474 flow. Second operand 3 states and 2266 transitions. [2025-01-09 21:33:55,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 726 transitions, 1516 flow [2025-01-09 21:33:55,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 726 transitions, 1512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,524 INFO L231 Difference]: Finished difference. Result has 716 places, 726 transitions, 1472 flow [2025-01-09 21:33:55,525 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=716, PETRI_TRANSITIONS=726} [2025-01-09 21:33:55,525 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -82 predicate places. [2025-01-09 21:33:55,525 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 726 transitions, 1472 flow [2025-01-09 21:33:55,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:33:55,526 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,526 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] [2025-01-09 21:33:55,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:55,526 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:55,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash -128467344, now seen corresponding path program 1 times [2025-01-09 21:33:55,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624292817] [2025-01-09 21:33:55,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:33:55,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:33:55,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,565 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:33:55,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624292817] [2025-01-09 21:33:55,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624292817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307917088] [2025-01-09 21:33:55,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-01-09 21:33:55,581 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 726 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:33:55,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-01-09 21:33:55,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,739 INFO L124 PetriNetUnfolderBase]: 110/1237 cut-off events. [2025-01-09 21:33:55,739 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:33:55,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1237 events. 110/1237 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4805 event pairs, 53 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1319. Up to 142 conditions per place. [2025-01-09 21:33:55,746 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2025-01-09 21:33:55,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 725 transitions, 1508 flow [2025-01-09 21:33:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-01-09 21:33:55,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-01-09 21:33:55,749 INFO L175 Difference]: Start difference. First operand has 716 places, 726 transitions, 1472 flow. Second operand 3 states and 2272 transitions. [2025-01-09 21:33:55,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 725 transitions, 1508 flow [2025-01-09 21:33:55,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 725 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,756 INFO L231 Difference]: Finished difference. Result has 715 places, 725 transitions, 1470 flow [2025-01-09 21:33:55,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=715, PETRI_TRANSITIONS=725} [2025-01-09 21:33:55,757 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -83 predicate places. [2025-01-09 21:33:55,757 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 725 transitions, 1470 flow [2025-01-09 21:33:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:33:55,758 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:55,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:55,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:55,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1964257085, now seen corresponding path program 1 times [2025-01-09 21:33:55,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896790788] [2025-01-09 21:33:55,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 21:33:55,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 21:33:55,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,790 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:33:55,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896790788] [2025-01-09 21:33:55,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896790788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43507277] [2025-01-09 21:33:55,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-01-09 21:33:55,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 725 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:33:55,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-01-09 21:33:55,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:56,326 INFO L124 PetriNetUnfolderBase]: 252/4879 cut-off events. [2025-01-09 21:33:56,326 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-01-09 21:33:56,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 4879 events. 252/4879 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 35882 event pairs, 79 based on Foata normal form. 0/3902 useless extension candidates. Maximal degree in co-relation 5033. Up to 214 conditions per place. [2025-01-09 21:33:56,355 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2025-01-09 21:33:56,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 723 transitions, 1500 flow [2025-01-09 21:33:56,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:56,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:56,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2025-01-09 21:33:56,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-01-09 21:33:56,358 INFO L175 Difference]: Start difference. First operand has 715 places, 725 transitions, 1470 flow. Second operand 3 states and 2277 transitions. [2025-01-09 21:33:56,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 723 transitions, 1500 flow [2025-01-09 21:33:56,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 723 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:56,365 INFO L231 Difference]: Finished difference. Result has 713 places, 723 transitions, 1464 flow [2025-01-09 21:33:56,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=713, PETRI_TRANSITIONS=723} [2025-01-09 21:33:56,366 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-01-09 21:33:56,366 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 723 transitions, 1464 flow [2025-01-09 21:33:56,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:33:56,367 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:56,367 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:33:56,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:56,367 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:56,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1685416925, now seen corresponding path program 1 times [2025-01-09 21:33:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:56,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906058863] [2025-01-09 21:33:56,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:56,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:33:56,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:33:56,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:56,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:56,420 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:33:56,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:56,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906058863] [2025-01-09 21:33:56,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906058863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:56,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:56,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:56,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178395552] [2025-01-09 21:33:56,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:56,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:56,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:56,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:56,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:56,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-01-09 21:33:56,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 723 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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:33:56,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:56,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-01-09 21:33:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:56,611 INFO L124 PetriNetUnfolderBase]: 190/1520 cut-off events. [2025-01-09 21:33:56,611 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-01-09 21:33:56,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1520 events. 190/1520 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7141 event pairs, 105 based on Foata normal form. 0/1265 useless extension candidates. Maximal degree in co-relation 1720. Up to 253 conditions per place. [2025-01-09 21:33:56,622 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 18 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2025-01-09 21:33:56,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 722 transitions, 1502 flow [2025-01-09 21:33:56,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:56,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2270 transitions. [2025-01-09 21:33:56,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944050433412135 [2025-01-09 21:33:56,625 INFO L175 Difference]: Start difference. First operand has 713 places, 723 transitions, 1464 flow. Second operand 3 states and 2270 transitions. [2025-01-09 21:33:56,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 722 transitions, 1502 flow [2025-01-09 21:33:56,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 722 transitions, 1501 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:56,633 INFO L231 Difference]: Finished difference. Result has 713 places, 722 transitions, 1465 flow [2025-01-09 21:33:56,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1461, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1465, PETRI_PLACES=713, PETRI_TRANSITIONS=722} [2025-01-09 21:33:56,635 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2025-01-09 21:33:56,635 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 722 transitions, 1465 flow [2025-01-09 21:33:56,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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:33:56,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:56,641 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:33:56,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:56,641 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:56,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash 233244284, now seen corresponding path program 1 times [2025-01-09 21:33:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814256325] [2025-01-09 21:33:56,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:56,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:56,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:33:56,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:33:56,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:56,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:57,133 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:33:57,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:57,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814256325] [2025-01-09 21:33:57,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814256325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:57,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:57,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:57,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189212600] [2025-01-09 21:33:57,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:57,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:57,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:57,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:57,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:57,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 846 [2025-01-09 21:33:57,553 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 722 transitions, 1465 flow. Second operand has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 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:33:57,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:57,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 846 [2025-01-09 21:33:57,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:58,981 INFO L124 PetriNetUnfolderBase]: 2081/10265 cut-off events. [2025-01-09 21:33:58,982 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-01-09 21:33:59,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13601 conditions, 10265 events. 2081/10265 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 91903 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13487. Up to 2842 conditions per place. [2025-01-09 21:33:59,026 INFO L140 encePairwiseOnDemand]: 822/846 looper letters, 78 selfloop transitions, 20 changer transitions 0/718 dead transitions. [2025-01-09 21:33:59,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 718 transitions, 1653 flow [2025-01-09 21:33:59,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:59,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4121 transitions. [2025-01-09 21:33:59,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8118597320724981 [2025-01-09 21:33:59,031 INFO L175 Difference]: Start difference. First operand has 713 places, 722 transitions, 1465 flow. Second operand 6 states and 4121 transitions. [2025-01-09 21:33:59,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 718 transitions, 1653 flow [2025-01-09 21:33:59,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 718 transitions, 1649 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:59,038 INFO L231 Difference]: Finished difference. Result has 712 places, 718 transitions, 1493 flow [2025-01-09 21:33:59,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1493, PETRI_PLACES=712, PETRI_TRANSITIONS=718} [2025-01-09 21:33:59,040 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -86 predicate places. [2025-01-09 21:33:59,040 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 718 transitions, 1493 flow [2025-01-09 21:33:59,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 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:33:59,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:59,041 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] [2025-01-09 21:33:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:59,042 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:33:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash -226544322, now seen corresponding path program 1 times [2025-01-09 21:33:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345815704] [2025-01-09 21:33:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:59,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 21:33:59,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:33:59,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:59,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:59,079 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:33:59,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345815704] [2025-01-09 21:33:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345815704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:59,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:59,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:59,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763083967] [2025-01-09 21:33:59,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:59,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:59,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:59,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:59,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:59,096 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 846 [2025-01-09 21:33:59,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 718 transitions, 1493 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:33:59,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:59,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 846 [2025-01-09 21:33:59,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,532 INFO L124 PetriNetUnfolderBase]: 681/9111 cut-off events. [2025-01-09 21:34:00,532 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2025-01-09 21:34:00,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9958 conditions, 9111 events. 681/9111 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 83977 event pairs, 287 based on Foata normal form. 0/7284 useless extension candidates. Maximal degree in co-relation 9894. Up to 689 conditions per place. [2025-01-09 21:34:00,575 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 24 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2025-01-09 21:34:00,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 712 transitions, 1531 flow [2025-01-09 21:34:00,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2253 transitions. [2025-01-09 21:34:00,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8877068557919622 [2025-01-09 21:34:00,579 INFO L175 Difference]: Start difference. First operand has 712 places, 718 transitions, 1493 flow. Second operand 3 states and 2253 transitions. [2025-01-09 21:34:00,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 712 transitions, 1531 flow [2025-01-09 21:34:00,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 712 transitions, 1491 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:00,586 INFO L231 Difference]: Finished difference. Result has 703 places, 712 transitions, 1443 flow [2025-01-09 21:34:00,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=703, PETRI_TRANSITIONS=712} [2025-01-09 21:34:00,587 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-01-09 21:34:00,587 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 712 transitions, 1443 flow [2025-01-09 21:34:00,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:34:00,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,588 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] [2025-01-09 21:34:00,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:34:00,588 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:00,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,589 INFO L85 PathProgramCache]: Analyzing trace with hash 35143548, now seen corresponding path program 1 times [2025-01-09 21:34:00,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930461410] [2025-01-09 21:34:00,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-01-09 21:34:00,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-01-09 21:34:00,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,634 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:34:00,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930461410] [2025-01-09 21:34:00,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930461410] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715264013] [2025-01-09 21:34:00,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-01-09 21:34:00,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 712 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:34:00,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-01-09 21:34:00,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:00,808 INFO L124 PetriNetUnfolderBase]: 131/1261 cut-off events. [2025-01-09 21:34:00,808 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-09 21:34:00,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1261 events. 131/1261 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4983 event pairs, 71 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 1379. Up to 175 conditions per place. [2025-01-09 21:34:00,818 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2025-01-09 21:34:00,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 711 transitions, 1479 flow [2025-01-09 21:34:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:00,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:00,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-01-09 21:34:00,821 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-01-09 21:34:00,821 INFO L175 Difference]: Start difference. First operand has 703 places, 712 transitions, 1443 flow. Second operand 3 states and 2272 transitions. [2025-01-09 21:34:00,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 711 transitions, 1479 flow [2025-01-09 21:34:00,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 711 transitions, 1478 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:00,829 INFO L231 Difference]: Finished difference. Result has 703 places, 711 transitions, 1444 flow [2025-01-09 21:34:00,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1444, PETRI_PLACES=703, PETRI_TRANSITIONS=711} [2025-01-09 21:34:00,830 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2025-01-09 21:34:00,830 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 711 transitions, 1444 flow [2025-01-09 21:34:00,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:34:00,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:00,831 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] [2025-01-09 21:34:00,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:34:00,831 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:00,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:00,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1198249281, now seen corresponding path program 1 times [2025-01-09 21:34:00,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:00,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71498498] [2025-01-09 21:34:00,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:00,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:00,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:34:00,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:34:00,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:00,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:00,874 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:34:00,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:00,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71498498] [2025-01-09 21:34:00,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71498498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:00,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:00,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:00,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443850111] [2025-01-09 21:34:00,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:00,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:00,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:00,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:00,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:00,881 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-01-09 21:34:00,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 711 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 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:34:00,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:00,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-01-09 21:34:00,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,072 INFO L124 PetriNetUnfolderBase]: 70/1071 cut-off events. [2025-01-09 21:34:01,072 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:34:01,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1071 events. 70/1071 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3575 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 83 conditions per place. [2025-01-09 21:34:01,076 INFO L140 encePairwiseOnDemand]: 844/846 looper letters, 14 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2025-01-09 21:34:01,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 710 transitions, 1472 flow [2025-01-09 21:34:01,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2283 transitions. [2025-01-09 21:34:01,079 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8995271867612293 [2025-01-09 21:34:01,079 INFO L175 Difference]: Start difference. First operand has 703 places, 711 transitions, 1444 flow. Second operand 3 states and 2283 transitions. [2025-01-09 21:34:01,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 710 transitions, 1472 flow [2025-01-09 21:34:01,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:01,085 INFO L231 Difference]: Finished difference. Result has 702 places, 710 transitions, 1440 flow [2025-01-09 21:34:01,086 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=702, PETRI_TRANSITIONS=710} [2025-01-09 21:34:01,086 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-01-09 21:34:01,087 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 710 transitions, 1440 flow [2025-01-09 21:34:01,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 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:34:01,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,087 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] [2025-01-09 21:34:01,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:34:01,087 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:01,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 2121844625, now seen corresponding path program 1 times [2025-01-09 21:34:01,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122526120] [2025-01-09 21:34:01,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 21:34:01,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 21:34:01,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,145 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:34:01,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122526120] [2025-01-09 21:34:01,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122526120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425739065] [2025-01-09 21:34:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-01-09 21:34:01,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 710 transitions, 1440 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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:34:01,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-01-09 21:34:01,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:01,286 INFO L124 PetriNetUnfolderBase]: 70/1070 cut-off events. [2025-01-09 21:34:01,287 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:34:01,291 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1070 events. 70/1070 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3599 event pairs, 27 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1080. Up to 85 conditions per place. [2025-01-09 21:34:01,294 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 15 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2025-01-09 21:34:01,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 709 transitions, 1472 flow [2025-01-09 21:34:01,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:01,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:01,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-01-09 21:34:01,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8967691095350669 [2025-01-09 21:34:01,297 INFO L175 Difference]: Start difference. First operand has 702 places, 710 transitions, 1440 flow. Second operand 3 states and 2276 transitions. [2025-01-09 21:34:01,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 709 transitions, 1472 flow [2025-01-09 21:34:01,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 709 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:01,305 INFO L231 Difference]: Finished difference. Result has 702 places, 709 transitions, 1441 flow [2025-01-09 21:34:01,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=702, PETRI_TRANSITIONS=709} [2025-01-09 21:34:01,306 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2025-01-09 21:34:01,306 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 709 transitions, 1441 flow [2025-01-09 21:34:01,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 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:34:01,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:01,307 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] [2025-01-09 21:34:01,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:34:01,307 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:01,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:01,307 INFO L85 PathProgramCache]: Analyzing trace with hash 294252691, now seen corresponding path program 1 times [2025-01-09 21:34:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002083774] [2025-01-09 21:34:01,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:01,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-01-09 21:34:01,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-01-09 21:34:01,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:01,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:01,417 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:34:01,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:01,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002083774] [2025-01-09 21:34:01,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002083774] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:01,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:01,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:01,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67765440] [2025-01-09 21:34:01,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:01,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:01,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:01,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:01,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:01,514 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 846 [2025-01-09 21:34:01,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 709 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 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:34:01,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:01,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 846 [2025-01-09 21:34:01,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,034 INFO L124 PetriNetUnfolderBase]: 2081/10172 cut-off events. [2025-01-09 21:34:03,034 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2025-01-09 21:34:03,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 10172 events. 2081/10172 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 90686 event pairs, 1421 based on Foata normal form. 0/8440 useless extension candidates. Maximal degree in co-relation 13369. Up to 2833 conditions per place. [2025-01-09 21:34:03,085 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 69 selfloop transitions, 2 changer transitions 0/708 dead transitions. [2025-01-09 21:34:03,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 708 transitions, 1581 flow [2025-01-09 21:34:03,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2171 transitions. [2025-01-09 21:34:03,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855397951142632 [2025-01-09 21:34:03,089 INFO L175 Difference]: Start difference. First operand has 702 places, 709 transitions, 1441 flow. Second operand 3 states and 2171 transitions. [2025-01-09 21:34:03,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 708 transitions, 1581 flow [2025-01-09 21:34:03,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 708 transitions, 1577 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:03,097 INFO L231 Difference]: Finished difference. Result has 701 places, 708 transitions, 1439 flow [2025-01-09 21:34:03,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2025-01-09 21:34:03,098 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -97 predicate places. [2025-01-09 21:34:03,098 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1439 flow [2025-01-09 21:34:03,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 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:34:03,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,099 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] [2025-01-09 21:34:03,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:34:03,099 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:03,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,100 INFO L85 PathProgramCache]: Analyzing trace with hash 678044130, now seen corresponding path program 1 times [2025-01-09 21:34:03,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145640920] [2025-01-09 21:34:03,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 241 statements into 1 equivalence classes. [2025-01-09 21:34:03,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 241 of 241 statements. [2025-01-09 21:34:03,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,158 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:34:03,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145640920] [2025-01-09 21:34:03,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145640920] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712711886] [2025-01-09 21:34:03,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-01-09 21:34:03,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1439 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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:34:03,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,171 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-01-09 21:34:03,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,390 INFO L124 PetriNetUnfolderBase]: 110/1209 cut-off events. [2025-01-09 21:34:03,390 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:34:03,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1209 events. 110/1209 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4368 event pairs, 53 based on Foata normal form. 0/1043 useless extension candidates. Maximal degree in co-relation 1387. Up to 141 conditions per place. [2025-01-09 21:34:03,398 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 16 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2025-01-09 21:34:03,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 707 transitions, 1473 flow [2025-01-09 21:34:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2025-01-09 21:34:03,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8959810874704491 [2025-01-09 21:34:03,402 INFO L175 Difference]: Start difference. First operand has 701 places, 708 transitions, 1439 flow. Second operand 3 states and 2274 transitions. [2025-01-09 21:34:03,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 707 transitions, 1473 flow [2025-01-09 21:34:03,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 707 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:03,414 INFO L231 Difference]: Finished difference. Result has 700 places, 707 transitions, 1437 flow [2025-01-09 21:34:03,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1433, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=700, PETRI_TRANSITIONS=707} [2025-01-09 21:34:03,415 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -98 predicate places. [2025-01-09 21:34:03,415 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 707 transitions, 1437 flow [2025-01-09 21:34:03,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 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:34:03,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,416 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] [2025-01-09 21:34:03,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:34:03,416 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:03,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,417 INFO L85 PathProgramCache]: Analyzing trace with hash -973351949, now seen corresponding path program 1 times [2025-01-09 21:34:03,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261970455] [2025-01-09 21:34:03,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 245 statements into 1 equivalence classes. [2025-01-09 21:34:03,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 245 of 245 statements. [2025-01-09 21:34:03,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,470 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:34:03,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261970455] [2025-01-09 21:34:03,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261970455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719563768] [2025-01-09 21:34:03,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 846 [2025-01-09 21:34:03,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 707 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 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:34:03,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 846 [2025-01-09 21:34:03,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:04,206 INFO L124 PetriNetUnfolderBase]: 252/4797 cut-off events. [2025-01-09 21:34:04,206 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2025-01-09 21:34:04,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 4797 events. 252/4797 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35629 event pairs, 79 based on Foata normal form. 0/3907 useless extension candidates. Maximal degree in co-relation 4960. Up to 220 conditions per place. [2025-01-09 21:34:04,231 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 22 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2025-01-09 21:34:04,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 702 transitions, 1473 flow [2025-01-09 21:34:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2259 transitions. [2025-01-09 21:34:04,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8900709219858156 [2025-01-09 21:34:04,234 INFO L175 Difference]: Start difference. First operand has 700 places, 707 transitions, 1437 flow. Second operand 3 states and 2259 transitions. [2025-01-09 21:34:04,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 702 transitions, 1473 flow [2025-01-09 21:34:04,236 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 702 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:04,240 INFO L231 Difference]: Finished difference. Result has 695 places, 702 transitions, 1425 flow [2025-01-09 21:34:04,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=695, PETRI_TRANSITIONS=702} [2025-01-09 21:34:04,241 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-01-09 21:34:04,241 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 702 transitions, 1425 flow [2025-01-09 21:34:04,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 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:34:04,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:04,241 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] [2025-01-09 21:34:04,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:34:04,242 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:04,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:04,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1446248647, now seen corresponding path program 1 times [2025-01-09 21:34:04,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:04,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108243983] [2025-01-09 21:34:04,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:04,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:04,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 266 statements into 1 equivalence classes. [2025-01-09 21:34:04,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 266 of 266 statements. [2025-01-09 21:34:04,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:04,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:04,290 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:34:04,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:04,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108243983] [2025-01-09 21:34:04,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108243983] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:04,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:04,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56365983] [2025-01-09 21:34:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:04,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:04,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:04,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:04,307 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 846 [2025-01-09 21:34:04,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 702 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:34:04,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:04,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 846 [2025-01-09 21:34:04,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:04,520 INFO L124 PetriNetUnfolderBase]: 110/1203 cut-off events. [2025-01-09 21:34:04,520 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:34:04,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1203 events. 110/1203 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4642 event pairs, 53 based on Foata normal form. 0/1045 useless extension candidates. Maximal degree in co-relation 1279. Up to 142 conditions per place. [2025-01-09 21:34:04,529 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 17 selfloop transitions, 2 changer transitions 0/701 dead transitions. [2025-01-09 21:34:04,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 701 transitions, 1461 flow [2025-01-09 21:34:04,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:04,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:04,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2025-01-09 21:34:04,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951930654058313 [2025-01-09 21:34:04,531 INFO L175 Difference]: Start difference. First operand has 695 places, 702 transitions, 1425 flow. Second operand 3 states and 2272 transitions. [2025-01-09 21:34:04,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 701 transitions, 1461 flow [2025-01-09 21:34:04,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 701 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:04,536 INFO L231 Difference]: Finished difference. Result has 695 places, 701 transitions, 1426 flow [2025-01-09 21:34:04,537 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=695, PETRI_TRANSITIONS=701} [2025-01-09 21:34:04,537 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-01-09 21:34:04,537 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 701 transitions, 1426 flow [2025-01-09 21:34:04,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 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:34:04,538 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:04,538 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] [2025-01-09 21:34:04,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:34:04,538 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:04,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash 844126145, now seen corresponding path program 1 times [2025-01-09 21:34:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841623147] [2025-01-09 21:34:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:04,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-09 21:34:04,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-09 21:34:04,554 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:04,554 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:04,582 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:34:04,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:04,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841623147] [2025-01-09 21:34:04,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841623147] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:04,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572647800] [2025-01-09 21:34:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:04,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:04,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:04,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-01-09 21:34:04,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 701 transitions, 1426 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:34:04,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:04,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-01-09 21:34:04,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:05,203 INFO L124 PetriNetUnfolderBase]: 293/5079 cut-off events. [2025-01-09 21:34:05,203 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-01-09 21:34:05,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 5079 events. 293/5079 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 37491 event pairs, 40 based on Foata normal form. 0/4166 useless extension candidates. Maximal degree in co-relation 5304. Up to 227 conditions per place. [2025-01-09 21:34:05,233 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 26 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2025-01-09 21:34:05,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 711 transitions, 1512 flow [2025-01-09 21:34:05,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:05,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:05,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-01-09 21:34:05,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9018912529550828 [2025-01-09 21:34:05,236 INFO L175 Difference]: Start difference. First operand has 695 places, 701 transitions, 1426 flow. Second operand 3 states and 2289 transitions. [2025-01-09 21:34:05,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 711 transitions, 1512 flow [2025-01-09 21:34:05,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 711 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:05,242 INFO L231 Difference]: Finished difference. Result has 694 places, 702 transitions, 1441 flow [2025-01-09 21:34:05,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=694, PETRI_TRANSITIONS=702} [2025-01-09 21:34:05,242 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-01-09 21:34:05,243 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 702 transitions, 1441 flow [2025-01-09 21:34:05,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:34:05,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:05,243 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] [2025-01-09 21:34:05,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:34:05,243 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:05,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:05,244 INFO L85 PathProgramCache]: Analyzing trace with hash -543519636, now seen corresponding path program 1 times [2025-01-09 21:34:05,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:05,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386895148] [2025-01-09 21:34:05,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:05,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:05,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 276 statements into 1 equivalence classes. [2025-01-09 21:34:05,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 276 of 276 statements. [2025-01-09 21:34:05,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:05,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386895148] [2025-01-09 21:34:05,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386895148] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:05,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834922027] [2025-01-09 21:34:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:05,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:05,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:05,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:05,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-01-09 21:34:05,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 702 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:34:05,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:05,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-01-09 21:34:05,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:06,101 INFO L124 PetriNetUnfolderBase]: 364/5532 cut-off events. [2025-01-09 21:34:06,101 INFO L125 PetriNetUnfolderBase]: For 183/225 co-relation queries the response was YES. [2025-01-09 21:34:06,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6060 conditions, 5532 events. 364/5532 cut-off events. For 183/225 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41743 event pairs, 54 based on Foata normal form. 0/4545 useless extension candidates. Maximal degree in co-relation 5945. Up to 301 conditions per place. [2025-01-09 21:34:06,123 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 27 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-01-09 21:34:06,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1540 flow [2025-01-09 21:34:06,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:06,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2025-01-09 21:34:06,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9018912529550828 [2025-01-09 21:34:06,127 INFO L175 Difference]: Start difference. First operand has 694 places, 702 transitions, 1441 flow. Second operand 3 states and 2289 transitions. [2025-01-09 21:34:06,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1540 flow [2025-01-09 21:34:06,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1540 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:06,133 INFO L231 Difference]: Finished difference. Result has 695 places, 704 transitions, 1474 flow [2025-01-09 21:34:06,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=695, PETRI_TRANSITIONS=704} [2025-01-09 21:34:06,134 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2025-01-09 21:34:06,134 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 704 transitions, 1474 flow [2025-01-09 21:34:06,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 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:34:06,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:06,135 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] [2025-01-09 21:34:06,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:34:06,135 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:06,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:06,136 INFO L85 PathProgramCache]: Analyzing trace with hash -18483459, now seen corresponding path program 1 times [2025-01-09 21:34:06,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:06,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424319207] [2025-01-09 21:34:06,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:06,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:06,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-01-09 21:34:06,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-01-09 21:34:06,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:06,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:06,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:06,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424319207] [2025-01-09 21:34:06,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424319207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:06,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:06,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118038570] [2025-01-09 21:34:06,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:06,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:06,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:06,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:06,186 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 846 [2025-01-09 21:34:06,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 704 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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:34:06,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:06,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 846 [2025-01-09 21:34:06,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:06,723 INFO L124 PetriNetUnfolderBase]: 281/4298 cut-off events. [2025-01-09 21:34:06,723 INFO L125 PetriNetUnfolderBase]: For 423/677 co-relation queries the response was YES. [2025-01-09 21:34:06,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 4298 events. 281/4298 cut-off events. For 423/677 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 29279 event pairs, 46 based on Foata normal form. 1/3569 useless extension candidates. Maximal degree in co-relation 4801. Up to 227 conditions per place. [2025-01-09 21:34:06,756 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 23 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2025-01-09 21:34:06,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 713 transitions, 1578 flow [2025-01-09 21:34:06,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:06,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2025-01-09 21:34:06,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9026792750197006 [2025-01-09 21:34:06,759 INFO L175 Difference]: Start difference. First operand has 695 places, 704 transitions, 1474 flow. Second operand 3 states and 2291 transitions. [2025-01-09 21:34:06,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 713 transitions, 1578 flow [2025-01-09 21:34:06,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 713 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:06,765 INFO L231 Difference]: Finished difference. Result has 697 places, 706 transitions, 1496 flow [2025-01-09 21:34:06,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=697, PETRI_TRANSITIONS=706} [2025-01-09 21:34:06,766 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-01-09 21:34:06,766 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 706 transitions, 1496 flow [2025-01-09 21:34:06,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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:34:06,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:06,766 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] [2025-01-09 21:34:06,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:34:06,766 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:06,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:06,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1167553245, now seen corresponding path program 1 times [2025-01-09 21:34:06,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:06,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517735865] [2025-01-09 21:34:06,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:06,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:06,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-09 21:34:06,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-09 21:34:06,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:06,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:06,811 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:34:06,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517735865] [2025-01-09 21:34:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517735865] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:06,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:06,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:06,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429039966] [2025-01-09 21:34:06,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:06,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:06,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:06,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:06,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:06,817 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-01-09 21:34:06,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 706 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 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:34:06,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:06,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-01-09 21:34:06,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:08,094 INFO L124 PetriNetUnfolderBase]: 616/9899 cut-off events. [2025-01-09 21:34:08,094 INFO L125 PetriNetUnfolderBase]: For 840/882 co-relation queries the response was YES. [2025-01-09 21:34:08,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11238 conditions, 9899 events. 616/9899 cut-off events. For 840/882 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 93120 event pairs, 78 based on Foata normal form. 0/8156 useless extension candidates. Maximal degree in co-relation 11122. Up to 300 conditions per place. [2025-01-09 21:34:08,137 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 30 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2025-01-09 21:34:08,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 717 transitions, 1620 flow [2025-01-09 21:34:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:08,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:08,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2025-01-09 21:34:08,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9022852639873916 [2025-01-09 21:34:08,139 INFO L175 Difference]: Start difference. First operand has 697 places, 706 transitions, 1496 flow. Second operand 3 states and 2290 transitions. [2025-01-09 21:34:08,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 717 transitions, 1620 flow [2025-01-09 21:34:08,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 717 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:08,145 INFO L231 Difference]: Finished difference. Result has 697 places, 705 transitions, 1494 flow [2025-01-09 21:34:08,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=697, PETRI_TRANSITIONS=705} [2025-01-09 21:34:08,146 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2025-01-09 21:34:08,146 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 705 transitions, 1494 flow [2025-01-09 21:34:08,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 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:34:08,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:08,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:08,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:34:08,147 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:08,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:08,147 INFO L85 PathProgramCache]: Analyzing trace with hash 290571340, now seen corresponding path program 1 times [2025-01-09 21:34:08,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:08,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393931883] [2025-01-09 21:34:08,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:08,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:08,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 21:34:08,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 21:34:08,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:08,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:08,219 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:34:08,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:08,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393931883] [2025-01-09 21:34:08,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393931883] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:08,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:08,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:08,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146612985] [2025-01-09 21:34:08,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:08,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:08,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:08,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:08,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:08,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 846 [2025-01-09 21:34:08,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 705 transitions, 1494 flow. Second operand has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 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:34:08,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:08,234 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 846 [2025-01-09 21:34:08,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:10,202 INFO L124 PetriNetUnfolderBase]: 802/11926 cut-off events. [2025-01-09 21:34:10,202 INFO L125 PetriNetUnfolderBase]: For 1105/1419 co-relation queries the response was YES. [2025-01-09 21:34:10,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13666 conditions, 11926 events. 802/11926 cut-off events. For 1105/1419 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 115286 event pairs, 89 based on Foata normal form. 2/9815 useless extension candidates. Maximal degree in co-relation 13549. Up to 609 conditions per place. [2025-01-09 21:34:10,276 INFO L140 encePairwiseOnDemand]: 842/846 looper letters, 36 selfloop transitions, 2 changer transitions 0/719 dead transitions. [2025-01-09 21:34:10,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 719 transitions, 1639 flow [2025-01-09 21:34:10,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:10,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:10,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2025-01-09 21:34:10,278 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9014972419227738 [2025-01-09 21:34:10,279 INFO L175 Difference]: Start difference. First operand has 697 places, 705 transitions, 1494 flow. Second operand 3 states and 2288 transitions. [2025-01-09 21:34:10,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 719 transitions, 1639 flow [2025-01-09 21:34:10,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 719 transitions, 1635 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:10,288 INFO L231 Difference]: Finished difference. Result has 696 places, 705 transitions, 1500 flow [2025-01-09 21:34:10,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=696, PETRI_TRANSITIONS=705} [2025-01-09 21:34:10,289 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -102 predicate places. [2025-01-09 21:34:10,289 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 705 transitions, 1500 flow [2025-01-09 21:34:10,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 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:34:10,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:10,290 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:10,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:34:10,290 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:10,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:10,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1930505246, now seen corresponding path program 1 times [2025-01-09 21:34:10,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:10,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259452033] [2025-01-09 21:34:10,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:10,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:10,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-09 21:34:10,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-09 21:34:10,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:10,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:10,354 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:34:10,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:10,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259452033] [2025-01-09 21:34:10,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259452033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:10,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:10,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:10,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330371371] [2025-01-09 21:34:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:10,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:10,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:10,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:10,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:10,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 846 [2025-01-09 21:34:10,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 705 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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:34:10,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:10,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 846 [2025-01-09 21:34:10,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:12,630 INFO L124 PetriNetUnfolderBase]: 1392/12996 cut-off events. [2025-01-09 21:34:12,630 INFO L125 PetriNetUnfolderBase]: For 2108/2200 co-relation queries the response was YES. [2025-01-09 21:34:12,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16433 conditions, 12996 events. 1392/12996 cut-off events. For 2108/2200 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 126420 event pairs, 139 based on Foata normal form. 5/10992 useless extension candidates. Maximal degree in co-relation 16315. Up to 1242 conditions per place. [2025-01-09 21:34:12,733 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 34 selfloop transitions, 2 changer transitions 5/713 dead transitions. [2025-01-09 21:34:12,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1627 flow [2025-01-09 21:34:12,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:12,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2025-01-09 21:34:12,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8940110323089047 [2025-01-09 21:34:12,735 INFO L175 Difference]: Start difference. First operand has 696 places, 705 transitions, 1500 flow. Second operand 3 states and 2269 transitions. [2025-01-09 21:34:12,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1627 flow [2025-01-09 21:34:12,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1627 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:12,743 INFO L231 Difference]: Finished difference. Result has 694 places, 696 transitions, 1481 flow [2025-01-09 21:34:12,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1481, PETRI_PLACES=694, PETRI_TRANSITIONS=696} [2025-01-09 21:34:12,744 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2025-01-09 21:34:12,744 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 696 transitions, 1481 flow [2025-01-09 21:34:12,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 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:34:12,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:12,745 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:12,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:34:12,745 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:12,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1206413554, now seen corresponding path program 1 times [2025-01-09 21:34:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153942022] [2025-01-09 21:34:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:12,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 303 statements into 1 equivalence classes. [2025-01-09 21:34:12,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 303 of 303 statements. [2025-01-09 21:34:12,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:12,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:12,916 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:34:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153942022] [2025-01-09 21:34:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153942022] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:12,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:34:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040124621] [2025-01-09 21:34:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:12,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:34:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:12,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:34:12,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:34:12,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 846 [2025-01-09 21:34:12,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 696 transitions, 1481 flow. Second operand has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 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:34:12,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:12,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 846 [2025-01-09 21:34:12,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:14,761 INFO L124 PetriNetUnfolderBase]: 745/11284 cut-off events. [2025-01-09 21:34:14,761 INFO L125 PetriNetUnfolderBase]: For 1331/1500 co-relation queries the response was YES. [2025-01-09 21:34:14,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13296 conditions, 11284 events. 745/11284 cut-off events. For 1331/1500 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 107178 event pairs, 100 based on Foata normal form. 0/9466 useless extension candidates. Maximal degree in co-relation 13176. Up to 271 conditions per place. [2025-01-09 21:34:14,855 INFO L140 encePairwiseOnDemand]: 839/846 looper letters, 35 selfloop transitions, 6 changer transitions 0/713 dead transitions. [2025-01-09 21:34:14,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 713 transitions, 1669 flow [2025-01-09 21:34:14,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:34:14,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:34:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3036 transitions. [2025-01-09 21:34:14,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8971631205673759 [2025-01-09 21:34:14,857 INFO L175 Difference]: Start difference. First operand has 694 places, 696 transitions, 1481 flow. Second operand 4 states and 3036 transitions. [2025-01-09 21:34:14,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 713 transitions, 1669 flow [2025-01-09 21:34:14,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 713 transitions, 1665 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:14,864 INFO L231 Difference]: Finished difference. Result has 691 places, 695 transitions, 1487 flow [2025-01-09 21:34:14,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1487, PETRI_PLACES=691, PETRI_TRANSITIONS=695} [2025-01-09 21:34:14,865 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2025-01-09 21:34:14,868 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 695 transitions, 1487 flow [2025-01-09 21:34:14,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 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:34:14,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:14,869 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:14,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:34:14,869 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:14,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:14,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1392224272, now seen corresponding path program 1 times [2025-01-09 21:34:14,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:14,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327525673] [2025-01-09 21:34:14,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:14,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:14,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-01-09 21:34:14,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-01-09 21:34:14,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:14,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:14,914 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:34:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327525673] [2025-01-09 21:34:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327525673] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881003988] [2025-01-09 21:34:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:14,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:14,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:14,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:14,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 846 [2025-01-09 21:34:14,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 695 transitions, 1487 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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:34:14,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:14,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 846 [2025-01-09 21:34:14,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:17,190 INFO L124 PetriNetUnfolderBase]: 2838/15314 cut-off events. [2025-01-09 21:34:17,191 INFO L125 PetriNetUnfolderBase]: For 5183/5263 co-relation queries the response was YES. [2025-01-09 21:34:17,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23253 conditions, 15314 events. 2838/15314 cut-off events. For 5183/5263 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 154383 event pairs, 112 based on Foata normal form. 0/13633 useless extension candidates. Maximal degree in co-relation 23132. Up to 3602 conditions per place. [2025-01-09 21:34:17,297 INFO L140 encePairwiseOnDemand]: 832/846 looper letters, 50 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2025-01-09 21:34:17,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 697 transitions, 1634 flow [2025-01-09 21:34:17,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:17,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:17,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2025-01-09 21:34:17,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778565799842396 [2025-01-09 21:34:17,299 INFO L175 Difference]: Start difference. First operand has 691 places, 695 transitions, 1487 flow. Second operand 3 states and 2228 transitions. [2025-01-09 21:34:17,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 697 transitions, 1634 flow [2025-01-09 21:34:17,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 697 transitions, 1620 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:34:17,306 INFO L231 Difference]: Finished difference. Result has 680 places, 685 transitions, 1466 flow [2025-01-09 21:34:17,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=680, PETRI_TRANSITIONS=685} [2025-01-09 21:34:17,307 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -118 predicate places. [2025-01-09 21:34:17,307 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 685 transitions, 1466 flow [2025-01-09 21:34:17,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 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:34:17,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:17,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:17,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:34:17,307 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:17,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:17,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1518495261, now seen corresponding path program 1 times [2025-01-09 21:34:17,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:17,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216548786] [2025-01-09 21:34:17,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:17,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:17,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 308 statements into 1 equivalence classes. [2025-01-09 21:34:17,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 308 of 308 statements. [2025-01-09 21:34:17,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:17,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:17,551 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:34:17,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:17,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216548786] [2025-01-09 21:34:17,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216548786] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:17,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:17,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:34:17,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793643647] [2025-01-09 21:34:17,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:17,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:34:17,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:17,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:34:17,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:34:17,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 846 [2025-01-09 21:34:17,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 685 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 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:34:17,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:17,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 846 [2025-01-09 21:34:17,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:19,203 INFO L124 PetriNetUnfolderBase]: 709/7349 cut-off events. [2025-01-09 21:34:19,203 INFO L125 PetriNetUnfolderBase]: For 1856/2637 co-relation queries the response was YES. [2025-01-09 21:34:19,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 7349 events. 709/7349 cut-off events. For 1856/2637 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 57069 event pairs, 269 based on Foata normal form. 20/6444 useless extension candidates. Maximal degree in co-relation 9561. Up to 740 conditions per place. [2025-01-09 21:34:19,277 INFO L140 encePairwiseOnDemand]: 835/846 looper letters, 94 selfloop transitions, 12 changer transitions 0/730 dead transitions. [2025-01-09 21:34:19,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 730 transitions, 1809 flow [2025-01-09 21:34:19,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:34:19,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:34:19,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6522 transitions. [2025-01-09 21:34:19,279 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8565799842395587 [2025-01-09 21:34:19,279 INFO L175 Difference]: Start difference. First operand has 680 places, 685 transitions, 1466 flow. Second operand 9 states and 6522 transitions. [2025-01-09 21:34:19,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 730 transitions, 1809 flow [2025-01-09 21:34:19,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 730 transitions, 1806 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:19,286 INFO L231 Difference]: Finished difference. Result has 690 places, 690 transitions, 1513 flow [2025-01-09 21:34:19,286 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=690, PETRI_TRANSITIONS=690} [2025-01-09 21:34:19,287 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2025-01-09 21:34:19,287 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 690 transitions, 1513 flow [2025-01-09 21:34:19,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 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:34:19,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:19,288 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:19,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:34:19,288 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:19,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash 838960192, now seen corresponding path program 1 times [2025-01-09 21:34:19,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:19,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475121537] [2025-01-09 21:34:19,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:19,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:19,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-01-09 21:34:19,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-01-09 21:34:19,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:19,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:19,679 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:34:19,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:19,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475121537] [2025-01-09 21:34:19,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475121537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:19,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:19,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:19,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264152970] [2025-01-09 21:34:19,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:19,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:19,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:19,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:19,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:19,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 846 [2025-01-09 21:34:19,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 690 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 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:34:19,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:19,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 846 [2025-01-09 21:34:19,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:24,850 INFO L124 PetriNetUnfolderBase]: 6544/29946 cut-off events. [2025-01-09 21:34:24,850 INFO L125 PetriNetUnfolderBase]: For 10787/10791 co-relation queries the response was YES. [2025-01-09 21:34:24,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47358 conditions, 29946 events. 6544/29946 cut-off events. For 10787/10791 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 330034 event pairs, 3852 based on Foata normal form. 0/26704 useless extension candidates. Maximal degree in co-relation 47231. Up to 9158 conditions per place. [2025-01-09 21:34:25,020 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 70 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2025-01-09 21:34:25,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 689 transitions, 1661 flow [2025-01-09 21:34:25,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4264 transitions. [2025-01-09 21:34:25,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8400315208825847 [2025-01-09 21:34:25,023 INFO L175 Difference]: Start difference. First operand has 690 places, 690 transitions, 1513 flow. Second operand 6 states and 4264 transitions. [2025-01-09 21:34:25,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 689 transitions, 1661 flow [2025-01-09 21:34:25,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 689 transitions, 1654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:25,032 INFO L231 Difference]: Finished difference. Result has 692 places, 689 transitions, 1514 flow [2025-01-09 21:34:25,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=692, PETRI_TRANSITIONS=689} [2025-01-09 21:34:25,033 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -106 predicate places. [2025-01-09 21:34:25,033 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 689 transitions, 1514 flow [2025-01-09 21:34:25,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 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:34:25,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:25,034 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:25,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:34:25,034 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:25,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:25,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1251076472, now seen corresponding path program 1 times [2025-01-09 21:34:25,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:25,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194718712] [2025-01-09 21:34:25,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:25,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 317 statements into 1 equivalence classes. [2025-01-09 21:34:25,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 317 of 317 statements. [2025-01-09 21:34:25,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:25,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:25,073 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:34:25,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:25,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194718712] [2025-01-09 21:34:25,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194718712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:25,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:25,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:25,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394897418] [2025-01-09 21:34:25,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:25,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:25,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:25,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:25,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:25,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-01-09 21:34:25,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 689 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 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:34:25,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:25,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-01-09 21:34:25,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:28,456 INFO L124 PetriNetUnfolderBase]: 1841/19498 cut-off events. [2025-01-09 21:34:28,456 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2025-01-09 21:34:28,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24420 conditions, 19498 events. 1841/19498 cut-off events. For 2966/2970 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 212704 event pairs, 212 based on Foata normal form. 0/17447 useless extension candidates. Maximal degree in co-relation 24297. Up to 1988 conditions per place. [2025-01-09 21:34:28,571 INFO L140 encePairwiseOnDemand]: 841/846 looper letters, 33 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2025-01-09 21:34:28,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 698 transitions, 1630 flow [2025-01-09 21:34:28,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:28,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:28,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2279 transitions. [2025-01-09 21:34:28,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8979511426319937 [2025-01-09 21:34:28,574 INFO L175 Difference]: Start difference. First operand has 692 places, 689 transitions, 1514 flow. Second operand 3 states and 2279 transitions. [2025-01-09 21:34:28,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 698 transitions, 1630 flow [2025-01-09 21:34:28,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 698 transitions, 1620 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:28,582 INFO L231 Difference]: Finished difference. Result has 687 places, 688 transitions, 1514 flow [2025-01-09 21:34:28,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=687, PETRI_TRANSITIONS=688} [2025-01-09 21:34:28,583 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -111 predicate places. [2025-01-09 21:34:28,583 INFO L471 AbstractCegarLoop]: Abstraction has has 687 places, 688 transitions, 1514 flow [2025-01-09 21:34:28,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 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:34:28,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:28,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:28,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:34:28,584 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:28,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:28,585 INFO L85 PathProgramCache]: Analyzing trace with hash 2052242389, now seen corresponding path program 1 times [2025-01-09 21:34:28,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:28,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18186703] [2025-01-09 21:34:28,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:28,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:28,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 323 statements into 1 equivalence classes. [2025-01-09 21:34:28,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 323 of 323 statements. [2025-01-09 21:34:28,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:28,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:29,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:34:29,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:29,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18186703] [2025-01-09 21:34:29,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18186703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:29,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:29,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:29,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346748371] [2025-01-09 21:34:29,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:29,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:29,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:29,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:29,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:29,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-01-09 21:34:29,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 688 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 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:34:29,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:29,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-01-09 21:34:29,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:31,180 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2930] L51-3-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][562], [406#L135-4true, Black: 894#true, 955#(= |#race~produce~0| 0), Black: 898#true, 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 594#L82true, Black: 909#true, 757#L95-1true, Black: 931#(<= ~n_produce~0 0), Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 90#L57true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-01-09 21:34:31,180 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2025-01-09 21:34:31,181 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-01-09 21:34:31,181 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2025-01-09 21:34:31,181 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-01-09 21:34:31,186 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2930] L51-3-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][562], [406#L135-4true, Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), Black: 898#true, 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), 757#L95-1true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 957#true, 90#L57true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-01-09 21:34:31,186 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2025-01-09 21:34:31,186 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-01-09 21:34:31,187 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-01-09 21:34:31,187 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2025-01-09 21:34:31,358 INFO L124 PetriNetUnfolderBase]: 678/8521 cut-off events. [2025-01-09 21:34:31,358 INFO L125 PetriNetUnfolderBase]: For 1683/2109 co-relation queries the response was YES. [2025-01-09 21:34:31,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 8521 events. 678/8521 cut-off events. For 1683/2109 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 70503 event pairs, 114 based on Foata normal form. 53/7656 useless extension candidates. Maximal degree in co-relation 10603. Up to 464 conditions per place. [2025-01-09 21:34:31,411 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 79 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2025-01-09 21:34:31,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 723 transitions, 1896 flow [2025-01-09 21:34:31,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:31,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4430 transitions. [2025-01-09 21:34:31,413 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8727344365642238 [2025-01-09 21:34:31,413 INFO L175 Difference]: Start difference. First operand has 687 places, 688 transitions, 1514 flow. Second operand 6 states and 4430 transitions. [2025-01-09 21:34:31,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 723 transitions, 1896 flow [2025-01-09 21:34:31,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 723 transitions, 1896 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:31,419 INFO L231 Difference]: Finished difference. Result has 691 places, 687 transitions, 1522 flow [2025-01-09 21:34:31,420 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1522, PETRI_PLACES=691, PETRI_TRANSITIONS=687} [2025-01-09 21:34:31,420 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2025-01-09 21:34:31,420 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 687 transitions, 1522 flow [2025-01-09 21:34:31,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 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:34:31,421 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:31,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:31,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:34:31,421 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:31,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:31,422 INFO L85 PathProgramCache]: Analyzing trace with hash 399181598, now seen corresponding path program 1 times [2025-01-09 21:34:31,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:31,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260064359] [2025-01-09 21:34:31,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:31,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:31,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 325 statements into 1 equivalence classes. [2025-01-09 21:34:31,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 325 of 325 statements. [2025-01-09 21:34:31,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:31,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:31,847 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:34:31,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:31,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260064359] [2025-01-09 21:34:31,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260064359] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:31,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:31,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:31,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179291988] [2025-01-09 21:34:31,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:31,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:31,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:31,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:32,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 846 [2025-01-09 21:34:32,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 687 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 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:34:32,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:32,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 846 [2025-01-09 21:34:32,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:35,705 INFO L124 PetriNetUnfolderBase]: 3558/18443 cut-off events. [2025-01-09 21:34:35,706 INFO L125 PetriNetUnfolderBase]: For 7268/7294 co-relation queries the response was YES. [2025-01-09 21:34:35,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29013 conditions, 18443 events. 3558/18443 cut-off events. For 7268/7294 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 187100 event pairs, 147 based on Foata normal form. 0/16999 useless extension candidates. Maximal degree in co-relation 28886. Up to 3586 conditions per place. [2025-01-09 21:34:35,847 INFO L140 encePairwiseOnDemand]: 838/846 looper letters, 101 selfloop transitions, 5 changer transitions 0/732 dead transitions. [2025-01-09 21:34:35,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 732 transitions, 1980 flow [2025-01-09 21:34:35,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4378 transitions. [2025-01-09 21:34:35,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8624901497241922 [2025-01-09 21:34:35,850 INFO L175 Difference]: Start difference. First operand has 691 places, 687 transitions, 1522 flow. Second operand 6 states and 4378 transitions. [2025-01-09 21:34:35,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 732 transitions, 1980 flow [2025-01-09 21:34:35,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 732 transitions, 1970 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:35,859 INFO L231 Difference]: Finished difference. Result has 688 places, 684 transitions, 1516 flow [2025-01-09 21:34:35,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1516, PETRI_PLACES=688, PETRI_TRANSITIONS=684} [2025-01-09 21:34:35,860 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2025-01-09 21:34:35,860 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 684 transitions, 1516 flow [2025-01-09 21:34:35,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 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:34:35,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:35,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:35,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:34:35,861 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1572215384, now seen corresponding path program 1 times [2025-01-09 21:34:35,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:35,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075036227] [2025-01-09 21:34:35,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:35,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-09 21:34:35,881 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-09 21:34:35,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:35,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:34:35,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:35,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075036227] [2025-01-09 21:34:35,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075036227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:35,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:35,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604006973] [2025-01-09 21:34:35,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:35,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:35,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:35,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:35,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:35,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 846 [2025-01-09 21:34:35,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 684 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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:34:35,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:35,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 846 [2025-01-09 21:34:35,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:37,296 INFO L124 PetriNetUnfolderBase]: 817/8647 cut-off events. [2025-01-09 21:34:37,297 INFO L125 PetriNetUnfolderBase]: For 2038/2413 co-relation queries the response was YES. [2025-01-09 21:34:37,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 8647 events. 817/8647 cut-off events. For 2038/2413 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 71898 event pairs, 270 based on Foata normal form. 14/7818 useless extension candidates. Maximal degree in co-relation 11337. Up to 789 conditions per place. [2025-01-09 21:34:37,386 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 35 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2025-01-09 21:34:37,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 692 transitions, 1642 flow [2025-01-09 21:34:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2025-01-09 21:34:37,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8947990543735225 [2025-01-09 21:34:37,388 INFO L175 Difference]: Start difference. First operand has 688 places, 684 transitions, 1516 flow. Second operand 3 states and 2271 transitions. [2025-01-09 21:34:37,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 692 transitions, 1642 flow [2025-01-09 21:34:37,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 692 transitions, 1632 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:37,396 INFO L231 Difference]: Finished difference. Result has 684 places, 683 transitions, 1508 flow [2025-01-09 21:34:37,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=684, PETRI_TRANSITIONS=683} [2025-01-09 21:34:37,397 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -114 predicate places. [2025-01-09 21:34:37,397 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 683 transitions, 1508 flow [2025-01-09 21:34:37,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 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:34:37,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:37,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:37,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:34:37,398 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:37,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:37,401 INFO L85 PathProgramCache]: Analyzing trace with hash 500680469, now seen corresponding path program 1 times [2025-01-09 21:34:37,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:37,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-01-09 21:34:37,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:37,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:37,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-01-09 21:34:37,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-01-09 21:34:37,428 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:37,428 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:37,775 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:34:37,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:37,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375609538] [2025-01-09 21:34:37,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375609538] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:37,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:37,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:37,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602139165] [2025-01-09 21:34:37,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:37,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:37,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:37,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:37,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:38,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-01-09 21:34:38,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 683 transitions, 1508 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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:34:38,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:38,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-01-09 21:34:38,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:40,172 INFO L124 PetriNetUnfolderBase]: 1570/10902 cut-off events. [2025-01-09 21:34:40,172 INFO L125 PetriNetUnfolderBase]: For 3362/3602 co-relation queries the response was YES. [2025-01-09 21:34:40,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15584 conditions, 10902 events. 1570/10902 cut-off events. For 3362/3602 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 96334 event pairs, 192 based on Foata normal form. 1/9980 useless extension candidates. Maximal degree in co-relation 15457. Up to 682 conditions per place. [2025-01-09 21:34:40,266 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 87 selfloop transitions, 5 changer transitions 0/726 dead transitions. [2025-01-09 21:34:40,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 726 transitions, 1902 flow [2025-01-09 21:34:40,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-01-09 21:34:40,269 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743104806934594 [2025-01-09 21:34:40,269 INFO L175 Difference]: Start difference. First operand has 684 places, 683 transitions, 1508 flow. Second operand 6 states and 4438 transitions. [2025-01-09 21:34:40,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 726 transitions, 1902 flow [2025-01-09 21:34:40,274 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 726 transitions, 1898 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:40,277 INFO L231 Difference]: Finished difference. Result has 686 places, 682 transitions, 1512 flow [2025-01-09 21:34:40,278 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=686, PETRI_TRANSITIONS=682} [2025-01-09 21:34:40,278 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -112 predicate places. [2025-01-09 21:34:40,278 INFO L471 AbstractCegarLoop]: Abstraction has has 686 places, 682 transitions, 1512 flow [2025-01-09 21:34:40,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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:34:40,279 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:40,279 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:40,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:34:40,280 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:40,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1136390879, now seen corresponding path program 1 times [2025-01-09 21:34:40,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:40,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286200270] [2025-01-09 21:34:40,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:40,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-01-09 21:34:40,301 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-01-09 21:34:40,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:40,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:34:40,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:40,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286200270] [2025-01-09 21:34:40,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286200270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:40,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:40,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:40,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26876230] [2025-01-09 21:34:40,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:40,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:40,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:40,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:40,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:40,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 846 [2025-01-09 21:34:40,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 682 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 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:34:40,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:40,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 846 [2025-01-09 21:34:40,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:43,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2930] L51-3-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][539], [406#L135-4true, Black: 894#true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 594#L82true, Black: 931#(<= ~n_produce~0 0), 757#L95-1true, Black: 909#true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 90#L57true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-01-09 21:34:43,990 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2025-01-09 21:34:43,990 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2025-01-09 21:34:43,990 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2025-01-09 21:34:43,990 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2025-01-09 21:34:44,004 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2930] L51-3-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][539], [406#L135-4true, Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), 911#(= |#race~update~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 909#true, 757#L95-1true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 90#L57true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-01-09 21:34:44,004 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2025-01-09 21:34:44,004 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2025-01-09 21:34:44,004 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2025-01-09 21:34:44,004 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2025-01-09 21:34:44,130 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2930] L51-3-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][539], [406#L135-4true, Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 911#(= |#race~update~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 835#true, Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), Black: 909#true, Black: 931#(<= ~n_produce~0 0), 757#L95-1true, Black: 939#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 937#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 978#true, 90#L57true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 860#(= |#race~n_produce~0| 0)]) [2025-01-09 21:34:44,130 INFO L294 olderBase$Statistics]: this new event has 530 ancestors and is cut-off event [2025-01-09 21:34:44,131 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2025-01-09 21:34:44,131 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is cut-off event [2025-01-09 21:34:44,131 INFO L297 olderBase$Statistics]: existing Event has 530 ancestors and is cut-off event [2025-01-09 21:34:44,287 INFO L124 PetriNetUnfolderBase]: 2318/17388 cut-off events. [2025-01-09 21:34:44,288 INFO L125 PetriNetUnfolderBase]: For 4375/4526 co-relation queries the response was YES. [2025-01-09 21:34:44,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24187 conditions, 17388 events. 2318/17388 cut-off events. For 4375/4526 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 180176 event pairs, 496 based on Foata normal form. 1/15828 useless extension candidates. Maximal degree in co-relation 24063. Up to 1506 conditions per place. [2025-01-09 21:34:44,434 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 86 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2025-01-09 21:34:44,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 725 transitions, 1904 flow [2025-01-09 21:34:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:44,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4443 transitions. [2025-01-09 21:34:44,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8752955082742316 [2025-01-09 21:34:44,437 INFO L175 Difference]: Start difference. First operand has 686 places, 682 transitions, 1512 flow. Second operand 6 states and 4443 transitions. [2025-01-09 21:34:44,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 725 transitions, 1904 flow [2025-01-09 21:34:44,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 725 transitions, 1894 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:44,448 INFO L231 Difference]: Finished difference. Result has 685 places, 681 transitions, 1510 flow [2025-01-09 21:34:44,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1510, PETRI_PLACES=685, PETRI_TRANSITIONS=681} [2025-01-09 21:34:44,449 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -113 predicate places. [2025-01-09 21:34:44,449 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 681 transitions, 1510 flow [2025-01-09 21:34:44,450 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 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:34:44,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:44,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:44,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:34:44,454 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:44,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash -1188771804, now seen corresponding path program 1 times [2025-01-09 21:34:44,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750433275] [2025-01-09 21:34:44,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:44,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 21:34:44,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 21:34:44,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:44,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:34:44,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:44,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750433275] [2025-01-09 21:34:44,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750433275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:44,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:44,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783238362] [2025-01-09 21:34:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:44,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:44,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:44,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:44,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:44,522 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 846 [2025-01-09 21:34:44,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 681 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 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:34:44,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:44,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 846 [2025-01-09 21:34:44,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:47,189 INFO L124 PetriNetUnfolderBase]: 2113/17880 cut-off events. [2025-01-09 21:34:47,189 INFO L125 PetriNetUnfolderBase]: For 3810/3906 co-relation queries the response was YES. [2025-01-09 21:34:47,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24033 conditions, 17880 events. 2113/17880 cut-off events. For 3810/3906 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 187496 event pairs, 699 based on Foata normal form. 3/16373 useless extension candidates. Maximal degree in co-relation 23908. Up to 1921 conditions per place. [2025-01-09 21:34:47,347 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 34 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2025-01-09 21:34:47,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 691 transitions, 1633 flow [2025-01-09 21:34:47,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2025-01-09 21:34:47,348 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8967691095350669 [2025-01-09 21:34:47,348 INFO L175 Difference]: Start difference. First operand has 685 places, 681 transitions, 1510 flow. Second operand 3 states and 2276 transitions. [2025-01-09 21:34:47,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 691 transitions, 1633 flow [2025-01-09 21:34:47,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 691 transitions, 1623 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:47,357 INFO L231 Difference]: Finished difference. Result has 681 places, 680 transitions, 1502 flow [2025-01-09 21:34:47,358 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=681, PETRI_TRANSITIONS=680} [2025-01-09 21:34:47,358 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-01-09 21:34:47,358 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 680 transitions, 1502 flow [2025-01-09 21:34:47,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 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:34:47,359 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:47,359 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:47,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 21:34:47,359 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:47,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1647184718, now seen corresponding path program 1 times [2025-01-09 21:34:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:47,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98040058] [2025-01-09 21:34:47,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:47,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 21:34:47,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 21:34:47,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:47,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:47,782 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 21:34:47,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:47,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98040058] [2025-01-09 21:34:47,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98040058] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:47,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:47,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:34:47,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370391621] [2025-01-09 21:34:47,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:47,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:34:47,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:47,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:34:47,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:34:48,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 846 [2025-01-09 21:34:48,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 680 transitions, 1502 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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:34:48,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:48,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 846 [2025-01-09 21:34:48,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:49,770 INFO L124 PetriNetUnfolderBase]: 1115/8959 cut-off events. [2025-01-09 21:34:49,770 INFO L125 PetriNetUnfolderBase]: For 2413/2633 co-relation queries the response was YES. [2025-01-09 21:34:49,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12388 conditions, 8959 events. 1115/8959 cut-off events. For 2413/2633 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 74532 event pairs, 147 based on Foata normal form. 1/8255 useless extension candidates. Maximal degree in co-relation 12261. Up to 562 conditions per place. [2025-01-09 21:34:49,834 INFO L140 encePairwiseOnDemand]: 840/846 looper letters, 87 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2025-01-09 21:34:49,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 723 transitions, 1896 flow [2025-01-09 21:34:49,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:34:49,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:34:49,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2025-01-09 21:34:49,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743104806934594 [2025-01-09 21:34:49,836 INFO L175 Difference]: Start difference. First operand has 681 places, 680 transitions, 1502 flow. Second operand 6 states and 4438 transitions. [2025-01-09 21:34:49,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 723 transitions, 1896 flow [2025-01-09 21:34:49,840 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 723 transitions, 1892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:49,843 INFO L231 Difference]: Finished difference. Result has 683 places, 679 transitions, 1506 flow [2025-01-09 21:34:49,844 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1506, PETRI_PLACES=683, PETRI_TRANSITIONS=679} [2025-01-09 21:34:49,844 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -115 predicate places. [2025-01-09 21:34:49,844 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 679 transitions, 1506 flow [2025-01-09 21:34:49,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 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:34:49,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:49,845 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:49,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 21:34:49,845 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:49,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:49,846 INFO L85 PathProgramCache]: Analyzing trace with hash -881382859, now seen corresponding path program 1 times [2025-01-09 21:34:49,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:49,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975039010] [2025-01-09 21:34:49,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:49,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:49,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 21:34:49,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 21:34:49,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:49,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:49,897 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:34:49,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:49,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975039010] [2025-01-09 21:34:49,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975039010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:49,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:49,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508259774] [2025-01-09 21:34:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:49,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:49,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:49,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:49,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:49,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 846 [2025-01-09 21:34:49,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 679 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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:34:49,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:49,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 846 [2025-01-09 21:34:49,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:53,207 INFO L124 PetriNetUnfolderBase]: 2817/17591 cut-off events. [2025-01-09 21:34:53,207 INFO L125 PetriNetUnfolderBase]: For 5555/5623 co-relation queries the response was YES. [2025-01-09 21:34:53,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25836 conditions, 17591 events. 2817/17591 cut-off events. For 5555/5623 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 181066 event pairs, 1205 based on Foata normal form. 0/16104 useless extension candidates. Maximal degree in co-relation 25711. Up to 3365 conditions per place. [2025-01-09 21:34:53,284 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 43 selfloop transitions, 2 changer transitions 0/689 dead transitions. [2025-01-09 21:34:53,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 689 transitions, 1647 flow [2025-01-09 21:34:53,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2263 transitions. [2025-01-09 21:34:53,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8916469661150512 [2025-01-09 21:34:53,286 INFO L175 Difference]: Start difference. First operand has 683 places, 679 transitions, 1506 flow. Second operand 3 states and 2263 transitions. [2025-01-09 21:34:53,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 689 transitions, 1647 flow [2025-01-09 21:34:53,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 689 transitions, 1637 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:34:53,294 INFO L231 Difference]: Finished difference. Result has 679 places, 678 transitions, 1498 flow [2025-01-09 21:34:53,294 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1494, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1498, PETRI_PLACES=679, PETRI_TRANSITIONS=678} [2025-01-09 21:34:53,294 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -119 predicate places. [2025-01-09 21:34:53,294 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 678 transitions, 1498 flow [2025-01-09 21:34:53,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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:34:53,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:53,295 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:53,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 21:34:53,295 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err32ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:53,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:53,296 INFO L85 PathProgramCache]: Analyzing trace with hash -774522938, now seen corresponding path program 1 times [2025-01-09 21:34:53,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:53,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766292223] [2025-01-09 21:34:53,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:53,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:53,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-01-09 21:34:53,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-01-09 21:34:53,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:53,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:53,350 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 21:34:53,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:53,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766292223] [2025-01-09 21:34:53,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766292223] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:53,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:53,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:53,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599826800] [2025-01-09 21:34:53,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:53,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:53,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:53,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:53,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:53,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 846 [2025-01-09 21:34:53,361 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 678 transitions, 1498 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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:34:53,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:53,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 846 [2025-01-09 21:34:53,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:56,048 INFO L124 PetriNetUnfolderBase]: 985/15168 cut-off events. [2025-01-09 21:34:56,048 INFO L125 PetriNetUnfolderBase]: For 1628/1776 co-relation queries the response was YES. [2025-01-09 21:34:56,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17831 conditions, 15168 events. 985/15168 cut-off events. For 1628/1776 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 151848 event pairs, 81 based on Foata normal form. 5/14044 useless extension candidates. Maximal degree in co-relation 17707. Up to 634 conditions per place. [2025-01-09 21:34:56,182 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 33 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2025-01-09 21:34:56,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 692 transitions, 1642 flow [2025-01-09 21:34:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:56,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:56,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2292 transitions. [2025-01-09 21:34:56,187 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9030732860520094 [2025-01-09 21:34:56,187 INFO L175 Difference]: Start difference. First operand has 679 places, 678 transitions, 1498 flow. Second operand 3 states and 2292 transitions. [2025-01-09 21:34:56,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 692 transitions, 1642 flow [2025-01-09 21:34:56,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 692 transitions, 1638 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:56,195 INFO L231 Difference]: Finished difference. Result has 679 places, 679 transitions, 1508 flow [2025-01-09 21:34:56,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1492, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=677, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=679, PETRI_TRANSITIONS=679} [2025-01-09 21:34:56,196 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -119 predicate places. [2025-01-09 21:34:56,196 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 679 transitions, 1508 flow [2025-01-09 21:34:56,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 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:34:56,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:56,196 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:56,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 21:34:56,196 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:56,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:56,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1581228743, now seen corresponding path program 1 times [2025-01-09 21:34:56,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:56,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030012513] [2025-01-09 21:34:56,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:56,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:56,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 21:34:56,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 21:34:56,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:56,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 21:34:56,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:56,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030012513] [2025-01-09 21:34:56,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030012513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:56,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:56,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:56,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176362394] [2025-01-09 21:34:56,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:56,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:56,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:56,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:56,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:56,417 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 731 out of 846 [2025-01-09 21:34:56,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 679 transitions, 1508 flow. Second operand has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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:34:56,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:56,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 731 of 846 [2025-01-09 21:34:56,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:59,188 INFO L124 PetriNetUnfolderBase]: 1177/16318 cut-off events. [2025-01-09 21:34:59,189 INFO L125 PetriNetUnfolderBase]: For 2099/2247 co-relation queries the response was YES. [2025-01-09 21:34:59,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19644 conditions, 16318 events. 1177/16318 cut-off events. For 2099/2247 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 166511 event pairs, 222 based on Foata normal form. 1/15149 useless extension candidates. Maximal degree in co-relation 19517. Up to 767 conditions per place. [2025-01-09 21:34:59,324 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 56 selfloop transitions, 2 changer transitions 0/690 dead transitions. [2025-01-09 21:34:59,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 690 transitions, 1679 flow [2025-01-09 21:34:59,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:59,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:59,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2025-01-09 21:34:59,326 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8825847123719465 [2025-01-09 21:34:59,326 INFO L175 Difference]: Start difference. First operand has 679 places, 679 transitions, 1508 flow. Second operand 3 states and 2240 transitions. [2025-01-09 21:34:59,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 690 transitions, 1679 flow [2025-01-09 21:34:59,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 690 transitions, 1679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:34:59,334 INFO L231 Difference]: Finished difference. Result has 681 places, 679 transitions, 1516 flow [2025-01-09 21:34:59,334 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1516, PETRI_PLACES=681, PETRI_TRANSITIONS=679} [2025-01-09 21:34:59,335 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-01-09 21:34:59,335 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 679 transitions, 1516 flow [2025-01-09 21:34:59,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 734.3333333333334) internal successors, (2203), 3 states have internal predecessors, (2203), 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:34:59,335 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:59,335 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:59,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 21:34:59,336 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread3Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2025-01-09 21:34:59,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:59,337 INFO L85 PathProgramCache]: Analyzing trace with hash 580392842, now seen corresponding path program 1 times [2025-01-09 21:34:59,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:59,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114209545] [2025-01-09 21:34:59,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:59,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:59,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 419 statements into 1 equivalence classes. [2025-01-09 21:34:59,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 419 of 419 statements. [2025-01-09 21:34:59,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:59,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:59,400 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-01-09 21:34:59,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:59,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114209545] [2025-01-09 21:34:59,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114209545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:59,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:59,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634464030] [2025-01-09 21:34:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:59,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:59,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:59,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:59,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 846 [2025-01-09 21:34:59,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 679 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 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:34:59,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:59,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 846 [2025-01-09 21:34:59,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:35:03,157 INFO L124 PetriNetUnfolderBase]: 1572/21035 cut-off events. [2025-01-09 21:35:03,157 INFO L125 PetriNetUnfolderBase]: For 2698/2747 co-relation queries the response was YES. [2025-01-09 21:35:03,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25626 conditions, 21035 events. 1572/21035 cut-off events. For 2698/2747 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 222487 event pairs, 347 based on Foata normal form. 1/19689 useless extension candidates. Maximal degree in co-relation 25500. Up to 1134 conditions per place. [2025-01-09 21:35:03,253 INFO L140 encePairwiseOnDemand]: 843/846 looper letters, 0 selfloop transitions, 0 changer transitions 689/689 dead transitions. [2025-01-09 21:35:03,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 689 transitions, 1637 flow [2025-01-09 21:35:03,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:35:03,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:35:03,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2025-01-09 21:35:03,254 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9003152088258471 [2025-01-09 21:35:03,254 INFO L175 Difference]: Start difference. First operand has 681 places, 679 transitions, 1516 flow. Second operand 3 states and 2285 transitions. [2025-01-09 21:35:03,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 689 transitions, 1637 flow [2025-01-09 21:35:03,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 689 transitions, 1635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:35:03,260 INFO L231 Difference]: Finished difference. Result has 681 places, 0 transitions, 0 flow [2025-01-09 21:35:03,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=846, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=678, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=681, PETRI_TRANSITIONS=0} [2025-01-09 21:35:03,261 INFO L279 CegarLoopForPetriNet]: 798 programPoint places, -117 predicate places. [2025-01-09 21:35:03,261 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 0 transitions, 0 flow [2025-01-09 21:35:03,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 756.3333333333334) internal successors, (2269), 3 states have internal predecessors, (2269), 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:35:03,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (233 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (232 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (231 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (230 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (229 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (228 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (227 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (226 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (225 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (224 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (223 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (222 of 234 remaining) [2025-01-09 21:35:03,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (221 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (220 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (219 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (218 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (217 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (216 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (215 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (214 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (213 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (212 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (211 of 234 remaining) [2025-01-09 21:35:03,268 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (210 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (209 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (208 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (207 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (206 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (205 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (204 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (203 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (202 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (201 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (200 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (199 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (198 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (197 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (196 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (195 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (194 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (193 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (192 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (191 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (190 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (189 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (188 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (187 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (186 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (185 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (184 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (183 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (182 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (181 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (180 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (179 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (178 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (177 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (176 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (175 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (174 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (173 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (172 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (171 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (170 of 234 remaining) [2025-01-09 21:35:03,269 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (169 of 234 remaining) [2025-01-09 21:35:03,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (168 of 234 remaining) [2025-01-09 21:35:03,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (167 of 234 remaining) [2025-01-09 21:35:03,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (166 of 234 remaining) [2025-01-09 21:35:03,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (165 of 234 remaining) [2025-01-09 21:35:03,270 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (164 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (163 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (162 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (161 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (160 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (159 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (158 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (157 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (156 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (155 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (154 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (153 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (152 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (151 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (150 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (149 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (148 of 234 remaining) [2025-01-09 21:35:03,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (147 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err25ASSERT_VIOLATIONDATA_RACE (146 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err26ASSERT_VIOLATIONDATA_RACE (145 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err27ASSERT_VIOLATIONDATA_RACE (144 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err28ASSERT_VIOLATIONDATA_RACE (143 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err29ASSERT_VIOLATIONDATA_RACE (142 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err30ASSERT_VIOLATIONDATA_RACE (141 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err31ASSERT_VIOLATIONDATA_RACE (140 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err32ASSERT_VIOLATIONDATA_RACE (139 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err33ASSERT_VIOLATIONDATA_RACE (138 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err34ASSERT_VIOLATIONDATA_RACE (137 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err35ASSERT_VIOLATIONDATA_RACE (136 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (135 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (134 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (133 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (132 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (131 of 234 remaining) [2025-01-09 21:35:03,272 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (130 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (129 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (128 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (127 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (126 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (125 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (124 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (123 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (122 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (121 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (120 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (119 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (118 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (117 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (116 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (115 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (114 of 234 remaining) [2025-01-09 21:35:03,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (113 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (112 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (111 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (110 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (109 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (108 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (107 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (106 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (105 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE (104 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE (103 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (102 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE (101 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (100 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (99 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (98 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (97 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (96 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (95 of 234 remaining) [2025-01-09 21:35:03,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (94 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (93 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (92 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (91 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (90 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (89 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (88 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (87 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (86 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (85 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (84 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (83 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (82 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (81 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (80 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (79 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (78 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (77 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (76 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (75 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (74 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (73 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (72 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (71 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (70 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (69 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (68 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (67 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (66 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (65 of 234 remaining) [2025-01-09 21:35:03,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (64 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (63 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (62 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (58 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (56 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (55 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (54 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (53 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (52 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (51 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (50 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (49 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (48 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (47 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (46 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (45 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (44 of 234 remaining) [2025-01-09 21:35:03,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (43 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (42 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err24ASSERT_VIOLATIONDATA_RACE (41 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err25ASSERT_VIOLATIONDATA_RACE (40 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err26ASSERT_VIOLATIONDATA_RACE (39 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err27ASSERT_VIOLATIONDATA_RACE (38 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err28ASSERT_VIOLATIONDATA_RACE (37 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err29ASSERT_VIOLATIONDATA_RACE (36 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (35 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (34 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (33 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (32 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (31 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (30 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (29 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (28 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (27 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (26 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (25 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (24 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (23 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (22 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (21 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (20 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (19 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (18 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (17 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (16 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (15 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (14 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONDATA_RACE (13 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONDATA_RACE (12 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err24ASSERT_VIOLATIONDATA_RACE (11 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err25ASSERT_VIOLATIONDATA_RACE (10 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err26ASSERT_VIOLATIONDATA_RACE (9 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err27ASSERT_VIOLATIONDATA_RACE (8 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err28ASSERT_VIOLATIONDATA_RACE (7 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err29ASSERT_VIOLATIONDATA_RACE (6 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err30ASSERT_VIOLATIONDATA_RACE (5 of 234 remaining) [2025-01-09 21:35:03,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err31ASSERT_VIOLATIONDATA_RACE (4 of 234 remaining) [2025-01-09 21:35:03,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err32ASSERT_VIOLATIONDATA_RACE (3 of 234 remaining) [2025-01-09 21:35:03,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err33ASSERT_VIOLATIONDATA_RACE (2 of 234 remaining) [2025-01-09 21:35:03,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err34ASSERT_VIOLATIONDATA_RACE (1 of 234 remaining) [2025-01-09 21:35:03,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err35ASSERT_VIOLATIONDATA_RACE (0 of 234 remaining) [2025-01-09 21:35:03,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 21:35:03,279 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35:03,284 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:35:03,285 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:35:03,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:35:03 BasicIcfg [2025-01-09 21:35:03,289 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:35:03,289 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:35:03,289 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:35:03,290 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:35:03,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:51" (3/4) ... [2025-01-09 21:35:03,293 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:35:03,295 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:35:03,295 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:35:03,295 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:35:03,305 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2025-01-09 21:35:03,308 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:35:03,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:35:03,309 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:35:03,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:35:03,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:35:03,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:35:03,392 INFO L158 Benchmark]: Toolchain (without parser) took 74411.77ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 112.5MB in the beginning and 2.2GB in the end (delta: -2.1GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-01-09 21:35:03,393 INFO L158 Benchmark]: CDTParser took 1.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:35:03,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 294.95ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 96.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:35:03,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.90ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 91.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:35:03,393 INFO L158 Benchmark]: Boogie Preprocessor took 46.19ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 86.6MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:35:03,393 INFO L158 Benchmark]: RCFGBuilder took 1717.19ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 60.3MB in the end (delta: 26.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2025-01-09 21:35:03,394 INFO L158 Benchmark]: TraceAbstraction took 72177.85ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 60.3MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2025-01-09 21:35:03,394 INFO L158 Benchmark]: Witness Printer took 102.03ms. Allocated memory is still 4.1GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:35:03,395 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.17ms. Allocated memory is still 201.3MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 294.95ms. Allocated memory is still 142.6MB. Free memory was 112.5MB in the beginning and 96.9MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.90ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 91.4MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.19ms. Allocated memory is still 142.6MB. Free memory was 91.4MB in the beginning and 86.6MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1717.19ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 60.3MB in the end (delta: 26.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * TraceAbstraction took 72177.85ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 4.0GB). Free memory was 60.3MB in the beginning and 2.2GB in the end (delta: -2.2GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 102.03ms. Allocated memory is still 4.1GB. Free memory was 2.2GB in the beginning and 2.2GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 100]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 110]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 113]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 117]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 118]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 119]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 1149 locations, 234 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 72.0s, OverallIterations: 45, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 66.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3940 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2066 mSDsluCounter, 1816 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1513 mSDsCounter, 872 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6533 IncrementalHoareTripleChecker+Invalid, 7405 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 872 mSolverCounterUnsat, 303 mSDtfsCounter, 6533 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1670occurred in iteration=0, InterpolantAutomatonStates: 163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 10218 NumberOfCodeBlocks, 10218 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 10173 ConstructedInterpolants, 0 QuantifiedInterpolants, 11435 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 45 InterpolantComputations, 45 PerfectInterpolantSequences, 150/150 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 133 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:35:03,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE