./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.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-more-queue-add-3-nl.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 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:38,730 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:38,773 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:38,776 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:38,776 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:38,791 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:38,792 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:38,792 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:38,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:38,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:38,793 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:38,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:38,793 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:38,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:38,793 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:38,793 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:38,793 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:38,793 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:38,793 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:38,794 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:38,794 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:38,798 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:38,799 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:38,799 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:38,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:38,800 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:38,800 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:38,800 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:38,800 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:38,800 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:38,800 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 -> 5dd003755f1e361f3bbf00c3bfecbc1131b6df98a7806f5bb08971966b13d6ac [2025-01-09 21:33:38,994 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:39,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:39,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:39,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:39,020 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:39,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-01-09 21:33:40,270 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f200c8f48/a05a0d6f6a4e434a83f47093c1941b6b/FLAG2797acff5 [2025-01-09 21:33:40,506 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:40,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-3-nl.wvr.c [2025-01-09 21:33:40,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f200c8f48/a05a0d6f6a4e434a83f47093c1941b6b/FLAG2797acff5 [2025-01-09 21:33:40,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f200c8f48/a05a0d6f6a4e434a83f47093c1941b6b [2025-01-09 21:33:40,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:40,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:40,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:40,847 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:40,851 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:40,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:40" (1/1) ... [2025-01-09 21:33:40,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1185c9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:40, skipping insertion in model container [2025-01-09 21:33:40,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:40" (1/1) ... [2025-01-09 21:33:40,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:41,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:41,019 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:41,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:41,050 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:41,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:41 WrapperNode [2025-01-09 21:33:41,051 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:41,052 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:41,052 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:41,052 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:41,056 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:41" (1/1) ... [2025-01-09 21:33:41,062 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:41" (1/1) ... [2025-01-09 21:33:41,084 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 17, calls inlined = 19, statements flattened = 520 [2025-01-09 21:33:41,085 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:41,085 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:41,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:41,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:41,093 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:41" (1/1) ... [2025-01-09 21:33:41,093 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:41" (1/1) ... [2025-01-09 21:33:41,096 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:41" (1/1) ... [2025-01-09 21:33:41,097 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:41" (1/1) ... [2025-01-09 21:33:41,106 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:41" (1/1) ... [2025-01-09 21:33:41,108 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:41" (1/1) ... [2025-01-09 21:33:41,110 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:41" (1/1) ... [2025-01-09 21:33:41,112 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:41" (1/1) ... [2025-01-09 21:33:41,113 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:41" (1/1) ... [2025-01-09 21:33:41,115 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:41,115 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:41,116 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:41,116 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:41,116 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:41" (1/1) ... [2025-01-09 21:33:41,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:41,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:41,138 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:41,140 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:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:41,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:41,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:33:41,155 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:33:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:41,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:41,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:41,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:41,157 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:41,249 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:41,250 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:41,741 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:41,741 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:42,131 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:42,132 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:33:42,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:42 BoogieIcfgContainer [2025-01-09 21:33:42,132 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:42,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:42,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:42,136 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:42,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:40" (1/3) ... [2025-01-09 21:33:42,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ef3d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:42, skipping insertion in model container [2025-01-09 21:33:42,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:41" (2/3) ... [2025-01-09 21:33:42,137 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18ef3d3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:42, skipping insertion in model container [2025-01-09 21:33:42,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:42" (3/3) ... [2025-01-09 21:33:42,138 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-3-nl.wvr.c [2025-01-09 21:33:42,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:42,150 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-3-nl.wvr.c that has 4 procedures, 428 locations, 1 initial locations, 5 loop locations, and 86 error locations. [2025-01-09 21:33:42,151 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:42,257 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:33:42,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 437 places, 443 transitions, 907 flow [2025-01-09 21:33:42,424 INFO L124 PetriNetUnfolderBase]: 16/440 cut-off events. [2025-01-09 21:33:42,426 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:33:42,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 440 events. 16/440 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 816 event pairs, 0 based on Foata normal form. 0/338 useless extension candidates. Maximal degree in co-relation 349. Up to 2 conditions per place. [2025-01-09 21:33:42,436 INFO L82 GeneralOperation]: Start removeDead. Operand has 437 places, 443 transitions, 907 flow [2025-01-09 21:33:42,475 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 415 places, 419 transitions, 856 flow [2025-01-09 21:33:42,481 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:42,489 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;@598eca1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:42,489 INFO L334 AbstractCegarLoop]: Starting to check reachability of 152 error locations. [2025-01-09 21:33:42,494 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:42,494 INFO L124 PetriNetUnfolderBase]: 0/30 cut-off events. [2025-01-09 21:33:42,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:42,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,495 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] [2025-01-09 21:33:42,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:42,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,499 INFO L85 PathProgramCache]: Analyzing trace with hash 486527873, now seen corresponding path program 1 times [2025-01-09 21:33:42,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158965263] [2025-01-09 21:33:42,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:42,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:33:42,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:33:42,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:42,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:42,607 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:42,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:42,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158965263] [2025-01-09 21:33:42,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158965263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:42,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:42,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:42,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449817709] [2025-01-09 21:33:42,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:42,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:42,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:42,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:42,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:42,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 443 [2025-01-09 21:33:42,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 419 transitions, 856 flow. Second operand has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:42,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:42,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 443 [2025-01-09 21:33:42,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:42,909 INFO L124 PetriNetUnfolderBase]: 165/1436 cut-off events. [2025-01-09 21:33:42,909 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-01-09 21:33:42,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1761 conditions, 1436 events. 165/1436 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9411 event pairs, 128 based on Foata normal form. 22/1204 useless extension candidates. Maximal degree in co-relation 1391. Up to 251 conditions per place. [2025-01-09 21:33:42,921 INFO L140 encePairwiseOnDemand]: 388/443 looper letters, 18 selfloop transitions, 2 changer transitions 5/366 dead transitions. [2025-01-09 21:33:42,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 366 transitions, 790 flow [2025-01-09 21:33:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:42,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1174 transitions. [2025-01-09 21:33:42,933 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8833709556057185 [2025-01-09 21:33:42,935 INFO L175 Difference]: Start difference. First operand has 415 places, 419 transitions, 856 flow. Second operand 3 states and 1174 transitions. [2025-01-09 21:33:42,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 366 transitions, 790 flow [2025-01-09 21:33:42,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 366 transitions, 778 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:33:42,944 INFO L231 Difference]: Finished difference. Result has 366 places, 361 transitions, 732 flow [2025-01-09 21:33:42,947 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=366, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=364, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=732, PETRI_PLACES=366, PETRI_TRANSITIONS=361} [2025-01-09 21:33:42,949 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -49 predicate places. [2025-01-09 21:33:42,949 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 361 transitions, 732 flow [2025-01-09 21:33:42,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 368.3333333333333) internal successors, (1105), 3 states have internal predecessors, (1105), 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:42,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:42,950 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:42,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:42,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:42,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:42,951 INFO L85 PathProgramCache]: Analyzing trace with hash -235434788, now seen corresponding path program 1 times [2025-01-09 21:33:42,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:42,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744222126] [2025-01-09 21:33:42,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:42,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:42,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:33:42,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:33:42,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:42,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,032 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:43,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744222126] [2025-01-09 21:33:43,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744222126] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199440594] [2025-01-09 21:33:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-01-09 21:33:43,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 361 transitions, 732 flow. Second operand has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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:43,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-01-09 21:33:43,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,433 INFO L124 PetriNetUnfolderBase]: 86/1124 cut-off events. [2025-01-09 21:33:43,434 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-01-09 21:33:43,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1278 conditions, 1124 events. 86/1124 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6066 event pairs, 51 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1239. Up to 131 conditions per place. [2025-01-09 21:33:43,442 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 17 selfloop transitions, 2 changer transitions 0/360 dead transitions. [2025-01-09 21:33:43,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 360 transitions, 768 flow [2025-01-09 21:33:43,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2025-01-09 21:33:43,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457486832204665 [2025-01-09 21:33:43,445 INFO L175 Difference]: Start difference. First operand has 366 places, 361 transitions, 732 flow. Second operand 3 states and 1124 transitions. [2025-01-09 21:33:43,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 360 transitions, 768 flow [2025-01-09 21:33:43,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 360 transitions, 764 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:43,452 INFO L231 Difference]: Finished difference. Result has 360 places, 360 transitions, 730 flow [2025-01-09 21:33:43,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=358, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=360, PETRI_TRANSITIONS=360} [2025-01-09 21:33:43,452 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -55 predicate places. [2025-01-09 21:33:43,453 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 360 transitions, 730 flow [2025-01-09 21:33:43,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.3333333333333) internal successors, (1108), 3 states have internal predecessors, (1108), 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:43,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,453 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:43,454 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:43,454 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:43,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1837423185, now seen corresponding path program 1 times [2025-01-09 21:33:43,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874803536] [2025-01-09 21:33:43,455 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-01-09 21:33:43,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-01-09 21:33:43,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,486 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:43,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874803536] [2025-01-09 21:33:43,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874803536] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697722163] [2025-01-09 21:33:43,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-01-09 21:33:43,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 360 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:43,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-01-09 21:33:43,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,631 INFO L124 PetriNetUnfolderBase]: 59/859 cut-off events. [2025-01-09 21:33:43,632 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:43,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 968 conditions, 859 events. 59/859 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4118 event pairs, 38 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 921. Up to 90 conditions per place. [2025-01-09 21:33:43,638 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/359 dead transitions. [2025-01-09 21:33:43,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 361 places, 359 transitions, 762 flow [2025-01-09 21:33:43,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:33:43,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-01-09 21:33:43,641 INFO L175 Difference]: Start difference. First operand has 360 places, 360 transitions, 730 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:33:43,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 361 places, 359 transitions, 762 flow [2025-01-09 21:33:43,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 359 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:43,647 INFO L231 Difference]: Finished difference. Result has 359 places, 359 transitions, 728 flow [2025-01-09 21:33:43,647 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=357, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=359, PETRI_TRANSITIONS=359} [2025-01-09 21:33:43,648 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -56 predicate places. [2025-01-09 21:33:43,648 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 359 transitions, 728 flow [2025-01-09 21:33:43,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:43,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,649 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:43,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:43,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:43,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1105614601, now seen corresponding path program 1 times [2025-01-09 21:33:43,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463077457] [2025-01-09 21:33:43,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:33:43,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:33:43,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:43,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463077457] [2025-01-09 21:33:43,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463077457] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618276703] [2025-01-09 21:33:43,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-01-09 21:33:43,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 359 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:43,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-01-09 21:33:43,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,802 INFO L124 PetriNetUnfolderBase]: 59/858 cut-off events. [2025-01-09 21:33:43,802 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:43,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 967 conditions, 858 events. 59/858 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4107 event pairs, 38 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 912. Up to 90 conditions per place. [2025-01-09 21:33:43,808 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/358 dead transitions. [2025-01-09 21:33:43,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 358 transitions, 760 flow [2025-01-09 21:33:43,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:33:43,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-01-09 21:33:43,810 INFO L175 Difference]: Start difference. First operand has 359 places, 359 transitions, 728 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:33:43,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 358 transitions, 760 flow [2025-01-09 21:33:43,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 358 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:43,814 INFO L231 Difference]: Finished difference. Result has 358 places, 358 transitions, 726 flow [2025-01-09 21:33:43,815 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=358, PETRI_TRANSITIONS=358} [2025-01-09 21:33:43,815 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -57 predicate places. [2025-01-09 21:33:43,815 INFO L471 AbstractCegarLoop]: Abstraction has has 358 places, 358 transitions, 726 flow [2025-01-09 21:33:43,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:43,816 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,816 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] [2025-01-09 21:33:43,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:43,816 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:43,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,817 INFO L85 PathProgramCache]: Analyzing trace with hash 78210695, now seen corresponding path program 1 times [2025-01-09 21:33:43,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486749072] [2025-01-09 21:33:43,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-01-09 21:33:43,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-01-09 21:33:43,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:43,849 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:43,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:43,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486749072] [2025-01-09 21:33:43,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486749072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:43,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:43,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:43,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720298613] [2025-01-09 21:33:43,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:43,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:43,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:43,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:43,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:43,862 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-01-09 21:33:43,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 358 places, 358 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:43,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:43,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-01-09 21:33:43,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:43,959 INFO L124 PetriNetUnfolderBase]: 59/857 cut-off events. [2025-01-09 21:33:43,960 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:33:43,963 INFO L83 FinitePrefix]: Finished finitePrefix Result has 966 conditions, 857 events. 59/857 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4128 event pairs, 38 based on Foata normal form. 0/716 useless extension candidates. Maximal degree in co-relation 903. Up to 90 conditions per place. [2025-01-09 21:33:43,966 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-01-09 21:33:43,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 359 places, 357 transitions, 758 flow [2025-01-09 21:33:43,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:43,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:33:43,968 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-01-09 21:33:43,968 INFO L175 Difference]: Start difference. First operand has 358 places, 358 transitions, 726 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:33:43,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 359 places, 357 transitions, 758 flow [2025-01-09 21:33:43,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 357 transitions, 754 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:43,972 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 724 flow [2025-01-09 21:33:43,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=724, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2025-01-09 21:33:43,973 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -58 predicate places. [2025-01-09 21:33:43,973 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 724 flow [2025-01-09 21:33:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:43,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:43,974 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:43,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:43,974 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:43,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:43,975 INFO L85 PathProgramCache]: Analyzing trace with hash 801010636, now seen corresponding path program 1 times [2025-01-09 21:33:43,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:43,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409645576] [2025-01-09 21:33:43,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:43,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:43,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:33:43,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:33:43,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:43,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,012 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:44,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409645576] [2025-01-09 21:33:44,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409645576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011547056] [2025-01-09 21:33:44,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-01-09 21:33:44,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 724 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-01-09 21:33:44,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,149 INFO L124 PetriNetUnfolderBase]: 56/779 cut-off events. [2025-01-09 21:33:44,149 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:33:44,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 888 conditions, 779 events. 56/779 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3346 event pairs, 7 based on Foata normal form. 0/659 useless extension candidates. Maximal degree in co-relation 817. Up to 69 conditions per place. [2025-01-09 21:33:44,153 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 18 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-01-09 21:33:44,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 362 transitions, 776 flow [2025-01-09 21:33:44,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1143 transitions. [2025-01-09 21:33:44,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8600451467268623 [2025-01-09 21:33:44,156 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 724 flow. Second operand 3 states and 1143 transitions. [2025-01-09 21:33:44,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 362 transitions, 776 flow [2025-01-09 21:33:44,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 362 transitions, 772 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:44,160 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 728 flow [2025-01-09 21:33:44,160 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2025-01-09 21:33:44,161 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -58 predicate places. [2025-01-09 21:33:44,161 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 728 flow [2025-01-09 21:33:44,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:44,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:44,162 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:44,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,163 INFO L85 PathProgramCache]: Analyzing trace with hash -2097487537, now seen corresponding path program 1 times [2025-01-09 21:33:44,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733610535] [2025-01-09 21:33:44,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:33:44,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:33:44,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,192 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:44,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733610535] [2025-01-09 21:33:44,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733610535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942053478] [2025-01-09 21:33:44,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:44,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:44,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:44,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,312 INFO L124 PetriNetUnfolderBase]: 59/858 cut-off events. [2025-01-09 21:33:44,312 INFO L125 PetriNetUnfolderBase]: For 31/32 co-relation queries the response was YES. [2025-01-09 21:33:44,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1002 conditions, 858 events. 59/858 cut-off events. For 31/32 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4133 event pairs, 38 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 379. Up to 92 conditions per place. [2025-01-09 21:33:44,318 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 15 selfloop transitions, 2 changer transitions 0/356 dead transitions. [2025-01-09 21:33:44,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 356 transitions, 760 flow [2025-01-09 21:33:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:33:44,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-01-09 21:33:44,321 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 728 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:33:44,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 356 transitions, 760 flow [2025-01-09 21:33:44,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 356 transitions, 758 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:44,325 INFO L231 Difference]: Finished difference. Result has 357 places, 356 transitions, 728 flow [2025-01-09 21:33:44,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=728, PETRI_PLACES=357, PETRI_TRANSITIONS=356} [2025-01-09 21:33:44,326 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -58 predicate places. [2025-01-09 21:33:44,326 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 356 transitions, 728 flow [2025-01-09 21:33:44,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:44,327 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,327 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] [2025-01-09 21:33:44,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:44,327 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:44,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,327 INFO L85 PathProgramCache]: Analyzing trace with hash -641624010, now seen corresponding path program 1 times [2025-01-09 21:33:44,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105588902] [2025-01-09 21:33:44,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,333 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:33:44,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:33:44,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,363 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:44,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105588902] [2025-01-09 21:33:44,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105588902] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410571932] [2025-01-09 21:33:44,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-01-09 21:33:44,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 356 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:44,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-01-09 21:33:44,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,465 INFO L124 PetriNetUnfolderBase]: 59/857 cut-off events. [2025-01-09 21:33:44,465 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-01-09 21:33:44,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 857 events. 59/857 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4193 event pairs, 38 based on Foata normal form. 0/719 useless extension candidates. Maximal degree in co-relation 913. Up to 93 conditions per place. [2025-01-09 21:33:44,470 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/355 dead transitions. [2025-01-09 21:33:44,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 355 transitions, 762 flow [2025-01-09 21:33:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1128 transitions. [2025-01-09 21:33:44,473 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487584650112867 [2025-01-09 21:33:44,473 INFO L175 Difference]: Start difference. First operand has 357 places, 356 transitions, 728 flow. Second operand 3 states and 1128 transitions. [2025-01-09 21:33:44,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 355 transitions, 762 flow [2025-01-09 21:33:44,474 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 355 transitions, 758 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:44,477 INFO L231 Difference]: Finished difference. Result has 356 places, 355 transitions, 726 flow [2025-01-09 21:33:44,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=356, PETRI_TRANSITIONS=355} [2025-01-09 21:33:44,478 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -59 predicate places. [2025-01-09 21:33:44,478 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 355 transitions, 726 flow [2025-01-09 21:33:44,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 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:44,478 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,478 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] [2025-01-09 21:33:44,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:44,479 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:44,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1955946529, now seen corresponding path program 1 times [2025-01-09 21:33:44,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663605360] [2025-01-09 21:33:44,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 21:33:44,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 21:33:44,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,513 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:44,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663605360] [2025-01-09 21:33:44,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663605360] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169196676] [2025-01-09 21:33:44,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-01-09 21:33:44,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 355 transitions, 726 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-01-09 21:33:44,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,620 INFO L124 PetriNetUnfolderBase]: 66/944 cut-off events. [2025-01-09 21:33:44,620 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-01-09 21:33:44,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 944 events. 66/944 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4672 event pairs, 20 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 1002. Up to 54 conditions per place. [2025-01-09 21:33:44,626 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 21 selfloop transitions, 2 changer transitions 0/362 dead transitions. [2025-01-09 21:33:44,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 362 transitions, 792 flow [2025-01-09 21:33:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1144 transitions. [2025-01-09 21:33:44,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8607975921745673 [2025-01-09 21:33:44,629 INFO L175 Difference]: Start difference. First operand has 356 places, 355 transitions, 726 flow. Second operand 3 states and 1144 transitions. [2025-01-09 21:33:44,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 362 transitions, 792 flow [2025-01-09 21:33:44,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 362 transitions, 788 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:44,633 INFO L231 Difference]: Finished difference. Result has 356 places, 355 transitions, 730 flow [2025-01-09 21:33:44,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=356, PETRI_TRANSITIONS=355} [2025-01-09 21:33:44,634 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -59 predicate places. [2025-01-09 21:33:44,634 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 355 transitions, 730 flow [2025-01-09 21:33:44,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,635 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,635 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] [2025-01-09 21:33:44,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:44,635 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:44,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1870358198, now seen corresponding path program 1 times [2025-01-09 21:33:44,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068242497] [2025-01-09 21:33:44,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-01-09 21:33:44,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-01-09 21:33:44,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,665 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:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068242497] [2025-01-09 21:33:44,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068242497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236683046] [2025-01-09 21:33:44,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:44,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 355 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:44,674 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,674 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:44,674 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,757 INFO L124 PetriNetUnfolderBase]: 66/868 cut-off events. [2025-01-09 21:33:44,757 INFO L125 PetriNetUnfolderBase]: For 57/58 co-relation queries the response was YES. [2025-01-09 21:33:44,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 868 events. 66/868 cut-off events. For 57/58 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4223 event pairs, 38 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 573. Up to 105 conditions per place. [2025-01-09 21:33:44,762 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/354 dead transitions. [2025-01-09 21:33:44,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 354 transitions, 764 flow [2025-01-09 21:33:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:33:44,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-01-09 21:33:44,765 INFO L175 Difference]: Start difference. First operand has 356 places, 355 transitions, 730 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:33:44,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 354 transitions, 764 flow [2025-01-09 21:33:44,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 354 transitions, 762 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:44,768 INFO L231 Difference]: Finished difference. Result has 356 places, 354 transitions, 730 flow [2025-01-09 21:33:44,769 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=726, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=730, PETRI_PLACES=356, PETRI_TRANSITIONS=354} [2025-01-09 21:33:44,769 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -59 predicate places. [2025-01-09 21:33:44,769 INFO L471 AbstractCegarLoop]: Abstraction has has 356 places, 354 transitions, 730 flow [2025-01-09 21:33:44,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:44,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,770 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:44,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:44,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:44,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1231785512, now seen corresponding path program 1 times [2025-01-09 21:33:44,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481812555] [2025-01-09 21:33:44,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:33:44,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:33:44,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:44,799 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:44,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:44,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481812555] [2025-01-09 21:33:44,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481812555] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:44,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:44,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614856970] [2025-01-09 21:33:44,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:44,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:44,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:44,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:44,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:44,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-01-09 21:33:44,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 356 places, 354 transitions, 730 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:44,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-01-09 21:33:44,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:44,901 INFO L124 PetriNetUnfolderBase]: 66/867 cut-off events. [2025-01-09 21:33:44,901 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:44,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1041 conditions, 867 events. 66/867 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4246 event pairs, 38 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 944. Up to 103 conditions per place. [2025-01-09 21:33:44,907 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 15 selfloop transitions, 1 changer transitions 0/353 dead transitions. [2025-01-09 21:33:44,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 357 places, 353 transitions, 760 flow [2025-01-09 21:33:44,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-01-09 21:33:44,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8555304740406321 [2025-01-09 21:33:44,909 INFO L175 Difference]: Start difference. First operand has 356 places, 354 transitions, 730 flow. Second operand 3 states and 1137 transitions. [2025-01-09 21:33:44,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 357 places, 353 transitions, 760 flow [2025-01-09 21:33:44,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 353 transitions, 756 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:44,913 INFO L231 Difference]: Finished difference. Result has 355 places, 353 transitions, 726 flow [2025-01-09 21:33:44,914 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=726, PETRI_PLACES=355, PETRI_TRANSITIONS=353} [2025-01-09 21:33:44,914 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -60 predicate places. [2025-01-09 21:33:44,914 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 353 transitions, 726 flow [2025-01-09 21:33:44,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:44,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:44,915 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] [2025-01-09 21:33:44,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:44,915 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:44,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -404746466, now seen corresponding path program 1 times [2025-01-09 21:33:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:44,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40936015] [2025-01-09 21:33:44,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:44,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:44,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:33:44,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:33:44,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:44,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40936015] [2025-01-09 21:33:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40936015] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849887086] [2025-01-09 21:33:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:45,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:45,427 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 443 [2025-01-09 21:33:45,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 353 transitions, 726 flow. Second operand has 6 states, 6 states have (on average 351.5) internal successors, (2109), 6 states have internal predecessors, (2109), 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:45,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 443 [2025-01-09 21:33:45,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,567 INFO L124 PetriNetUnfolderBase]: 66/865 cut-off events. [2025-01-09 21:33:45,568 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:45,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1061 conditions, 865 events. 66/865 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4229 event pairs, 38 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 965. Up to 118 conditions per place. [2025-01-09 21:33:45,574 INFO L140 encePairwiseOnDemand]: 431/443 looper letters, 29 selfloop transitions, 10 changer transitions 0/351 dead transitions. [2025-01-09 21:33:45,574 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 351 transitions, 800 flow [2025-01-09 21:33:45,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:45,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2139 transitions. [2025-01-09 21:33:45,578 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8047404063205418 [2025-01-09 21:33:45,578 INFO L175 Difference]: Start difference. First operand has 355 places, 353 transitions, 726 flow. Second operand 6 states and 2139 transitions. [2025-01-09 21:33:45,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 351 transitions, 800 flow [2025-01-09 21:33:45,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 357 places, 351 transitions, 799 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:45,582 INFO L231 Difference]: Finished difference. Result has 357 places, 351 transitions, 741 flow [2025-01-09 21:33:45,582 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=721, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=741, PETRI_PLACES=357, PETRI_TRANSITIONS=351} [2025-01-09 21:33:45,583 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -58 predicate places. [2025-01-09 21:33:45,583 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 351 transitions, 741 flow [2025-01-09 21:33:45,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.5) internal successors, (2109), 6 states have internal predecessors, (2109), 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:45,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,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] [2025-01-09 21:33:45,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:33:45,584 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,585 INFO L85 PathProgramCache]: Analyzing trace with hash 715862099, now seen corresponding path program 1 times [2025-01-09 21:33:45,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578921475] [2025-01-09 21:33:45,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 21:33:45,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 21:33:45,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,614 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:45,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578921475] [2025-01-09 21:33:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578921475] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224953886] [2025-01-09 21:33:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:45,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:45,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:45,620 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:45,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 351 transitions, 741 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:45,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:45,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,711 INFO L124 PetriNetUnfolderBase]: 66/864 cut-off events. [2025-01-09 21:33:45,711 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:45,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 864 events. 66/864 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4246 event pairs, 38 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 1014. Up to 105 conditions per place. [2025-01-09 21:33:45,717 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/350 dead transitions. [2025-01-09 21:33:45,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 350 transitions, 775 flow [2025-01-09 21:33:45,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:45,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:45,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:33:45,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-01-09 21:33:45,719 INFO L175 Difference]: Start difference. First operand has 357 places, 351 transitions, 741 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:33:45,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 350 transitions, 775 flow [2025-01-09 21:33:45,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 353 places, 350 transitions, 755 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:45,723 INFO L231 Difference]: Finished difference. Result has 353 places, 350 transitions, 723 flow [2025-01-09 21:33:45,723 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=719, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=723, PETRI_PLACES=353, PETRI_TRANSITIONS=350} [2025-01-09 21:33:45,724 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -62 predicate places. [2025-01-09 21:33:45,724 INFO L471 AbstractCegarLoop]: Abstraction has has 353 places, 350 transitions, 723 flow [2025-01-09 21:33:45,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:45,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:45,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:33:45,725 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:45,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1994067698, now seen corresponding path program 1 times [2025-01-09 21:33:45,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820162384] [2025-01-09 21:33:45,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:33:45,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:33:45,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,762 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:45,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820162384] [2025-01-09 21:33:45,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820162384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:45,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302800028] [2025-01-09 21:33:45,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:45,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:45,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:45,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 443 [2025-01-09 21:33:45,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 353 places, 350 transitions, 723 flow. Second operand has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 443 [2025-01-09 21:33:45,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,857 INFO L124 PetriNetUnfolderBase]: 66/863 cut-off events. [2025-01-09 21:33:45,858 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:45,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 863 events. 66/863 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4198 event pairs, 38 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 941. Up to 103 conditions per place. [2025-01-09 21:33:45,863 INFO L140 encePairwiseOnDemand]: 441/443 looper letters, 15 selfloop transitions, 1 changer transitions 0/349 dead transitions. [2025-01-09 21:33:45,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 349 transitions, 753 flow [2025-01-09 21:33:45,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:45,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1137 transitions. [2025-01-09 21:33:45,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8555304740406321 [2025-01-09 21:33:45,865 INFO L175 Difference]: Start difference. First operand has 353 places, 350 transitions, 723 flow. Second operand 3 states and 1137 transitions. [2025-01-09 21:33:45,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 349 transitions, 753 flow [2025-01-09 21:33:45,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 349 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:45,869 INFO L231 Difference]: Finished difference. Result has 352 places, 349 transitions, 719 flow [2025-01-09 21:33:45,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=352, PETRI_TRANSITIONS=349} [2025-01-09 21:33:45,870 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -63 predicate places. [2025-01-09 21:33:45,870 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 349 transitions, 719 flow [2025-01-09 21:33:45,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.0) internal successors, (1125), 3 states have internal predecessors, (1125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:45,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:45,871 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] [2025-01-09 21:33:45,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:33:45,871 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:45,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 264824148, now seen corresponding path program 1 times [2025-01-09 21:33:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:45,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602469712] [2025-01-09 21:33:45,872 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:45,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:45,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:33:45,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:33:45,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:45,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:45,904 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:45,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:45,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602469712] [2025-01-09 21:33:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602469712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:45,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:45,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394097367] [2025-01-09 21:33:45,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:45,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:45,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:45,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:45,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:45,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:45,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 349 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:45,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:45,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:45,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:45,996 INFO L124 PetriNetUnfolderBase]: 66/862 cut-off events. [2025-01-09 21:33:45,996 INFO L125 PetriNetUnfolderBase]: For 56/57 co-relation queries the response was YES. [2025-01-09 21:33:46,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1038 conditions, 862 events. 66/862 cut-off events. For 56/57 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4199 event pairs, 38 based on Foata normal form. 0/726 useless extension candidates. Maximal degree in co-relation 941. Up to 105 conditions per place. [2025-01-09 21:33:46,002 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 16 selfloop transitions, 2 changer transitions 0/348 dead transitions. [2025-01-09 21:33:46,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 348 transitions, 753 flow [2025-01-09 21:33:46,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:46,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:46,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:33:46,005 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-01-09 21:33:46,005 INFO L175 Difference]: Start difference. First operand has 352 places, 349 transitions, 719 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:33:46,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 348 transitions, 753 flow [2025-01-09 21:33:46,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 352 places, 348 transitions, 752 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:46,008 INFO L231 Difference]: Finished difference. Result has 352 places, 348 transitions, 720 flow [2025-01-09 21:33:46,009 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=716, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=720, PETRI_PLACES=352, PETRI_TRANSITIONS=348} [2025-01-09 21:33:46,009 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -63 predicate places. [2025-01-09 21:33:46,009 INFO L471 AbstractCegarLoop]: Abstraction has has 352 places, 348 transitions, 720 flow [2025-01-09 21:33:46,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:46,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:46,010 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:33:46,010 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:46,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:46,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1915876330, now seen corresponding path program 1 times [2025-01-09 21:33:46,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:46,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194580390] [2025-01-09 21:33:46,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:46,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:46,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:33:46,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:33:46,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:46,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:46,046 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:46,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:46,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194580390] [2025-01-09 21:33:46,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194580390] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:46,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:46,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:46,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022441704] [2025-01-09 21:33:46,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:46,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:46,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:46,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:46,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:46,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-01-09 21:33:46,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 352 places, 348 transitions, 720 flow. Second operand has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 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:46,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:46,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-01-09 21:33:46,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:46,182 INFO L124 PetriNetUnfolderBase]: 113/1251 cut-off events. [2025-01-09 21:33:46,182 INFO L125 PetriNetUnfolderBase]: For 81/83 co-relation queries the response was YES. [2025-01-09 21:33:46,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 1251 events. 113/1251 cut-off events. For 81/83 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7391 event pairs, 64 based on Foata normal form. 1/1018 useless extension candidates. Maximal degree in co-relation 1430. Up to 171 conditions per place. [2025-01-09 21:33:46,190 INFO L140 encePairwiseOnDemand]: 439/443 looper letters, 17 selfloop transitions, 1 changer transitions 2/345 dead transitions. [2025-01-09 21:33:46,190 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 351 places, 345 transitions, 752 flow [2025-01-09 21:33:46,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:46,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1124 transitions. [2025-01-09 21:33:46,192 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457486832204665 [2025-01-09 21:33:46,192 INFO L175 Difference]: Start difference. First operand has 352 places, 348 transitions, 720 flow. Second operand 3 states and 1124 transitions. [2025-01-09 21:33:46,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 351 places, 345 transitions, 752 flow [2025-01-09 21:33:46,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 345 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:46,196 INFO L231 Difference]: Finished difference. Result has 349 places, 343 transitions, 708 flow [2025-01-09 21:33:46,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=347, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=708, PETRI_PLACES=349, PETRI_TRANSITIONS=343} [2025-01-09 21:33:46,197 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -66 predicate places. [2025-01-09 21:33:46,197 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 343 transitions, 708 flow [2025-01-09 21:33:46,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 369.0) internal successors, (1107), 3 states have internal predecessors, (1107), 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:46,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:46,198 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] [2025-01-09 21:33:46,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:33:46,198 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:46,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash 901695945, now seen corresponding path program 1 times [2025-01-09 21:33:46,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:46,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676214915] [2025-01-09 21:33:46,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:46,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 21:33:46,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 21:33:46,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:46,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:46,245 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:46,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:46,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676214915] [2025-01-09 21:33:46,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676214915] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:46,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:46,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:46,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254780376] [2025-01-09 21:33:46,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:46,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:46,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:46,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:46,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:46,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 364 out of 443 [2025-01-09 21:33:46,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 343 transitions, 708 flow. Second operand has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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:46,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:46,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 364 of 443 [2025-01-09 21:33:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:46,412 INFO L124 PetriNetUnfolderBase]: 198/1413 cut-off events. [2025-01-09 21:33:46,412 INFO L125 PetriNetUnfolderBase]: For 128/129 co-relation queries the response was YES. [2025-01-09 21:33:46,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1877 conditions, 1413 events. 198/1413 cut-off events. For 128/129 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 9157 event pairs, 64 based on Foata normal form. 0/1160 useless extension candidates. Maximal degree in co-relation 1781. Up to 178 conditions per place. [2025-01-09 21:33:46,421 INFO L140 encePairwiseOnDemand]: 434/443 looper letters, 25 selfloop transitions, 5 changer transitions 0/346 dead transitions. [2025-01-09 21:33:46,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 346 transitions, 784 flow [2025-01-09 21:33:46,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:46,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1122 transitions. [2025-01-09 21:33:46,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8442437923250564 [2025-01-09 21:33:46,424 INFO L175 Difference]: Start difference. First operand has 349 places, 343 transitions, 708 flow. Second operand 3 states and 1122 transitions. [2025-01-09 21:33:46,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 346 transitions, 784 flow [2025-01-09 21:33:46,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 346 transitions, 783 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:46,428 INFO L231 Difference]: Finished difference. Result has 344 places, 339 transitions, 709 flow [2025-01-09 21:33:46,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=699, PETRI_DIFFERENCE_MINUEND_PLACES=342, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=339, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=709, PETRI_PLACES=344, PETRI_TRANSITIONS=339} [2025-01-09 21:33:46,428 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -71 predicate places. [2025-01-09 21:33:46,429 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 339 transitions, 709 flow [2025-01-09 21:33:46,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 365.3333333333333) internal successors, (1096), 3 states have internal predecessors, (1096), 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:46,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:46,429 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:33:46,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:33:46,429 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1053534292, now seen corresponding path program 1 times [2025-01-09 21:33:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398384577] [2025-01-09 21:33:46,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:46,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:46,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:33:46,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:33:46,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:46,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:46,476 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:46,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:46,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398384577] [2025-01-09 21:33:46,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398384577] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:46,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:46,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:46,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427528382] [2025-01-09 21:33:46,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:46,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:46,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:46,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:46,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:46,490 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 443 [2025-01-09 21:33:46,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 339 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 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:46,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:46,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 443 [2025-01-09 21:33:46,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:46,721 INFO L124 PetriNetUnfolderBase]: 490/2322 cut-off events. [2025-01-09 21:33:46,721 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-01-09 21:33:46,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3337 conditions, 2322 events. 490/2322 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 17512 event pairs, 104 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 3240. Up to 661 conditions per place. [2025-01-09 21:33:46,734 INFO L140 encePairwiseOnDemand]: 435/443 looper letters, 29 selfloop transitions, 4 changer transitions 0/346 dead transitions. [2025-01-09 21:33:46,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 346 transitions, 795 flow [2025-01-09 21:33:46,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:46,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:46,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:33:46,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-01-09 21:33:46,737 INFO L175 Difference]: Start difference. First operand has 344 places, 339 transitions, 709 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:33:46,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 346 transitions, 795 flow [2025-01-09 21:33:46,739 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 346 transitions, 785 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:46,741 INFO L231 Difference]: Finished difference. Result has 341 places, 339 transitions, 719 flow [2025-01-09 21:33:46,742 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=341, PETRI_TRANSITIONS=339} [2025-01-09 21:33:46,742 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -74 predicate places. [2025-01-09 21:33:46,742 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 339 transitions, 719 flow [2025-01-09 21:33:46,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.6666666666667) internal successors, (1100), 3 states have internal predecessors, (1100), 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:46,742 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:46,743 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] [2025-01-09 21:33:46,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:33:46,743 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash 743760548, now seen corresponding path program 1 times [2025-01-09 21:33:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915801508] [2025-01-09 21:33:46,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:46,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-01-09 21:33:46,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-01-09 21:33:46,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:46,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:46,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:46,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915801508] [2025-01-09 21:33:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915801508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:46,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:46,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133715749] [2025-01-09 21:33:46,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:46,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:46,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:46,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:46,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:46,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 339 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 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:46,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:46,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:46,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:47,034 INFO L124 PetriNetUnfolderBase]: 430/1672 cut-off events. [2025-01-09 21:33:47,034 INFO L125 PetriNetUnfolderBase]: For 182/183 co-relation queries the response was YES. [2025-01-09 21:33:47,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2595 conditions, 1672 events. 430/1672 cut-off events. For 182/183 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 11289 event pairs, 196 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2499. Up to 492 conditions per place. [2025-01-09 21:33:47,045 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 23 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-01-09 21:33:47,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 344 transitions, 785 flow [2025-01-09 21:33:47,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:47,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:47,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-01-09 21:33:47,048 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-01-09 21:33:47,048 INFO L175 Difference]: Start difference. First operand has 341 places, 339 transitions, 719 flow. Second operand 3 states and 1136 transitions. [2025-01-09 21:33:47,048 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 344 transitions, 785 flow [2025-01-09 21:33:47,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 342 places, 344 transitions, 785 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:33:47,051 INFO L231 Difference]: Finished difference. Result has 342 places, 338 transitions, 721 flow [2025-01-09 21:33:47,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=717, PETRI_DIFFERENCE_MINUEND_PLACES=340, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=721, PETRI_PLACES=342, PETRI_TRANSITIONS=338} [2025-01-09 21:33:47,052 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -73 predicate places. [2025-01-09 21:33:47,052 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 338 transitions, 721 flow [2025-01-09 21:33:47,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 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:47,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:47,053 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] [2025-01-09 21:33:47,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:33:47,053 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:47,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:47,054 INFO L85 PathProgramCache]: Analyzing trace with hash -572116143, now seen corresponding path program 1 times [2025-01-09 21:33:47,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:47,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353929408] [2025-01-09 21:33:47,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:47,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:47,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 21:33:47,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 21:33:47,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:47,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:47,107 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:47,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:47,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353929408] [2025-01-09 21:33:47,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353929408] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:47,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:47,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:47,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902592701] [2025-01-09 21:33:47,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:47,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:47,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:47,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:47,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:47,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-01-09 21:33:47,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 338 transitions, 721 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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:47,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:47,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-01-09 21:33:47,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:47,381 INFO L124 PetriNetUnfolderBase]: 383/2437 cut-off events. [2025-01-09 21:33:47,381 INFO L125 PetriNetUnfolderBase]: For 214/217 co-relation queries the response was YES. [2025-01-09 21:33:47,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3366 conditions, 2437 events. 383/2437 cut-off events. For 214/217 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 19269 event pairs, 165 based on Foata normal form. 0/2027 useless extension candidates. Maximal degree in co-relation 3269. Up to 414 conditions per place. [2025-01-09 21:33:47,394 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 27 selfloop transitions, 2 changer transitions 0/344 dead transitions. [2025-01-09 21:33:47,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 343 places, 344 transitions, 801 flow [2025-01-09 21:33:47,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:47,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:47,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:33:47,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-01-09 21:33:47,396 INFO L175 Difference]: Start difference. First operand has 342 places, 338 transitions, 721 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:33:47,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 343 places, 344 transitions, 801 flow [2025-01-09 21:33:47,398 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 344 transitions, 797 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:47,400 INFO L231 Difference]: Finished difference. Result has 341 places, 337 transitions, 719 flow [2025-01-09 21:33:47,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=715, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=719, PETRI_PLACES=341, PETRI_TRANSITIONS=337} [2025-01-09 21:33:47,401 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -74 predicate places. [2025-01-09 21:33:47,401 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 337 transitions, 719 flow [2025-01-09 21:33:47,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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:47,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:47,401 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] [2025-01-09 21:33:47,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:33:47,402 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:47,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:47,402 INFO L85 PathProgramCache]: Analyzing trace with hash 984474163, now seen corresponding path program 1 times [2025-01-09 21:33:47,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:47,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820558612] [2025-01-09 21:33:47,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:47,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:47,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 21:33:47,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 21:33:47,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:47,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:47,450 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:47,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:47,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820558612] [2025-01-09 21:33:47,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820558612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:47,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:47,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:47,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448628990] [2025-01-09 21:33:47,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:47,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:47,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:47,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:47,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:47,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 443 [2025-01-09 21:33:47,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 337 transitions, 719 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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:47,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:47,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 443 [2025-01-09 21:33:47,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:47,737 INFO L124 PetriNetUnfolderBase]: 368/2516 cut-off events. [2025-01-09 21:33:47,737 INFO L125 PetriNetUnfolderBase]: For 219/220 co-relation queries the response was YES. [2025-01-09 21:33:47,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3435 conditions, 2516 events. 368/2516 cut-off events. For 219/220 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 20661 event pairs, 168 based on Foata normal form. 0/2105 useless extension candidates. Maximal degree in co-relation 3338. Up to 407 conditions per place. [2025-01-09 21:33:47,748 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 27 selfloop transitions, 2 changer transitions 0/343 dead transitions. [2025-01-09 21:33:47,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 343 transitions, 799 flow [2025-01-09 21:33:47,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-01-09 21:33:47,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8502633559066968 [2025-01-09 21:33:47,750 INFO L175 Difference]: Start difference. First operand has 341 places, 337 transitions, 719 flow. Second operand 3 states and 1130 transitions. [2025-01-09 21:33:47,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 343 transitions, 799 flow [2025-01-09 21:33:47,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 343 transitions, 795 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:47,754 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 717 flow [2025-01-09 21:33:47,754 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=713, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=717, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-01-09 21:33:47,755 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -75 predicate places. [2025-01-09 21:33:47,755 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 717 flow [2025-01-09 21:33:47,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 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:47,755 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:47,755 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] [2025-01-09 21:33:47,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:33:47,756 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:47,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:47,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1929579036, now seen corresponding path program 1 times [2025-01-09 21:33:47,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:47,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629025057] [2025-01-09 21:33:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:47,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:47,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 21:33:47,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 21:33:47,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:47,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:47,805 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:47,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:47,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629025057] [2025-01-09 21:33:47,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629025057] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:47,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:47,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:47,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105885628] [2025-01-09 21:33:47,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:47,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:47,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:47,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:47,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:47,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 373 out of 443 [2025-01-09 21:33:47,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 717 flow. Second operand has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 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:47,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:47,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 373 of 443 [2025-01-09 21:33:47,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:47,999 INFO L124 PetriNetUnfolderBase]: 385/1658 cut-off events. [2025-01-09 21:33:47,999 INFO L125 PetriNetUnfolderBase]: For 184/185 co-relation queries the response was YES. [2025-01-09 21:33:48,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2489 conditions, 1658 events. 385/1658 cut-off events. For 184/185 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11062 event pairs, 137 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 2392. Up to 362 conditions per place. [2025-01-09 21:33:48,010 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 21 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-01-09 21:33:48,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 341 transitions, 779 flow [2025-01-09 21:33:48,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:48,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1140 transitions. [2025-01-09 21:33:48,012 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8577878103837472 [2025-01-09 21:33:48,012 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 717 flow. Second operand 3 states and 1140 transitions. [2025-01-09 21:33:48,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 341 transitions, 779 flow [2025-01-09 21:33:48,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 341 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:48,016 INFO L231 Difference]: Finished difference. Result has 339 places, 335 transitions, 715 flow [2025-01-09 21:33:48,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=711, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=333, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=715, PETRI_PLACES=339, PETRI_TRANSITIONS=335} [2025-01-09 21:33:48,017 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -76 predicate places. [2025-01-09 21:33:48,017 INFO L471 AbstractCegarLoop]: Abstraction has has 339 places, 335 transitions, 715 flow [2025-01-09 21:33:48,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 375.3333333333333) internal successors, (1126), 3 states have internal predecessors, (1126), 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:48,017 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:48,017 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] [2025-01-09 21:33:48,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:33:48,018 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:48,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:48,018 INFO L85 PathProgramCache]: Analyzing trace with hash 2019233721, now seen corresponding path program 1 times [2025-01-09 21:33:48,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:48,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434019670] [2025-01-09 21:33:48,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:48,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:48,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-01-09 21:33:48,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-01-09 21:33:48,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:48,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:48,060 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:48,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:48,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434019670] [2025-01-09 21:33:48,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434019670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:48,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:48,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:48,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89487071] [2025-01-09 21:33:48,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:48,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:48,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:48,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:48,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:48,076 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-01-09 21:33:48,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 339 places, 335 transitions, 715 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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:48,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:48,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-01-09 21:33:48,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:48,304 INFO L124 PetriNetUnfolderBase]: 520/2155 cut-off events. [2025-01-09 21:33:48,304 INFO L125 PetriNetUnfolderBase]: For 213/263 co-relation queries the response was YES. [2025-01-09 21:33:48,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3254 conditions, 2155 events. 520/2155 cut-off events. For 213/263 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 16123 event pairs, 220 based on Foata normal form. 0/1866 useless extension candidates. Maximal degree in co-relation 3157. Up to 567 conditions per place. [2025-01-09 21:33:48,317 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 25 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-01-09 21:33:48,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 341 transitions, 787 flow [2025-01-09 21:33:48,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:48,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1135 transitions. [2025-01-09 21:33:48,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540255831452219 [2025-01-09 21:33:48,320 INFO L175 Difference]: Start difference. First operand has 339 places, 335 transitions, 715 flow. Second operand 3 states and 1135 transitions. [2025-01-09 21:33:48,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 341 transitions, 787 flow [2025-01-09 21:33:48,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 341 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:48,324 INFO L231 Difference]: Finished difference. Result has 338 places, 334 transitions, 713 flow [2025-01-09 21:33:48,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=709, PETRI_DIFFERENCE_MINUEND_PLACES=336, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=334, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=713, PETRI_PLACES=338, PETRI_TRANSITIONS=334} [2025-01-09 21:33:48,325 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -77 predicate places. [2025-01-09 21:33:48,325 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 334 transitions, 713 flow [2025-01-09 21:33:48,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 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:48,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:48,325 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] [2025-01-09 21:33:48,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:33:48,326 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:48,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:48,326 INFO L85 PathProgramCache]: Analyzing trace with hash 995882407, now seen corresponding path program 1 times [2025-01-09 21:33:48,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:48,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794373065] [2025-01-09 21:33:48,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:48,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:48,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:33:48,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:33:48,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:48,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:48,372 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:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:48,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794373065] [2025-01-09 21:33:48,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794373065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:48,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:48,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:48,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128668954] [2025-01-09 21:33:48,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:48,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:48,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:48,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:48,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:48,385 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:48,386 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 334 transitions, 713 flow. Second operand has 3 states, 3 states have (on average 374.0) internal successors, (1122), 3 states have internal predecessors, (1122), 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:48,386 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:48,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:48,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:48,627 INFO L124 PetriNetUnfolderBase]: 475/1646 cut-off events. [2025-01-09 21:33:48,627 INFO L125 PetriNetUnfolderBase]: For 213/214 co-relation queries the response was YES. [2025-01-09 21:33:48,633 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2661 conditions, 1646 events. 475/1646 cut-off events. For 213/214 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 10894 event pairs, 199 based on Foata normal form. 0/1475 useless extension candidates. Maximal degree in co-relation 2564. Up to 513 conditions per place. [2025-01-09 21:33:48,638 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 23 selfloop transitions, 2 changer transitions 0/339 dead transitions. [2025-01-09 21:33:48,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 339 transitions, 779 flow [2025-01-09 21:33:48,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:48,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:48,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-01-09 21:33:48,641 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-01-09 21:33:48,641 INFO L175 Difference]: Start difference. First operand has 338 places, 334 transitions, 713 flow. Second operand 3 states and 1136 transitions. [2025-01-09 21:33:48,641 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 339 transitions, 779 flow [2025-01-09 21:33:48,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 339 transitions, 775 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:48,645 INFO L231 Difference]: Finished difference. Result has 337 places, 333 transitions, 711 flow [2025-01-09 21:33:48,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=333, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=331, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=711, PETRI_PLACES=337, PETRI_TRANSITIONS=333} [2025-01-09 21:33:48,646 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -78 predicate places. [2025-01-09 21:33:48,646 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 333 transitions, 711 flow [2025-01-09 21:33:48,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.0) internal successors, (1122), 3 states have internal predecessors, (1122), 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:48,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:48,647 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] [2025-01-09 21:33:48,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:33:48,647 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:48,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:48,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1278478712, now seen corresponding path program 1 times [2025-01-09 21:33:48,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:48,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120557244] [2025-01-09 21:33:48,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:48,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:48,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-01-09 21:33:48,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-01-09 21:33:48,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:48,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:48,708 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:48,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:48,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120557244] [2025-01-09 21:33:48,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120557244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:48,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:48,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:48,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630262593] [2025-01-09 21:33:48,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:48,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:48,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:48,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:48,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:48,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-01-09 21:33:48,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 333 transitions, 711 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:48,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:48,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-01-09 21:33:48,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:48,944 INFO L124 PetriNetUnfolderBase]: 420/2019 cut-off events. [2025-01-09 21:33:48,945 INFO L125 PetriNetUnfolderBase]: For 193/206 co-relation queries the response was YES. [2025-01-09 21:33:48,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 2019 events. 420/2019 cut-off events. For 193/206 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 15212 event pairs, 146 based on Foata normal form. 1/1804 useless extension candidates. Maximal degree in co-relation 2847. Up to 384 conditions per place. [2025-01-09 21:33:48,957 INFO L140 encePairwiseOnDemand]: 438/443 looper letters, 22 selfloop transitions, 2 changer transitions 6/338 dead transitions. [2025-01-09 21:33:48,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 338 transitions, 777 flow [2025-01-09 21:33:48,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:48,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:48,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-01-09 21:33:48,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532731376975169 [2025-01-09 21:33:48,959 INFO L175 Difference]: Start difference. First operand has 337 places, 333 transitions, 711 flow. Second operand 3 states and 1134 transitions. [2025-01-09 21:33:48,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 338 transitions, 777 flow [2025-01-09 21:33:48,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 335 places, 338 transitions, 773 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:48,963 INFO L231 Difference]: Finished difference. Result has 335 places, 325 transitions, 695 flow [2025-01-09 21:33:48,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=333, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=695, PETRI_PLACES=335, PETRI_TRANSITIONS=325} [2025-01-09 21:33:48,964 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -80 predicate places. [2025-01-09 21:33:48,964 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 325 transitions, 695 flow [2025-01-09 21:33:48,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 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:48,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:48,965 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] [2025-01-09 21:33:48,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:33:48,965 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:48,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:48,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1299486537, now seen corresponding path program 1 times [2025-01-09 21:33:48,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:48,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376380567] [2025-01-09 21:33:48,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:48,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:48,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-09 21:33:48,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-09 21:33:48,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:48,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,017 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:49,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376380567] [2025-01-09 21:33:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376380567] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806493995] [2025-01-09 21:33:49,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:49,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 325 transitions, 695 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:49,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:49,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,200 INFO L124 PetriNetUnfolderBase]: 322/1592 cut-off events. [2025-01-09 21:33:49,200 INFO L125 PetriNetUnfolderBase]: For 151/151 co-relation queries the response was YES. [2025-01-09 21:33:49,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2335 conditions, 1592 events. 322/1592 cut-off events. For 151/151 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10841 event pairs, 98 based on Foata normal form. 0/1458 useless extension candidates. Maximal degree in co-relation 2238. Up to 265 conditions per place. [2025-01-09 21:33:49,210 INFO L140 encePairwiseOnDemand]: 438/443 looper letters, 21 selfloop transitions, 3 changer transitions 0/329 dead transitions. [2025-01-09 21:33:49,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 329 transitions, 757 flow [2025-01-09 21:33:49,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-01-09 21:33:49,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-01-09 21:33:49,212 INFO L175 Difference]: Start difference. First operand has 335 places, 325 transitions, 695 flow. Second operand 3 states and 1136 transitions. [2025-01-09 21:33:49,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 329 transitions, 757 flow [2025-01-09 21:33:49,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 329 transitions, 753 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:49,216 INFO L231 Difference]: Finished difference. Result has 328 places, 323 transitions, 693 flow [2025-01-09 21:33:49,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=328, PETRI_TRANSITIONS=323} [2025-01-09 21:33:49,217 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -87 predicate places. [2025-01-09 21:33:49,217 INFO L471 AbstractCegarLoop]: Abstraction has has 328 places, 323 transitions, 693 flow [2025-01-09 21:33:49,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:49,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,218 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] [2025-01-09 21:33:49,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:33:49,218 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:49,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1808213899, now seen corresponding path program 1 times [2025-01-09 21:33:49,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335808582] [2025-01-09 21:33:49,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 21:33:49,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 21:33:49,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,264 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:49,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335808582] [2025-01-09 21:33:49,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335808582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963415720] [2025-01-09 21:33:49,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,278 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 443 [2025-01-09 21:33:49,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 328 places, 323 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:49,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 443 [2025-01-09 21:33:49,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,504 INFO L124 PetriNetUnfolderBase]: 523/2110 cut-off events. [2025-01-09 21:33:49,504 INFO L125 PetriNetUnfolderBase]: For 230/261 co-relation queries the response was YES. [2025-01-09 21:33:49,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3212 conditions, 2110 events. 523/2110 cut-off events. For 230/261 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15686 event pairs, 216 based on Foata normal form. 0/1931 useless extension candidates. Maximal degree in co-relation 3115. Up to 545 conditions per place. [2025-01-09 21:33:49,516 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 24 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2025-01-09 21:33:49,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 329 transitions, 763 flow [2025-01-09 21:33:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-01-09 21:33:49,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532731376975169 [2025-01-09 21:33:49,519 INFO L175 Difference]: Start difference. First operand has 328 places, 323 transitions, 693 flow. Second operand 3 states and 1134 transitions. [2025-01-09 21:33:49,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 329 transitions, 763 flow [2025-01-09 21:33:49,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 329 transitions, 757 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:49,522 INFO L231 Difference]: Finished difference. Result has 327 places, 322 transitions, 689 flow [2025-01-09 21:33:49,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=685, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=689, PETRI_PLACES=327, PETRI_TRANSITIONS=322} [2025-01-09 21:33:49,523 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -88 predicate places. [2025-01-09 21:33:49,523 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 322 transitions, 689 flow [2025-01-09 21:33:49,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:49,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,524 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] [2025-01-09 21:33:49,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:33:49,524 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:49,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1022290656, now seen corresponding path program 1 times [2025-01-09 21:33:49,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159215398] [2025-01-09 21:33:49,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 21:33:49,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 21:33:49,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,576 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:49,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159215398] [2025-01-09 21:33:49,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159215398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089449814] [2025-01-09 21:33:49,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,585 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:49,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 322 transitions, 689 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:49,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:49,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:49,766 INFO L124 PetriNetUnfolderBase]: 353/1722 cut-off events. [2025-01-09 21:33:49,767 INFO L125 PetriNetUnfolderBase]: For 167/171 co-relation queries the response was YES. [2025-01-09 21:33:49,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2504 conditions, 1722 events. 353/1722 cut-off events. For 167/171 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 11759 event pairs, 106 based on Foata normal form. 1/1613 useless extension candidates. Maximal degree in co-relation 2407. Up to 286 conditions per place. [2025-01-09 21:33:49,777 INFO L140 encePairwiseOnDemand]: 438/443 looper letters, 20 selfloop transitions, 2 changer transitions 10/327 dead transitions. [2025-01-09 21:33:49,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 327 transitions, 753 flow [2025-01-09 21:33:49,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:49,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1136 transitions. [2025-01-09 21:33:49,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8547780285929271 [2025-01-09 21:33:49,780 INFO L175 Difference]: Start difference. First operand has 327 places, 322 transitions, 689 flow. Second operand 3 states and 1136 transitions. [2025-01-09 21:33:49,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 327 transitions, 753 flow [2025-01-09 21:33:49,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 327 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:49,783 INFO L231 Difference]: Finished difference. Result has 325 places, 310 transitions, 664 flow [2025-01-09 21:33:49,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=681, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=325, PETRI_TRANSITIONS=310} [2025-01-09 21:33:49,785 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -90 predicate places. [2025-01-09 21:33:49,785 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 310 transitions, 664 flow [2025-01-09 21:33:49,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 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:49,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:49,785 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] [2025-01-09 21:33:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:33:49,785 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:49,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:49,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1196886844, now seen corresponding path program 1 times [2025-01-09 21:33:49,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:49,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239716539] [2025-01-09 21:33:49,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:49,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:49,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-01-09 21:33:49,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-01-09 21:33:49,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:49,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:49,829 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:49,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:49,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239716539] [2025-01-09 21:33:49,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239716539] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:49,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:49,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:49,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401090758] [2025-01-09 21:33:49,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:49,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:49,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:49,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:49,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:49,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:49,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 310 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:49,843 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:49,843 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:49,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:50,001 INFO L124 PetriNetUnfolderBase]: 364/1587 cut-off events. [2025-01-09 21:33:50,002 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-01-09 21:33:50,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2424 conditions, 1587 events. 364/1587 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10457 event pairs, 147 based on Foata normal form. 0/1482 useless extension candidates. Maximal degree in co-relation 2327. Up to 397 conditions per place. [2025-01-09 21:33:50,012 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 21 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-01-09 21:33:50,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 726 flow [2025-01-09 21:33:50,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:50,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1134 transitions. [2025-01-09 21:33:50,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532731376975169 [2025-01-09 21:33:50,014 INFO L175 Difference]: Start difference. First operand has 325 places, 310 transitions, 664 flow. Second operand 3 states and 1134 transitions. [2025-01-09 21:33:50,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 726 flow [2025-01-09 21:33:50,016 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:50,018 INFO L231 Difference]: Finished difference. Result has 314 places, 309 transitions, 662 flow [2025-01-09 21:33:50,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=314, PETRI_TRANSITIONS=309} [2025-01-09 21:33:50,019 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -101 predicate places. [2025-01-09 21:33:50,020 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 309 transitions, 662 flow [2025-01-09 21:33:50,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:50,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:50,020 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] [2025-01-09 21:33:50,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:33:50,021 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err14ASSERT_VIOLATIONDATA_RACE (and 148 more)] === [2025-01-09 21:33:50,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:50,021 INFO L85 PathProgramCache]: Analyzing trace with hash -305536123, now seen corresponding path program 1 times [2025-01-09 21:33:50,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:50,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750007272] [2025-01-09 21:33:50,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:50,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 202 statements into 1 equivalence classes. [2025-01-09 21:33:50,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 202 of 202 statements. [2025-01-09 21:33:50,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:50,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:50,067 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:50,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:50,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750007272] [2025-01-09 21:33:50,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750007272] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:50,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:50,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:50,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368646292] [2025-01-09 21:33:50,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:50,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:50,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:50,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:50,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:50,081 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 443 [2025-01-09 21:33:50,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 309 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:50,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:50,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 443 [2025-01-09 21:33:50,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:50,259 INFO L124 PetriNetUnfolderBase]: 415/1854 cut-off events. [2025-01-09 21:33:50,259 INFO L125 PetriNetUnfolderBase]: For 200/208 co-relation queries the response was YES. [2025-01-09 21:33:50,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 1854 events. 415/1854 cut-off events. For 200/208 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 12915 event pairs, 166 based on Foata normal form. 0/1749 useless extension candidates. Maximal degree in co-relation 2677. Up to 440 conditions per place. [2025-01-09 21:33:50,267 INFO L140 encePairwiseOnDemand]: 440/443 looper letters, 0 selfloop transitions, 0 changer transitions 315/315 dead transitions. [2025-01-09 21:33:50,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 315 transitions, 728 flow [2025-01-09 21:33:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:50,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:50,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1135 transitions. [2025-01-09 21:33:50,268 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8540255831452219 [2025-01-09 21:33:50,268 INFO L175 Difference]: Start difference. First operand has 314 places, 309 transitions, 662 flow. Second operand 3 states and 1135 transitions. [2025-01-09 21:33:50,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 315 transitions, 728 flow [2025-01-09 21:33:50,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 315 transitions, 724 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:50,271 INFO L231 Difference]: Finished difference. Result has 313 places, 0 transitions, 0 flow [2025-01-09 21:33:50,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=443, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=313, PETRI_TRANSITIONS=0} [2025-01-09 21:33:50,272 INFO L279 CegarLoopForPetriNet]: 415 programPoint places, -102 predicate places. [2025-01-09 21:33:50,272 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 0 transitions, 0 flow [2025-01-09 21:33:50,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 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:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (151 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (150 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (149 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (148 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (147 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (146 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (145 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (144 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (143 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (142 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (141 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (140 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (139 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (138 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (137 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (136 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (135 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (134 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (133 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (132 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (131 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (130 of 152 remaining) [2025-01-09 21:33:50,274 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (129 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (128 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (127 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (126 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (125 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (124 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (123 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (122 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (121 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (120 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (119 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (118 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (117 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (116 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (115 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (114 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (113 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (112 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (111 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (110 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (109 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (108 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (107 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (106 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (105 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (104 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (103 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (102 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (101 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (100 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (99 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (98 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (97 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (96 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (95 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (94 of 152 remaining) [2025-01-09 21:33:50,275 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (93 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (92 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (91 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (90 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (89 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (88 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (87 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (86 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (85 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (84 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (83 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (82 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (80 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (79 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (78 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (77 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (76 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (75 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (74 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (73 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (72 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (71 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (70 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (69 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (68 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (67 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (66 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (65 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (64 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (63 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (62 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (61 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (60 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (59 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (58 of 152 remaining) [2025-01-09 21:33:50,276 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (57 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (56 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (55 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (54 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (53 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (52 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (51 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (50 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (49 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (46 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (45 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (44 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (43 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (42 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (41 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (40 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (38 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (37 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (36 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (35 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (33 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (32 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (31 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (30 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (29 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (28 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (27 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (26 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (25 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (24 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (23 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (22 of 152 remaining) [2025-01-09 21:33:50,277 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (21 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (20 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (19 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (18 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (17 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (16 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (15 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (14 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (13 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (12 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (11 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (10 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (9 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (8 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (7 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (6 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (5 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (4 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (3 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (2 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (1 of 152 remaining) [2025-01-09 21:33:50,278 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (0 of 152 remaining) [2025-01-09 21:33:50,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:33:50,278 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] [2025-01-09 21:33:50,282 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:50,282 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:50,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:50 BasicIcfg [2025-01-09 21:33:50,288 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:50,288 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:50,288 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:50,288 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:50,289 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:42" (3/4) ... [2025-01-09 21:33:50,290 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:50,292 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:50,292 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:50,292 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:33:50,299 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2025-01-09 21:33:50,300 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:50,300 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:50,300 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:50,375 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:50,376 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:50,376 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:50,377 INFO L158 Benchmark]: Toolchain (without parser) took 9531.08ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 111.3MB in the beginning and 361.7MB in the end (delta: -250.4MB). Peak memory consumption was 172.9MB. Max. memory is 16.1GB. [2025-01-09 21:33:50,377 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:50,378 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.74ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 97.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:33:50,378 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.74ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:50,378 INFO L158 Benchmark]: Boogie Preprocessor took 29.93ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:50,378 INFO L158 Benchmark]: RCFGBuilder took 1016.60ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 99.2MB in the end (delta: -8.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:50,379 INFO L158 Benchmark]: TraceAbstraction took 8154.39ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 98.5MB in the beginning and 365.9MB in the end (delta: -267.4MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. [2025-01-09 21:33:50,379 INFO L158 Benchmark]: Witness Printer took 87.76ms. Allocated memory is still 570.4MB. Free memory was 365.9MB in the beginning and 361.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:50,380 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.74ms. Allocated memory is still 142.6MB. Free memory was 111.3MB in the beginning and 97.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.74ms. Allocated memory is still 142.6MB. Free memory was 97.4MB in the beginning and 94.3MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.93ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 91.6MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1016.60ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 99.2MB in the end (delta: -8.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8154.39ms. Allocated memory was 142.6MB in the beginning and 570.4MB in the end (delta: 427.8MB). Free memory was 98.5MB in the beginning and 365.9MB in the end (delta: -267.4MB). Peak memory consumption was 158.5MB. Max. memory is 16.1GB. * Witness Printer took 87.76ms. Allocated memory is still 570.4MB. Free memory was 365.9MB in the beginning and 361.7MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: 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: 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: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: 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: 62]: 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: 62]: 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: 62]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: 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: 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: 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: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: 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: 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: 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: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: 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: 114]: 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: 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: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: 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: 146]: 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: 146]: 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: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: 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, 583 locations, 152 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: 8.0s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 735 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 307 mSDsluCounter, 151 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 96 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1221 IncrementalHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 96 mSolverCounterUnsat, 151 mSDtfsCounter, 1221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=856occurred in iteration=0, InterpolantAutomatonStates: 93, 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.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3998 NumberOfCodeBlocks, 3998 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 3968 ConstructedInterpolants, 0 QuantifiedInterpolants, 4141 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 86 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:50,408 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE