./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-threaded-sum-3.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-threaded-sum-3.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 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:59,374 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:59,429 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:59,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:59,435 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:59,457 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:59,459 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:59,459 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:59,459 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:59,460 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:59,461 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:59,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:59,461 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:59,461 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:59,461 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:59,461 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:59,461 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:59,461 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:59,462 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:59,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:59,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:59,463 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:59,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:59,464 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:59,464 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:59,464 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:59,464 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:59,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:59,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:59,464 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 -> 3ff96f1177b851e0082faef897c2fcf87c2462cab57ba2153c754c5e198aaf06 [2025-01-09 21:33:59,685 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:59,690 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:59,691 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:59,692 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:59,692 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:59,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-01-09 21:34:00,944 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7a7d2fb/7b2e34923c5f48198c98def08372d2a7/FLAGf87ae3ab7 [2025-01-09 21:34:01,202 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:34:01,207 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-threaded-sum-3.wvr.c [2025-01-09 21:34:01,223 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7a7d2fb/7b2e34923c5f48198c98def08372d2a7/FLAGf87ae3ab7 [2025-01-09 21:34:01,247 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/db7a7d2fb/7b2e34923c5f48198c98def08372d2a7 [2025-01-09 21:34:01,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:34:01,251 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:34:01,251 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:01,253 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:34:01,257 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:34:01,257 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,259 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65cd69c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01, skipping insertion in model container [2025-01-09 21:34:01,259 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,275 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:34:01,418 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:01,427 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:34:01,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:34:01,469 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:34:01,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01 WrapperNode [2025-01-09 21:34:01,469 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:34:01,470 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:01,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:34:01,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:34:01,475 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:34:01" (1/1) ... [2025-01-09 21:34:01,481 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:34:01" (1/1) ... [2025-01-09 21:34:01,492 INFO L138 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2025-01-09 21:34:01,493 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:34:01,493 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:34:01,493 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:34:01,494 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:34:01,499 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,499 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,501 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,506 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,507 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,509 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,513 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:34:01,524 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:34:01,524 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:34:01,524 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:34:01,525 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (1/1) ... [2025-01-09 21:34:01,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:34:01,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:34:01,550 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:34:01,552 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:34:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:34:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:34:01,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:34:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:34:01,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:34:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:34:01,568 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:34:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:34:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:34:01,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:34:01,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:34:01,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:34:01,570 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:34:01,653 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:34:01,654 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:34:01,940 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:34:01,940 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:34:02,137 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:34:02,137 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:34:02,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:02 BoogieIcfgContainer [2025-01-09 21:34:02,138 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:34:02,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:34:02,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:34:02,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:34:02,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:34:01" (1/3) ... [2025-01-09 21:34:02,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562c3c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:02, skipping insertion in model container [2025-01-09 21:34:02,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:34:01" (2/3) ... [2025-01-09 21:34:02,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@562c3c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:34:02, skipping insertion in model container [2025-01-09 21:34:02,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:02" (3/3) ... [2025-01-09 21:34:02,148 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-threaded-sum-3.wvr.c [2025-01-09 21:34:02,160 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:34:02,162 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-threaded-sum-3.wvr.c that has 4 procedures, 196 locations, 1 initial locations, 3 loop locations, and 42 error locations. [2025-01-09 21:34:02,164 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:34:02,263 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:34:02,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 203 transitions, 427 flow [2025-01-09 21:34:02,359 INFO L124 PetriNetUnfolderBase]: 8/200 cut-off events. [2025-01-09 21:34:02,362 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:34:02,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 200 events. 8/200 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 219 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 153. Up to 2 conditions per place. [2025-01-09 21:34:02,368 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 203 transitions, 427 flow [2025-01-09 21:34:02,373 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 183 transitions, 384 flow [2025-01-09 21:34:02,381 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:34:02,392 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;@54f89862, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:34:02,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-01-09 21:34:02,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:34:02,402 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-01-09 21:34:02,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:34:02,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,403 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] [2025-01-09 21:34:02,404 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:02,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1222421413, now seen corresponding path program 1 times [2025-01-09 21:34:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64900918] [2025-01-09 21:34:02,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 21:34:02,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 21:34:02,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:02,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64900918] [2025-01-09 21:34:02,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64900918] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736181282] [2025-01-09 21:34:02,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:02,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 203 [2025-01-09 21:34:02,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 183 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:02,623 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,623 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 203 [2025-01-09 21:34:02,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,745 INFO L124 PetriNetUnfolderBase]: 140/413 cut-off events. [2025-01-09 21:34:02,745 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-01-09 21:34:02,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 413 events. 140/413 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1306 event pairs, 74 based on Foata normal form. 1/348 useless extension candidates. Maximal degree in co-relation 494. Up to 210 conditions per place. [2025-01-09 21:34:02,749 INFO L140 encePairwiseOnDemand]: 173/203 looper letters, 23 selfloop transitions, 2 changer transitions 1/155 dead transitions. [2025-01-09 21:34:02,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 155 transitions, 378 flow [2025-01-09 21:34:02,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-01-09 21:34:02,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8111658456486043 [2025-01-09 21:34:02,760 INFO L175 Difference]: Start difference. First operand has 186 places, 183 transitions, 384 flow. Second operand 3 states and 494 transitions. [2025-01-09 21:34:02,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 155 transitions, 378 flow [2025-01-09 21:34:02,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 155 transitions, 366 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:34:02,766 INFO L231 Difference]: Finished difference. Result has 155 places, 154 transitions, 318 flow [2025-01-09 21:34:02,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=318, PETRI_PLACES=155, PETRI_TRANSITIONS=154} [2025-01-09 21:34:02,770 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -31 predicate places. [2025-01-09 21:34:02,770 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 154 transitions, 318 flow [2025-01-09 21:34:02,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:02,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,771 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:34:02,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:34:02,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:02,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,772 INFO L85 PathProgramCache]: Analyzing trace with hash 818920703, now seen corresponding path program 1 times [2025-01-09 21:34:02,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531261598] [2025-01-09 21:34:02,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:34:02,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:34:02,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:02,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531261598] [2025-01-09 21:34:02,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531261598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906189377] [2025-01-09 21:34:02,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:02,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 203 [2025-01-09 21:34:02,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 154 transitions, 318 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:02,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:02,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 203 [2025-01-09 21:34:02,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:02,955 INFO L124 PetriNetUnfolderBase]: 140/411 cut-off events. [2025-01-09 21:34:02,955 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:02,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 411 events. 140/411 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1319 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 608. Up to 210 conditions per place. [2025-01-09 21:34:02,957 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 23 selfloop transitions, 2 changer transitions 0/153 dead transitions. [2025-01-09 21:34:02,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 153 transitions, 366 flow [2025-01-09 21:34:02,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:02,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:02,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-01-09 21:34:02,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7668308702791461 [2025-01-09 21:34:02,959 INFO L175 Difference]: Start difference. First operand has 155 places, 154 transitions, 318 flow. Second operand 3 states and 467 transitions. [2025-01-09 21:34:02,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 153 transitions, 366 flow [2025-01-09 21:34:02,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 153 transitions, 362 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:02,962 INFO L231 Difference]: Finished difference. Result has 153 places, 153 transitions, 316 flow [2025-01-09 21:34:02,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=153, PETRI_TRANSITIONS=153} [2025-01-09 21:34:02,963 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -33 predicate places. [2025-01-09 21:34:02,963 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 153 transitions, 316 flow [2025-01-09 21:34:02,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:02,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:02,963 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] [2025-01-09 21:34:02,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:34:02,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:02,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:02,964 INFO L85 PathProgramCache]: Analyzing trace with hash -587071064, now seen corresponding path program 1 times [2025-01-09 21:34:02,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:02,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418850778] [2025-01-09 21:34:02,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:02,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:02,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:34:02,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:34:02,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:02,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:02,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:02,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:02,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418850778] [2025-01-09 21:34:02,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418850778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:02,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:02,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:02,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180739737] [2025-01-09 21:34:02,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:02,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:02,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:02,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:02,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 203 [2025-01-09 21:34:03,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 153 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 203 [2025-01-09 21:34:03,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,085 INFO L124 PetriNetUnfolderBase]: 140/410 cut-off events. [2025-01-09 21:34:03,085 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:03,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 410 events. 140/410 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1312 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 600. Up to 210 conditions per place. [2025-01-09 21:34:03,089 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 23 selfloop transitions, 2 changer transitions 0/152 dead transitions. [2025-01-09 21:34:03,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 152 transitions, 364 flow [2025-01-09 21:34:03,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-01-09 21:34:03,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7668308702791461 [2025-01-09 21:34:03,092 INFO L175 Difference]: Start difference. First operand has 153 places, 153 transitions, 316 flow. Second operand 3 states and 467 transitions. [2025-01-09 21:34:03,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 152 transitions, 364 flow [2025-01-09 21:34:03,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 152 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:03,096 INFO L231 Difference]: Finished difference. Result has 152 places, 152 transitions, 314 flow [2025-01-09 21:34:03,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=150, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=150, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=152, PETRI_TRANSITIONS=152} [2025-01-09 21:34:03,098 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -34 predicate places. [2025-01-09 21:34:03,099 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 152 transitions, 314 flow [2025-01-09 21:34:03,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.33333333333334) internal successors, (445), 3 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:03,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:34:03,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:03,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1533799987, now seen corresponding path program 1 times [2025-01-09 21:34:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360757166] [2025-01-09 21:34:03,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:34:03,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:34:03,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:03,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360757166] [2025-01-09 21:34:03,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360757166] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325604383] [2025-01-09 21:34:03,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,150 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 203 [2025-01-09 21:34:03,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 152 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 203 [2025-01-09 21:34:03,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,230 INFO L124 PetriNetUnfolderBase]: 140/407 cut-off events. [2025-01-09 21:34:03,230 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:03,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 407 events. 140/407 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1307 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 589. Up to 209 conditions per place. [2025-01-09 21:34:03,232 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 23 selfloop transitions, 1 changer transitions 0/149 dead transitions. [2025-01-09 21:34:03,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 149 transitions, 356 flow [2025-01-09 21:34:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2025-01-09 21:34:03,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7684729064039408 [2025-01-09 21:34:03,234 INFO L175 Difference]: Start difference. First operand has 152 places, 152 transitions, 314 flow. Second operand 3 states and 468 transitions. [2025-01-09 21:34:03,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 149 transitions, 356 flow [2025-01-09 21:34:03,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 149 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:03,236 INFO L231 Difference]: Finished difference. Result has 149 places, 149 transitions, 306 flow [2025-01-09 21:34:03,237 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=306, PETRI_PLACES=149, PETRI_TRANSITIONS=149} [2025-01-09 21:34:03,237 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -37 predicate places. [2025-01-09 21:34:03,237 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 149 transitions, 306 flow [2025-01-09 21:34:03,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,238 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] [2025-01-09 21:34:03,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:34:03,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:03,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,238 INFO L85 PathProgramCache]: Analyzing trace with hash 919306405, now seen corresponding path program 1 times [2025-01-09 21:34:03,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480930721] [2025-01-09 21:34:03,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:34:03,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:34:03,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:03,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480930721] [2025-01-09 21:34:03,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480930721] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030276816] [2025-01-09 21:34:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 203 [2025-01-09 21:34:03,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 149 transitions, 306 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 203 [2025-01-09 21:34:03,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,381 INFO L124 PetriNetUnfolderBase]: 140/406 cut-off events. [2025-01-09 21:34:03,382 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:03,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 631 conditions, 406 events. 140/406 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1305 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 585. Up to 207 conditions per place. [2025-01-09 21:34:03,384 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 20 selfloop transitions, 2 changer transitions 0/148 dead transitions. [2025-01-09 21:34:03,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 148 transitions, 348 flow [2025-01-09 21:34:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:34:03,387 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7766830870279147 [2025-01-09 21:34:03,387 INFO L175 Difference]: Start difference. First operand has 149 places, 149 transitions, 306 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:34:03,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 148 transitions, 348 flow [2025-01-09 21:34:03,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 148 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:03,391 INFO L231 Difference]: Finished difference. Result has 149 places, 148 transitions, 307 flow [2025-01-09 21:34:03,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=307, PETRI_PLACES=149, PETRI_TRANSITIONS=148} [2025-01-09 21:34:03,392 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -37 predicate places. [2025-01-09 21:34:03,392 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 148 transitions, 307 flow [2025-01-09 21:34:03,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,393 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] [2025-01-09 21:34:03,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:34:03,395 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:03,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1948644184, now seen corresponding path program 1 times [2025-01-09 21:34:03,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796391439] [2025-01-09 21:34:03,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:34:03,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:34:03,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:03,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796391439] [2025-01-09 21:34:03,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796391439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448346738] [2025-01-09 21:34:03,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 203 [2025-01-09 21:34:03,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 148 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 203 [2025-01-09 21:34:03,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,525 INFO L124 PetriNetUnfolderBase]: 140/403 cut-off events. [2025-01-09 21:34:03,526 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:03,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 632 conditions, 403 events. 140/403 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1298 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 586. Up to 209 conditions per place. [2025-01-09 21:34:03,528 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 23 selfloop transitions, 1 changer transitions 0/145 dead transitions. [2025-01-09 21:34:03,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 145 transitions, 349 flow [2025-01-09 21:34:03,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 468 transitions. [2025-01-09 21:34:03,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7684729064039408 [2025-01-09 21:34:03,531 INFO L175 Difference]: Start difference. First operand has 149 places, 148 transitions, 307 flow. Second operand 3 states and 468 transitions. [2025-01-09 21:34:03,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 145 transitions, 349 flow [2025-01-09 21:34:03,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 145 transitions, 345 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:03,533 INFO L231 Difference]: Finished difference. Result has 146 places, 145 transitions, 299 flow [2025-01-09 21:34:03,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=146, PETRI_TRANSITIONS=145} [2025-01-09 21:34:03,535 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -40 predicate places. [2025-01-09 21:34:03,536 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 145 transitions, 299 flow [2025-01-09 21:34:03,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,536 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,536 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] [2025-01-09 21:34:03,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:34:03,537 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1029721097, now seen corresponding path program 1 times [2025-01-09 21:34:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758271922] [2025-01-09 21:34:03,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-01-09 21:34:03,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-01-09 21:34:03,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:03,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758271922] [2025-01-09 21:34:03,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758271922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487888491] [2025-01-09 21:34:03,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 203 [2025-01-09 21:34:03,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 145 transitions, 299 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 203 [2025-01-09 21:34:03,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,691 INFO L124 PetriNetUnfolderBase]: 140/402 cut-off events. [2025-01-09 21:34:03,692 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:03,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 402 events. 140/402 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1313 event pairs, 74 based on Foata normal form. 0/347 useless extension candidates. Maximal degree in co-relation 582. Up to 207 conditions per place. [2025-01-09 21:34:03,694 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 20 selfloop transitions, 2 changer transitions 0/144 dead transitions. [2025-01-09 21:34:03,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 341 flow [2025-01-09 21:34:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:34:03,696 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7766830870279147 [2025-01-09 21:34:03,696 INFO L175 Difference]: Start difference. First operand has 146 places, 145 transitions, 299 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:34:03,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 341 flow [2025-01-09 21:34:03,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 144 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:03,699 INFO L231 Difference]: Finished difference. Result has 146 places, 144 transitions, 300 flow [2025-01-09 21:34:03,699 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=300, PETRI_PLACES=146, PETRI_TRANSITIONS=144} [2025-01-09 21:34:03,700 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -40 predicate places. [2025-01-09 21:34:03,701 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 144 transitions, 300 flow [2025-01-09 21:34:03,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:03,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:34:03,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:03,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1764105654, now seen corresponding path program 1 times [2025-01-09 21:34:03,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605716488] [2025-01-09 21:34:03,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:34:03,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:34:03,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:03,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605716488] [2025-01-09 21:34:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605716488] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171959909] [2025-01-09 21:34:03,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 203 [2025-01-09 21:34:03,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 144 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 203 [2025-01-09 21:34:03,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,839 INFO L124 PetriNetUnfolderBase]: 140/399 cut-off events. [2025-01-09 21:34:03,839 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:03,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 628 conditions, 399 events. 140/399 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1306 event pairs, 74 based on Foata normal form. 1/347 useless extension candidates. Maximal degree in co-relation 582. Up to 208 conditions per place. [2025-01-09 21:34:03,842 INFO L140 encePairwiseOnDemand]: 199/203 looper letters, 21 selfloop transitions, 1 changer transitions 6/141 dead transitions. [2025-01-09 21:34:03,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 141 transitions, 340 flow [2025-01-09 21:34:03,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2025-01-09 21:34:03,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7668308702791461 [2025-01-09 21:34:03,844 INFO L175 Difference]: Start difference. First operand has 146 places, 144 transitions, 300 flow. Second operand 3 states and 467 transitions. [2025-01-09 21:34:03,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 141 transitions, 340 flow [2025-01-09 21:34:03,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:03,847 INFO L231 Difference]: Finished difference. Result has 143 places, 135 transitions, 280 flow [2025-01-09 21:34:03,847 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=143, PETRI_TRANSITIONS=135} [2025-01-09 21:34:03,847 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -43 predicate places. [2025-01-09 21:34:03,847 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 135 transitions, 280 flow [2025-01-09 21:34:03,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,848 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] [2025-01-09 21:34:03,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:34:03,848 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:03,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,849 INFO L85 PathProgramCache]: Analyzing trace with hash -129135419, now seen corresponding path program 1 times [2025-01-09 21:34:03,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343458295] [2025-01-09 21:34:03,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-01-09 21:34:03,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-01-09 21:34:03,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:03,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:03,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343458295] [2025-01-09 21:34:03,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343458295] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:03,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:03,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:03,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406627829] [2025-01-09 21:34:03,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:03,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:03,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:03,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:03,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:03,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 203 [2025-01-09 21:34:03,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 135 transitions, 280 flow. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:03,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 203 [2025-01-09 21:34:03,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:03,939 INFO L124 PetriNetUnfolderBase]: 140/392 cut-off events. [2025-01-09 21:34:03,939 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:03,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 619 conditions, 392 events. 140/392 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1307 event pairs, 74 based on Foata normal form. 0/341 useless extension candidates. Maximal degree in co-relation 573. Up to 207 conditions per place. [2025-01-09 21:34:03,941 INFO L140 encePairwiseOnDemand]: 200/203 looper letters, 20 selfloop transitions, 2 changer transitions 0/134 dead transitions. [2025-01-09 21:34:03,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 134 transitions, 322 flow [2025-01-09 21:34:03,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:03,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 473 transitions. [2025-01-09 21:34:03,943 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7766830870279147 [2025-01-09 21:34:03,943 INFO L175 Difference]: Start difference. First operand has 143 places, 135 transitions, 280 flow. Second operand 3 states and 473 transitions. [2025-01-09 21:34:03,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 134 transitions, 322 flow [2025-01-09 21:34:03,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 134 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:34:03,945 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 281 flow [2025-01-09 21:34:03,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=281, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2025-01-09 21:34:03,945 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -49 predicate places. [2025-01-09 21:34:03,945 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 281 flow [2025-01-09 21:34:03,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:03,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:34:03,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:03,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:34:03,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:34:03,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:34:03,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1998483111, now seen corresponding path program 1 times [2025-01-09 21:34:03,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:34:03,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380232217] [2025-01-09 21:34:03,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:34:03,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:34:03,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:34:03,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:34:03,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:34:03,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:34:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:34:04,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:34:04,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380232217] [2025-01-09 21:34:04,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380232217] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:34:04,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:34:04,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:34:04,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067859498] [2025-01-09 21:34:04,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:34:04,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:34:04,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:34:04,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:34:04,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:34:04,020 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 203 [2025-01-09 21:34:04,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 134 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:04,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:34:04,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 203 [2025-01-09 21:34:04,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:34:04,079 INFO L124 PetriNetUnfolderBase]: 140/391 cut-off events. [2025-01-09 21:34:04,079 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-01-09 21:34:04,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 616 conditions, 391 events. 140/391 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1312 event pairs, 74 based on Foata normal form. 1/341 useless extension candidates. Maximal degree in co-relation 571. Up to 204 conditions per place. [2025-01-09 21:34:04,080 INFO L140 encePairwiseOnDemand]: 201/203 looper letters, 0 selfloop transitions, 0 changer transitions 133/133 dead transitions. [2025-01-09 21:34:04,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 133 transitions, 315 flow [2025-01-09 21:34:04,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:34:04,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:34:04,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2025-01-09 21:34:04,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7898193760262726 [2025-01-09 21:34:04,081 INFO L175 Difference]: Start difference. First operand has 137 places, 134 transitions, 281 flow. Second operand 3 states and 481 transitions. [2025-01-09 21:34:04,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 133 transitions, 315 flow [2025-01-09 21:34:04,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 133 transitions, 311 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:34:04,083 INFO L231 Difference]: Finished difference. Result has 136 places, 0 transitions, 0 flow [2025-01-09 21:34:04,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=133, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=136, PETRI_TRANSITIONS=0} [2025-01-09 21:34:04,083 INFO L279 CegarLoopForPetriNet]: 186 programPoint places, -50 predicate places. [2025-01-09 21:34:04,083 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 0 transitions, 0 flow [2025-01-09 21:34:04,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-01-09 21:34:04,086 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-01-09 21:34:04,087 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-01-09 21:34:04,088 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (30 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (29 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-01-09 21:34:04,089 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-01-09 21:34:04,090 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-01-09 21:34:04,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:34:04,090 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:34:04,094 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:34:04,094 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:34:04,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:34:04 BasicIcfg [2025-01-09 21:34:04,098 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:34:04,098 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:34:04,098 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:34:04,098 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:34:04,099 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:34:02" (3/4) ... [2025-01-09 21:34:04,100 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:34:04,101 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:34:04,101 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:34:04,101 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:34:04,104 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 21:34:04,104 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:34:04,104 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:34:04,105 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:34:04,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:34:04,169 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:34:04,169 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:34:04,170 INFO L158 Benchmark]: Toolchain (without parser) took 2919.23ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 106.6MB in the beginning and 133.7MB in the end (delta: -27.1MB). Peak memory consumption was 129.0MB. Max. memory is 16.1GB. [2025-01-09 21:34:04,170 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:04,170 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 93.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:04,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.75ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:34:04,172 INFO L158 Benchmark]: Boogie Preprocessor took 29.88ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.6MB in the end (delta: 860.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:04,172 INFO L158 Benchmark]: RCFGBuilder took 613.76ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 42.9MB in the end (delta: 47.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-09 21:34:04,173 INFO L158 Benchmark]: TraceAbstraction took 1958.70ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 42.1MB in the beginning and 139.2MB in the end (delta: -97.1MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. [2025-01-09 21:34:04,173 INFO L158 Benchmark]: Witness Printer took 71.11ms. Allocated memory is still 302.0MB. Free memory was 139.2MB in the beginning and 133.7MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:34:04,174 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.17ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.22ms. Allocated memory is still 142.6MB. Free memory was 106.6MB in the beginning and 93.9MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.75ms. Allocated memory is still 142.6MB. Free memory was 93.9MB in the beginning and 92.4MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.88ms. Allocated memory is still 142.6MB. Free memory was 92.4MB in the beginning and 91.6MB in the end (delta: 860.9kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 613.76ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 42.9MB in the end (delta: 47.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1958.70ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 42.1MB in the beginning and 139.2MB in the end (delta: -97.1MB). Peak memory consumption was 61.9MB. Max. memory is 16.1GB. * Witness Printer took 71.11ms. Allocated memory is still 302.0MB. Free memory was 139.2MB in the beginning and 133.7MB in the end (delta: 5.5MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: 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: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 105]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: 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: 117]: 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: 117]: 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, 250 locations, 71 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: 1.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 424 IncrementalHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 44 mSDtfsCounter, 424 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=0, InterpolantAutomatonStates: 30, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 504 ConstructedInterpolants, 0 QuantifiedInterpolants, 524 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:34:04,188 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