./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-collitem-trans.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 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:24,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:24,866 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:24,871 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:24,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:24,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:24,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:24,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:24,902 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:24,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:24,903 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:24,903 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:24,903 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:24,903 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:24,903 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:24,903 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:24,903 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:24,904 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:24,904 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:24,904 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:24,904 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:24,904 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:24,904 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:24,904 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:24,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:24,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:24,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:24,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:24,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:24,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:24,905 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:24,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:24,906 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:24,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:24,906 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:24,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:24,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:24,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:24,907 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 -> 3e310cbbcaa6ee1bb3c2e05a2a5fb7cb2ddde366fa4283fb7922170dd08986ab [2025-01-09 21:30:25,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:25,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:25,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:25,217 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:25,218 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:25,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-01-09 21:30:26,512 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fda87691/7884e5716a564b31b0874a3d71233894/FLAGfb3cf78aa [2025-01-09 21:30:26,805 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:26,810 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-trans.wvr.c [2025-01-09 21:30:26,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fda87691/7884e5716a564b31b0874a3d71233894/FLAGfb3cf78aa [2025-01-09 21:30:27,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3fda87691/7884e5716a564b31b0874a3d71233894 [2025-01-09 21:30:27,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:27,091 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:27,093 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:27,093 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:27,097 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:27,098 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,099 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@84a568b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27, skipping insertion in model container [2025-01-09 21:30:27,099 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,116 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:27,290 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:27,302 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:27,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:27,349 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:27,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27 WrapperNode [2025-01-09 21:30:27,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:27,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:27,352 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:27,352 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:27,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,371 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,410 INFO L138 Inliner]: procedures = 22, calls = 31, calls flagged for inlining = 18, calls inlined = 40, statements flattened = 541 [2025-01-09 21:30:27,411 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:27,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:27,411 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:27,411 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:27,420 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,420 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,424 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,424 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,434 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,436 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,440 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:27,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:27,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:27,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:27,453 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (1/1) ... [2025-01-09 21:30:27,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:27,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:27,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:27,511 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:27,511 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:27,512 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:30:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:30:27,512 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:27,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:27,514 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:27,633 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:27,635 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:28,392 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:28,392 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:29,279 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:29,279 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:29,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:29 BoogieIcfgContainer [2025-01-09 21:30:29,279 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:29,283 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:29,283 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:29,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:29,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:27" (1/3) ... [2025-01-09 21:30:29,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd7c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:29, skipping insertion in model container [2025-01-09 21:30:29,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:27" (2/3) ... [2025-01-09 21:30:29,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd7c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:29, skipping insertion in model container [2025-01-09 21:30:29,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:29" (3/3) ... [2025-01-09 21:30:29,291 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-trans.wvr.c [2025-01-09 21:30:29,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:29,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-trans.wvr.c that has 4 procedures, 257 locations, 1 initial locations, 0 loop locations, and 69 error locations. [2025-01-09 21:30:29,312 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:29,439 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:29,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 266 places, 259 transitions, 539 flow [2025-01-09 21:30:29,617 INFO L124 PetriNetUnfolderBase]: 3/256 cut-off events. [2025-01-09 21:30:29,619 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:29,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 256 events. 3/256 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 387 event pairs, 0 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2025-01-09 21:30:29,628 INFO L82 GeneralOperation]: Start removeDead. Operand has 266 places, 259 transitions, 539 flow [2025-01-09 21:30:29,636 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 244 places, 235 transitions, 488 flow [2025-01-09 21:30:29,647 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:29,663 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;@16f0f7d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:29,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 126 error locations. [2025-01-09 21:30:29,674 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:29,676 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-01-09 21:30:29,676 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:29,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:29,678 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] [2025-01-09 21:30:29,678 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:29,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:29,685 INFO L85 PathProgramCache]: Analyzing trace with hash -120604151, now seen corresponding path program 1 times [2025-01-09 21:30:29,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:29,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-01-09 21:30:29,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:29,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:29,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-09 21:30:29,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-09 21:30:29,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:29,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:29,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:29,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662790227] [2025-01-09 21:30:29,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662790227] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:29,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:29,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:29,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50301179] [2025-01-09 21:30:29,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:29,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:29,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:29,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:29,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:29,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:29,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 235 transitions, 488 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:29,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:29,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:29,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,062 INFO L124 PetriNetUnfolderBase]: 16/227 cut-off events. [2025-01-09 21:30:30,062 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:30:30,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 294 conditions, 227 events. 16/227 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 221 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 183. Up to 40 conditions per place. [2025-01-09 21:30:30,065 INFO L140 encePairwiseOnDemand]: 202/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/180 dead transitions. [2025-01-09 21:30:30,065 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 180 transitions, 406 flow [2025-01-09 21:30:30,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-01-09 21:30:30,083 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8108108108108109 [2025-01-09 21:30:30,086 INFO L175 Difference]: Start difference. First operand has 244 places, 235 transitions, 488 flow. Second operand 3 states and 630 transitions. [2025-01-09 21:30:30,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 180 transitions, 406 flow [2025-01-09 21:30:30,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 180 transitions, 394 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:30,100 INFO L231 Difference]: Finished difference. Result has 185 places, 180 transitions, 370 flow [2025-01-09 21:30:30,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=370, PETRI_PLACES=185, PETRI_TRANSITIONS=180} [2025-01-09 21:30:30,107 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -59 predicate places. [2025-01-09 21:30:30,108 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 180 transitions, 370 flow [2025-01-09 21:30:30,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,109 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] [2025-01-09 21:30:30,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:30,110 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:30,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,111 INFO L85 PathProgramCache]: Analyzing trace with hash 340773378, now seen corresponding path program 1 times [2025-01-09 21:30:30,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209966133] [2025-01-09 21:30:30,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:30:30,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:30:30,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:30,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209966133] [2025-01-09 21:30:30,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209966133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99042447] [2025-01-09 21:30:30,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:30,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 180 transitions, 370 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:30,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,294 INFO L124 PetriNetUnfolderBase]: 16/226 cut-off events. [2025-01-09 21:30:30,294 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:30,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 226 events. 16/226 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 221 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 239. Up to 40 conditions per place. [2025-01-09 21:30:30,296 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/179 dead transitions. [2025-01-09 21:30:30,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 179 transitions, 396 flow [2025-01-09 21:30:30,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:30,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:30,299 INFO L175 Difference]: Start difference. First operand has 185 places, 180 transitions, 370 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:30,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 179 transitions, 396 flow [2025-01-09 21:30:30,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 179 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:30,303 INFO L231 Difference]: Finished difference. Result has 184 places, 179 transitions, 368 flow [2025-01-09 21:30:30,304 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=368, PETRI_PLACES=184, PETRI_TRANSITIONS=179} [2025-01-09 21:30:30,304 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -60 predicate places. [2025-01-09 21:30:30,304 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 179 transitions, 368 flow [2025-01-09 21:30:30,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,305 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] [2025-01-09 21:30:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:30,306 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:30,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,307 INFO L85 PathProgramCache]: Analyzing trace with hash -848682038, now seen corresponding path program 1 times [2025-01-09 21:30:30,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-01-09 21:30:30,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:30:30,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:30:30,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:30,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488859146] [2025-01-09 21:30:30,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488859146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65577051] [2025-01-09 21:30:30,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:30,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 179 transitions, 368 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:30,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,518 INFO L124 PetriNetUnfolderBase]: 16/225 cut-off events. [2025-01-09 21:30:30,518 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:30,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 225 events. 16/225 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 230. Up to 40 conditions per place. [2025-01-09 21:30:30,519 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/178 dead transitions. [2025-01-09 21:30:30,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 178 transitions, 394 flow [2025-01-09 21:30:30,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:30,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:30,523 INFO L175 Difference]: Start difference. First operand has 184 places, 179 transitions, 368 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:30,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 178 transitions, 394 flow [2025-01-09 21:30:30,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 178 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:30,531 INFO L231 Difference]: Finished difference. Result has 183 places, 178 transitions, 366 flow [2025-01-09 21:30:30,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=183, PETRI_TRANSITIONS=178} [2025-01-09 21:30:30,533 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -61 predicate places. [2025-01-09 21:30:30,533 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 178 transitions, 366 flow [2025-01-09 21:30:30,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,534 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:30:30,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:30,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:30,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,535 INFO L85 PathProgramCache]: Analyzing trace with hash -191002288, now seen corresponding path program 1 times [2025-01-09 21:30:30,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-01-09 21:30:30,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-01-09 21:30:30,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-01-09 21:30:30,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83327381] [2025-01-09 21:30:30,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83327381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280296098] [2025-01-09 21:30:30,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:30,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 178 transitions, 366 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:30,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,710 INFO L124 PetriNetUnfolderBase]: 16/224 cut-off events. [2025-01-09 21:30:30,711 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:30,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 224 events. 16/224 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 218 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 221. Up to 40 conditions per place. [2025-01-09 21:30:30,714 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/177 dead transitions. [2025-01-09 21:30:30,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 177 transitions, 392 flow [2025-01-09 21:30:30,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:30,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:30,718 INFO L175 Difference]: Start difference. First operand has 183 places, 178 transitions, 366 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:30,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 177 transitions, 392 flow [2025-01-09 21:30:30,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 177 transitions, 388 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:30,722 INFO L231 Difference]: Finished difference. Result has 182 places, 177 transitions, 364 flow [2025-01-09 21:30:30,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=364, PETRI_PLACES=182, PETRI_TRANSITIONS=177} [2025-01-09 21:30:30,723 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -62 predicate places. [2025-01-09 21:30:30,724 INFO L471 AbstractCegarLoop]: Abstraction has has 182 places, 177 transitions, 364 flow [2025-01-09 21:30:30,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:30,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:30,725 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:30,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,726 INFO L85 PathProgramCache]: Analyzing trace with hash -767190318, now seen corresponding path program 1 times [2025-01-09 21:30:30,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029497643] [2025-01-09 21:30:30,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:30:30,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:30:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:30,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029497643] [2025-01-09 21:30:30,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029497643] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520928212] [2025-01-09 21:30:30,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:30,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 177 transitions, 364 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:30,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:30,871 INFO L124 PetriNetUnfolderBase]: 16/223 cut-off events. [2025-01-09 21:30:30,871 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:30,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 276 conditions, 223 events. 16/223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 217 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 212. Up to 40 conditions per place. [2025-01-09 21:30:30,872 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2025-01-09 21:30:30,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 176 transitions, 390 flow [2025-01-09 21:30:30,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:30,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:30,875 INFO L175 Difference]: Start difference. First operand has 182 places, 177 transitions, 364 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:30,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 176 transitions, 390 flow [2025-01-09 21:30:30,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 176 transitions, 386 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:30,880 INFO L231 Difference]: Finished difference. Result has 181 places, 176 transitions, 362 flow [2025-01-09 21:30:30,880 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=362, PETRI_PLACES=181, PETRI_TRANSITIONS=176} [2025-01-09 21:30:30,882 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -63 predicate places. [2025-01-09 21:30:30,882 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 362 flow [2025-01-09 21:30:30,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:30,883 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] [2025-01-09 21:30:30,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:30,883 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:30,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:30,884 INFO L85 PathProgramCache]: Analyzing trace with hash 414919141, now seen corresponding path program 1 times [2025-01-09 21:30:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:30,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630750072] [2025-01-09 21:30:30,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:30,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:30,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-01-09 21:30:30,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-01-09 21:30:30,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:30,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:30,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:30,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:30,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630750072] [2025-01-09 21:30:30,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630750072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:30,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:30,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:30,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881911690] [2025-01-09 21:30:30,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:30,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:30,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:30,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:30,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:30,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:30,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:30,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:30,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:30,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,050 INFO L124 PetriNetUnfolderBase]: 16/222 cut-off events. [2025-01-09 21:30:31,051 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:31,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 275 conditions, 222 events. 16/222 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 203. Up to 40 conditions per place. [2025-01-09 21:30:31,052 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/175 dead transitions. [2025-01-09 21:30:31,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 175 transitions, 388 flow [2025-01-09 21:30:31,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:31,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:31,055 INFO L175 Difference]: Start difference. First operand has 181 places, 176 transitions, 362 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:31,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 175 transitions, 388 flow [2025-01-09 21:30:31,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 175 transitions, 384 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,058 INFO L231 Difference]: Finished difference. Result has 180 places, 175 transitions, 360 flow [2025-01-09 21:30:31,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=180, PETRI_TRANSITIONS=175} [2025-01-09 21:30:31,059 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -64 predicate places. [2025-01-09 21:30:31,060 INFO L471 AbstractCegarLoop]: Abstraction has has 180 places, 175 transitions, 360 flow [2025-01-09 21:30:31,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,060 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] [2025-01-09 21:30:31,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:31,060 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:31,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,063 INFO L85 PathProgramCache]: Analyzing trace with hash 190325145, now seen corresponding path program 1 times [2025-01-09 21:30:31,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389548936] [2025-01-09 21:30:31,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 21:30:31,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 21:30:31,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:31,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389548936] [2025-01-09 21:30:31,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389548936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702355791] [2025-01-09 21:30:31,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:31,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 180 places, 175 transitions, 360 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:31,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,201 INFO L124 PetriNetUnfolderBase]: 16/221 cut-off events. [2025-01-09 21:30:31,201 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:31,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 221 events. 16/221 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 194. Up to 40 conditions per place. [2025-01-09 21:30:31,202 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/174 dead transitions. [2025-01-09 21:30:31,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 174 transitions, 386 flow [2025-01-09 21:30:31,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:31,205 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:31,205 INFO L175 Difference]: Start difference. First operand has 180 places, 175 transitions, 360 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:31,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 174 transitions, 386 flow [2025-01-09 21:30:31,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 174 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,208 INFO L231 Difference]: Finished difference. Result has 179 places, 174 transitions, 358 flow [2025-01-09 21:30:31,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=358, PETRI_PLACES=179, PETRI_TRANSITIONS=174} [2025-01-09 21:30:31,209 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -65 predicate places. [2025-01-09 21:30:31,209 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 174 transitions, 358 flow [2025-01-09 21:30:31,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,210 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] [2025-01-09 21:30:31,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:31,211 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:31,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,211 INFO L85 PathProgramCache]: Analyzing trace with hash -386714039, now seen corresponding path program 1 times [2025-01-09 21:30:31,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-01-09 21:30:31,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-01-09 21:30:31,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-01-09 21:30:31,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,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:30:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142428784] [2025-01-09 21:30:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142428784] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263028662] [2025-01-09 21:30:31,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,284 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,292 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:31,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 174 transitions, 358 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:31,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,357 INFO L124 PetriNetUnfolderBase]: 16/220 cut-off events. [2025-01-09 21:30:31,357 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:31,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 273 conditions, 220 events. 16/220 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 185. Up to 40 conditions per place. [2025-01-09 21:30:31,358 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/173 dead transitions. [2025-01-09 21:30:31,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 173 transitions, 384 flow [2025-01-09 21:30:31,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:31,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:31,361 INFO L175 Difference]: Start difference. First operand has 179 places, 174 transitions, 358 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:31,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 173 transitions, 384 flow [2025-01-09 21:30:31,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 173 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,364 INFO L231 Difference]: Finished difference. Result has 178 places, 173 transitions, 356 flow [2025-01-09 21:30:31,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=176, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=178, PETRI_TRANSITIONS=173} [2025-01-09 21:30:31,364 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -66 predicate places. [2025-01-09 21:30:31,365 INFO L471 AbstractCegarLoop]: Abstraction has has 178 places, 173 transitions, 356 flow [2025-01-09 21:30:31,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,365 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] [2025-01-09 21:30:31,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:31,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1808249474, now seen corresponding path program 1 times [2025-01-09 21:30:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607620528] [2025-01-09 21:30:31,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 21:30:31,382 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 21:30:31,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607620528] [2025-01-09 21:30:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607620528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936550621] [2025-01-09 21:30:31,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:31,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 178 places, 173 transitions, 356 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:31,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,534 INFO L124 PetriNetUnfolderBase]: 16/219 cut-off events. [2025-01-09 21:30:31,534 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:31,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 219 events. 16/219 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 214 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 176. Up to 40 conditions per place. [2025-01-09 21:30:31,536 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/172 dead transitions. [2025-01-09 21:30:31,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 172 transitions, 382 flow [2025-01-09 21:30:31,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:31,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:31,539 INFO L175 Difference]: Start difference. First operand has 178 places, 173 transitions, 356 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:31,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 172 transitions, 382 flow [2025-01-09 21:30:31,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 172 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,543 INFO L231 Difference]: Finished difference. Result has 177 places, 172 transitions, 354 flow [2025-01-09 21:30:31,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=177, PETRI_TRANSITIONS=172} [2025-01-09 21:30:31,544 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -67 predicate places. [2025-01-09 21:30:31,544 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 172 transitions, 354 flow [2025-01-09 21:30:31,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,544 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] [2025-01-09 21:30:31,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:31,544 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,545 INFO L85 PathProgramCache]: Analyzing trace with hash 150126939, now seen corresponding path program 1 times [2025-01-09 21:30:31,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-01-09 21:30:31,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:30:31,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:30:31,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:31,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240889597] [2025-01-09 21:30:31,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240889597] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143104084] [2025-01-09 21:30:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:31,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 172 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:31,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,716 INFO L124 PetriNetUnfolderBase]: 16/218 cut-off events. [2025-01-09 21:30:31,716 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:31,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 218 events. 16/218 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 213 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 167. Up to 40 conditions per place. [2025-01-09 21:30:31,718 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-01-09 21:30:31,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 171 transitions, 380 flow [2025-01-09 21:30:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:31,720 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:31,721 INFO L175 Difference]: Start difference. First operand has 177 places, 172 transitions, 354 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:31,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 171 transitions, 380 flow [2025-01-09 21:30:31,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 171 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,724 INFO L231 Difference]: Finished difference. Result has 176 places, 171 transitions, 352 flow [2025-01-09 21:30:31,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=174, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=176, PETRI_TRANSITIONS=171} [2025-01-09 21:30:31,725 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -68 predicate places. [2025-01-09 21:30:31,725 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 171 transitions, 352 flow [2025-01-09 21:30:31,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,725 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:31,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:31,726 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:31,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1006448256, now seen corresponding path program 1 times [2025-01-09 21:30:31,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533311259] [2025-01-09 21:30:31,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 21:30:31,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 21:30:31,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:31,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:31,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533311259] [2025-01-09 21:30:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533311259] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:31,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583714935] [2025-01-09 21:30:31,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:31,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:31,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:31,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:31,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:31,839 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:31,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 171 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:31,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:31,840 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:31,925 INFO L124 PetriNetUnfolderBase]: 16/217 cut-off events. [2025-01-09 21:30:31,925 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:31,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 217 events. 16/217 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 212 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 158. Up to 40 conditions per place. [2025-01-09 21:30:31,927 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/170 dead transitions. [2025-01-09 21:30:31,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 170 transitions, 378 flow [2025-01-09 21:30:31,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:31,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:31,929 INFO L175 Difference]: Start difference. First operand has 176 places, 171 transitions, 352 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:31,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 170 transitions, 378 flow [2025-01-09 21:30:31,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 170 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:31,932 INFO L231 Difference]: Finished difference. Result has 175 places, 170 transitions, 350 flow [2025-01-09 21:30:31,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=175, PETRI_TRANSITIONS=170} [2025-01-09 21:30:31,933 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -69 predicate places. [2025-01-09 21:30:31,933 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 170 transitions, 350 flow [2025-01-09 21:30:31,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:31,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:31,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:31,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:31,934 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:31,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:31,935 INFO L85 PathProgramCache]: Analyzing trace with hash -305922832, now seen corresponding path program 1 times [2025-01-09 21:30:31,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:31,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847586765] [2025-01-09 21:30:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:31,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:31,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:30:31,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:30:31,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:31,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:32,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847586765] [2025-01-09 21:30:32,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847586765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708031574] [2025-01-09 21:30:32,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,001 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 187 out of 259 [2025-01-09 21:30:32,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 170 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 187 of 259 [2025-01-09 21:30:32,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,077 INFO L124 PetriNetUnfolderBase]: 16/216 cut-off events. [2025-01-09 21:30:32,077 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:32,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 216 events. 16/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 206 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 149. Up to 40 conditions per place. [2025-01-09 21:30:32,078 INFO L140 encePairwiseOnDemand]: 256/259 looper letters, 12 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-01-09 21:30:32,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 169 transitions, 376 flow [2025-01-09 21:30:32,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-01-09 21:30:32,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7413127413127413 [2025-01-09 21:30:32,080 INFO L175 Difference]: Start difference. First operand has 175 places, 170 transitions, 350 flow. Second operand 3 states and 576 transitions. [2025-01-09 21:30:32,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 169 transitions, 376 flow [2025-01-09 21:30:32,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 169 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:32,085 INFO L231 Difference]: Finished difference. Result has 174 places, 169 transitions, 348 flow [2025-01-09 21:30:32,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=174, PETRI_TRANSITIONS=169} [2025-01-09 21:30:32,086 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -70 predicate places. [2025-01-09 21:30:32,086 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 169 transitions, 348 flow [2025-01-09 21:30:32,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 188.33333333333334) internal successors, (565), 3 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:32,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:32,087 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:32,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1027410097, now seen corresponding path program 1 times [2025-01-09 21:30:32,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-01-09 21:30:32,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 21:30:32,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 21:30:32,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:32,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411370697] [2025-01-09 21:30:32,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411370697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907139781] [2025-01-09 21:30:32,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 259 [2025-01-09 21:30:32,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 169 transitions, 348 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 259 [2025-01-09 21:30:32,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,297 INFO L124 PetriNetUnfolderBase]: 16/215 cut-off events. [2025-01-09 21:30:32,297 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:32,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 215 events. 16/215 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 15 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 138. Up to 37 conditions per place. [2025-01-09 21:30:32,299 INFO L140 encePairwiseOnDemand]: 257/259 looper letters, 10 selfloop transitions, 1 changer transitions 0/168 dead transitions. [2025-01-09 21:30:32,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 168 transitions, 368 flow [2025-01-09 21:30:32,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2025-01-09 21:30:32,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752895752895753 [2025-01-09 21:30:32,301 INFO L175 Difference]: Start difference. First operand has 174 places, 169 transitions, 348 flow. Second operand 3 states and 585 transitions. [2025-01-09 21:30:32,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 168 transitions, 368 flow [2025-01-09 21:30:32,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 168 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:32,305 INFO L231 Difference]: Finished difference. Result has 173 places, 168 transitions, 344 flow [2025-01-09 21:30:32,305 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=173, PETRI_TRANSITIONS=168} [2025-01-09 21:30:32,306 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -71 predicate places. [2025-01-09 21:30:32,306 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 168 transitions, 344 flow [2025-01-09 21:30:32,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:32,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:32,307 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:32,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1142487411, now seen corresponding path program 1 times [2025-01-09 21:30:32,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-01-09 21:30:32,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 21:30:32,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 21:30:32,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899994026] [2025-01-09 21:30:32,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899994026] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699099369] [2025-01-09 21:30:32,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,432 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 259 [2025-01-09 21:30:32,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 168 transitions, 344 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 259 [2025-01-09 21:30:32,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,492 INFO L124 PetriNetUnfolderBase]: 15/218 cut-off events. [2025-01-09 21:30:32,492 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:32,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 267 conditions, 218 events. 15/218 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 205 event pairs, 15 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 245. Up to 37 conditions per place. [2025-01-09 21:30:32,493 INFO L140 encePairwiseOnDemand]: 257/259 looper letters, 10 selfloop transitions, 1 changer transitions 0/167 dead transitions. [2025-01-09 21:30:32,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 167 transitions, 364 flow [2025-01-09 21:30:32,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 585 transitions. [2025-01-09 21:30:32,495 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.752895752895753 [2025-01-09 21:30:32,495 INFO L175 Difference]: Start difference. First operand has 173 places, 168 transitions, 344 flow. Second operand 3 states and 585 transitions. [2025-01-09 21:30:32,495 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 167 transitions, 364 flow [2025-01-09 21:30:32,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 167 transitions, 363 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:32,498 INFO L231 Difference]: Finished difference. Result has 173 places, 167 transitions, 343 flow [2025-01-09 21:30:32,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=173, PETRI_TRANSITIONS=167} [2025-01-09 21:30:32,499 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -71 predicate places. [2025-01-09 21:30:32,500 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 167 transitions, 343 flow [2025-01-09 21:30:32,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:32,501 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:32,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:32,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 122 more)] === [2025-01-09 21:30:32,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:32,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1642471173, now seen corresponding path program 1 times [2025-01-09 21:30:32,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:32,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003042079] [2025-01-09 21:30:32,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:32,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:32,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 21:30:32,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 21:30:32,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:32,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:32,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:32,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:32,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003042079] [2025-01-09 21:30:32,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003042079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:32,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:32,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:32,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549318819] [2025-01-09 21:30:32,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:32,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:32,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:32,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:32,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:32,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 259 [2025-01-09 21:30:32,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 167 transitions, 343 flow. Second operand has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:32,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 259 [2025-01-09 21:30:32,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:32,685 INFO L124 PetriNetUnfolderBase]: 15/216 cut-off events. [2025-01-09 21:30:32,685 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:30:32,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 216 events. 15/216 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 203 event pairs, 15 based on Foata normal form. 2/213 useless extension candidates. Maximal degree in co-relation 255. Up to 37 conditions per place. [2025-01-09 21:30:32,686 INFO L140 encePairwiseOnDemand]: 257/259 looper letters, 0 selfloop transitions, 0 changer transitions 166/166 dead transitions. [2025-01-09 21:30:32,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 166 transitions, 361 flow [2025-01-09 21:30:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:32,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 584 transitions. [2025-01-09 21:30:32,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7516087516087516 [2025-01-09 21:30:32,689 INFO L175 Difference]: Start difference. First operand has 173 places, 167 transitions, 343 flow. Second operand 3 states and 584 transitions. [2025-01-09 21:30:32,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 174 places, 166 transitions, 361 flow [2025-01-09 21:30:32,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 166 transitions, 360 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:32,691 INFO L231 Difference]: Finished difference. Result has 173 places, 0 transitions, 0 flow [2025-01-09 21:30:32,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=259, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=173, PETRI_TRANSITIONS=0} [2025-01-09 21:30:32,692 INFO L279 CegarLoopForPetriNet]: 244 programPoint places, -71 predicate places. [2025-01-09 21:30:32,692 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 0 transitions, 0 flow [2025-01-09 21:30:32,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.66666666666666) internal successors, (584), 3 states have internal predecessors, (584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (125 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (124 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (123 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (122 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (121 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (120 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (119 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (118 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (117 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (116 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (115 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (114 of 126 remaining) [2025-01-09 21:30:32,695 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (113 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (112 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (110 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (108 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (107 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (106 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (105 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (104 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (103 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (102 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (101 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (100 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (99 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (98 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (97 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (96 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (95 of 126 remaining) [2025-01-09 21:30:32,696 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (94 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (93 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (92 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (91 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (90 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (89 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (88 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (87 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (86 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (85 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (84 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (83 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (82 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (81 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (80 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (79 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (78 of 126 remaining) [2025-01-09 21:30:32,697 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (77 of 126 remaining) [2025-01-09 21:30:32,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (76 of 126 remaining) [2025-01-09 21:30:32,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (75 of 126 remaining) [2025-01-09 21:30:32,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (74 of 126 remaining) [2025-01-09 21:30:32,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (73 of 126 remaining) [2025-01-09 21:30:32,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (72 of 126 remaining) [2025-01-09 21:30:32,700 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (71 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (70 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (69 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (68 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (67 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (66 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (65 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (64 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (63 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (62 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (61 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (60 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (59 of 126 remaining) [2025-01-09 21:30:32,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (58 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (57 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (55 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (54 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (53 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (52 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (51 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (50 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (48 of 126 remaining) [2025-01-09 21:30:32,702 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (46 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (45 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (44 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (43 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (42 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (41 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (40 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (39 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (38 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (37 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (36 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (35 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (34 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (33 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (31 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (29 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (28 of 126 remaining) [2025-01-09 21:30:32,703 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (27 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (26 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (25 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (23 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (22 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (21 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (20 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (19 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (18 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (17 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (16 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (14 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (13 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (11 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (10 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (9 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (8 of 126 remaining) [2025-01-09 21:30:32,704 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (7 of 126 remaining) [2025-01-09 21:30:32,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (6 of 126 remaining) [2025-01-09 21:30:32,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (5 of 126 remaining) [2025-01-09 21:30:32,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (4 of 126 remaining) [2025-01-09 21:30:32,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (3 of 126 remaining) [2025-01-09 21:30:32,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (2 of 126 remaining) [2025-01-09 21:30:32,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (1 of 126 remaining) [2025-01-09 21:30:32,705 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (0 of 126 remaining) [2025-01-09 21:30:32,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:32,705 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:32,712 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:32,712 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:32,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:32 BasicIcfg [2025-01-09 21:30:32,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:32,719 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:32,719 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:32,719 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:32,720 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:29" (3/4) ... [2025-01-09 21:30:32,722 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:32,724 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:32,724 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:32,724 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:30:32,729 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2025-01-09 21:30:32,731 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:32,731 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:32,731 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:32,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:32,819 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:32,819 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:32,821 INFO L158 Benchmark]: Toolchain (without parser) took 5729.57ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 154.3MB in the beginning and 237.5MB in the end (delta: -83.2MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,821 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:32,821 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.74ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 141.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.85ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 138.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,822 INFO L158 Benchmark]: Boogie Preprocessor took 36.12ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 136.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:32,823 INFO L158 Benchmark]: RCFGBuilder took 1827.99ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 97.1MB in the end (delta: 38.9MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,823 INFO L158 Benchmark]: TraceAbstraction took 3435.69ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 96.0MB in the beginning and 242.7MB in the end (delta: -146.7MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,823 INFO L158 Benchmark]: Witness Printer took 100.27ms. Allocated memory is still 302.0MB. Free memory was 242.7MB in the beginning and 237.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:32,825 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.36ms. Allocated memory is still 201.3MB. Free memory is still 118.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 258.74ms. Allocated memory is still 201.3MB. Free memory was 154.3MB in the beginning and 141.6MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.85ms. Allocated memory is still 201.3MB. Free memory was 141.6MB in the beginning and 138.3MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.12ms. Allocated memory is still 201.3MB. Free memory was 138.3MB in the beginning and 136.1MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 1827.99ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 97.1MB in the end (delta: 38.9MB). Peak memory consumption was 97.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3435.69ms. Allocated memory was 201.3MB in the beginning and 302.0MB in the end (delta: 100.7MB). Free memory was 96.0MB in the beginning and 242.7MB in the end (delta: -146.7MB). Peak memory consumption was 120.7MB. Max. memory is 16.1GB. * Witness Printer took 100.27ms. Allocated memory is still 302.0MB. Free memory was 242.7MB in the beginning and 237.5MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: 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: 46]: 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: 46]: 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: 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: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 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: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: 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: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: 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: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 99]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 329 locations, 126 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: 3.2s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 70 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 366 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 20 mSDtfsCounter, 366 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1393 NumberOfCodeBlocks, 1393 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1378 ConstructedInterpolants, 0 QuantifiedInterpolants, 1408 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 69 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:32,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE