./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-queue-add-2.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 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:33:50,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:33:50,973 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:33:50,977 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:33:50,977 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:33:50,993 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:33:50,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:33:50,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:33:50,994 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:33:50,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:33:50,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:33:50,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:33:50,994 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:33:50,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:33:50,994 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:33:50,994 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:33:50,995 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:33:50,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:50,996 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:50,996 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:33:50,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:33:50,996 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 -> 8c3fe688d0e9a9929009fc24c8ef56c8fc1bfa15613131b287e178eb7d2f1f1e [2025-01-09 21:33:51,211 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:33:51,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:33:51,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:33:51,222 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:33:51,222 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:33:51,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-01-09 21:33:52,440 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4623a696/f60dabe3262d4f82868af05f905d31bb/FLAG01f77655e [2025-01-09 21:33:52,704 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:33:52,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-queue-add-2.wvr.c [2025-01-09 21:33:52,718 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4623a696/f60dabe3262d4f82868af05f905d31bb/FLAG01f77655e [2025-01-09 21:33:53,024 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a4623a696/f60dabe3262d4f82868af05f905d31bb [2025-01-09 21:33:53,028 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:33:53,029 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:33:53,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:53,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:33:53,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:33:53,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ee8373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53, skipping insertion in model container [2025-01-09 21:33:53,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,066 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:33:53,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:53,252 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:33:53,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:33:53,287 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:33:53,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53 WrapperNode [2025-01-09 21:33:53,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:33:53,290 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:53,290 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:33:53,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:33:53,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,301 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,328 INFO L138 Inliner]: procedures = 23, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 272 [2025-01-09 21:33:53,328 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:33:53,328 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:33:53,328 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:33:53,328 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:33:53,342 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,342 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,347 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,347 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,360 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,365 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,368 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,369 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,375 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:33:53,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:33:53,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:33:53,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:33:53,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (1/1) ... [2025-01-09 21:33:53,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:33:53,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:33:53,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:33:53,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:33:53,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:33:53,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:33:53,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:33:53,421 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-09 21:33:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-09 21:33:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:33:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:33:53,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:33:53,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:33:53,423 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:33:53,493 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:33:53,494 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:33:53,769 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:33:53,769 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:33:53,954 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:33:53,955 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:33:53,955 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:53 BoogieIcfgContainer [2025-01-09 21:33:53,955 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:33:53,957 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:33:53,957 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:33:53,960 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:33:53,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:33:53" (1/3) ... [2025-01-09 21:33:53,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caf3d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:53, skipping insertion in model container [2025-01-09 21:33:53,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:33:53" (2/3) ... [2025-01-09 21:33:53,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caf3d3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:33:53, skipping insertion in model container [2025-01-09 21:33:53,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:53" (3/3) ... [2025-01-09 21:33:53,961 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-queue-add-2.wvr.c [2025-01-09 21:33:53,972 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:33:53,973 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-queue-add-2.wvr.c that has 3 procedures, 208 locations, 1 initial locations, 3 loop locations, and 40 error locations. [2025-01-09 21:33:53,973 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:33:54,056 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:33:54,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 216 transitions, 446 flow [2025-01-09 21:33:54,126 INFO L124 PetriNetUnfolderBase]: 9/214 cut-off events. [2025-01-09 21:33:54,128 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:33:54,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 223 conditions, 214 events. 9/214 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 292 event pairs, 0 based on Foata normal form. 0/165 useless extension candidates. Maximal degree in co-relation 162. Up to 2 conditions per place. [2025-01-09 21:33:54,131 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 216 transitions, 446 flow [2025-01-09 21:33:54,134 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 197 transitions, 406 flow [2025-01-09 21:33:54,139 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:33:54,146 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;@702a49c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:33:54,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2025-01-09 21:33:54,150 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:33:54,150 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:33:54,150 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:33:54,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,151 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] [2025-01-09 21:33:54,151 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2012404597, now seen corresponding path program 1 times [2025-01-09 21:33:54,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50877105] [2025-01-09 21:33:54,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:33:54,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:33:54,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50877105] [2025-01-09 21:33:54,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50877105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451252192] [2025-01-09 21:33:54,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 216 [2025-01-09 21:33:54,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 216 [2025-01-09 21:33:54,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,347 INFO L124 PetriNetUnfolderBase]: 12/201 cut-off events. [2025-01-09 21:33:54,347 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-01-09 21:33:54,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 249 conditions, 201 events. 12/201 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 293 event pairs, 7 based on Foata normal form. 3/181 useless extension candidates. Maximal degree in co-relation 151. Up to 30 conditions per place. [2025-01-09 21:33:54,349 INFO L140 encePairwiseOnDemand]: 182/216 looper letters, 13 selfloop transitions, 2 changer transitions 3/165 dead transitions. [2025-01-09 21:33:54,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 165 transitions, 372 flow [2025-01-09 21:33:54,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 545 transitions. [2025-01-09 21:33:54,359 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8410493827160493 [2025-01-09 21:33:54,360 INFO L175 Difference]: Start difference. First operand has 196 places, 197 transitions, 406 flow. Second operand 3 states and 545 transitions. [2025-01-09 21:33:54,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 165 transitions, 372 flow [2025-01-09 21:33:54,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 165 transitions, 364 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:33:54,366 INFO L231 Difference]: Finished difference. Result has 167 places, 162 transitions, 332 flow [2025-01-09 21:33:54,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=167, PETRI_TRANSITIONS=162} [2025-01-09 21:33:54,369 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -29 predicate places. [2025-01-09 21:33:54,370 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 162 transitions, 332 flow [2025-01-09 21:33:54,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.33333333333334) internal successors, (502), 3 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,370 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] [2025-01-09 21:33:54,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:33:54,371 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,371 INFO L85 PathProgramCache]: Analyzing trace with hash -624926579, now seen corresponding path program 1 times [2025-01-09 21:33:54,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009719176] [2025-01-09 21:33:54,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:33:54,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:33:54,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009719176] [2025-01-09 21:33:54,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009719176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100994537] [2025-01-09 21:33:54,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,419 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 216 [2025-01-09 21:33:54,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 162 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 216 [2025-01-09 21:33:54,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,454 INFO L124 PetriNetUnfolderBase]: 10/205 cut-off events. [2025-01-09 21:33:54,455 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:33:54,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 237 conditions, 205 events. 10/205 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 285 event pairs, 5 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 207. Up to 22 conditions per place. [2025-01-09 21:33:54,456 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 11 selfloop transitions, 2 changer transitions 0/161 dead transitions. [2025-01-09 21:33:54,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 356 flow [2025-01-09 21:33:54,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-01-09 21:33:54,457 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7993827160493827 [2025-01-09 21:33:54,457 INFO L175 Difference]: Start difference. First operand has 167 places, 162 transitions, 332 flow. Second operand 3 states and 518 transitions. [2025-01-09 21:33:54,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 356 flow [2025-01-09 21:33:54,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 161 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,460 INFO L231 Difference]: Finished difference. Result has 163 places, 161 transitions, 330 flow [2025-01-09 21:33:54,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=163, PETRI_TRANSITIONS=161} [2025-01-09 21:33:54,461 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -33 predicate places. [2025-01-09 21:33:54,461 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 161 transitions, 330 flow [2025-01-09 21:33:54,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,461 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,462 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:54,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:33:54,462 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2138095345, now seen corresponding path program 1 times [2025-01-09 21:33:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700339687] [2025-01-09 21:33:54,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-01-09 21:33:54,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-01-09 21:33:54,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,472 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700339687] [2025-01-09 21:33:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700339687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862954699] [2025-01-09 21:33:54,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,509 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 216 [2025-01-09 21:33:54,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 216 [2025-01-09 21:33:54,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,568 INFO L124 PetriNetUnfolderBase]: 10/204 cut-off events. [2025-01-09 21:33:54,568 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:33:54,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 204 events. 10/204 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 285 event pairs, 5 based on Foata normal form. 0/185 useless extension candidates. Maximal degree in co-relation 198. Up to 22 conditions per place. [2025-01-09 21:33:54,569 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 11 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2025-01-09 21:33:54,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 160 transitions, 354 flow [2025-01-09 21:33:54,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-01-09 21:33:54,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7993827160493827 [2025-01-09 21:33:54,570 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 330 flow. Second operand 3 states and 518 transitions. [2025-01-09 21:33:54,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 160 transitions, 354 flow [2025-01-09 21:33:54,571 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 160 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,573 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 328 flow [2025-01-09 21:33:54,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-01-09 21:33:54,574 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -34 predicate places. [2025-01-09 21:33:54,574 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 328 flow [2025-01-09 21:33:54,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,574 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:54,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:33:54,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash -881300387, now seen corresponding path program 1 times [2025-01-09 21:33:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144830806] [2025-01-09 21:33:54,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:33:54,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:33:54,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144830806] [2025-01-09 21:33:54,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144830806] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164538518] [2025-01-09 21:33:54,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 216 [2025-01-09 21:33:54,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 160 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 216 [2025-01-09 21:33:54,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,645 INFO L124 PetriNetUnfolderBase]: 11/220 cut-off events. [2025-01-09 21:33:54,645 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:33:54,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 220 events. 11/220 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 335 event pairs, 2 based on Foata normal form. 0/199 useless extension candidates. Maximal degree in co-relation 207. Up to 14 conditions per place. [2025-01-09 21:33:54,646 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 12 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-01-09 21:33:54,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 163 transitions, 363 flow [2025-01-09 21:33:54,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2025-01-09 21:33:54,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8194444444444444 [2025-01-09 21:33:54,648 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 328 flow. Second operand 3 states and 531 transitions. [2025-01-09 21:33:54,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 163 transitions, 363 flow [2025-01-09 21:33:54,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 163 transitions, 359 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,651 INFO L231 Difference]: Finished difference. Result has 162 places, 160 transitions, 332 flow [2025-01-09 21:33:54,651 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=162, PETRI_TRANSITIONS=160} [2025-01-09 21:33:54,651 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -34 predicate places. [2025-01-09 21:33:54,651 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 160 transitions, 332 flow [2025-01-09 21:33:54,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:54,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:33:54,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1207774989, now seen corresponding path program 1 times [2025-01-09 21:33:54,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309129832] [2025-01-09 21:33:54,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:33:54,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:33:54,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309129832] [2025-01-09 21:33:54,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309129832] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777563095] [2025-01-09 21:33:54,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,694 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2025-01-09 21:33:54,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 160 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2025-01-09 21:33:54,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,724 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2025-01-09 21:33:54,724 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-01-09 21:33:54,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 206 events. 11/206 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 296 event pairs, 5 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 126. Up to 25 conditions per place. [2025-01-09 21:33:54,725 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 11 selfloop transitions, 2 changer transitions 0/159 dead transitions. [2025-01-09 21:33:54,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 159 transitions, 356 flow [2025-01-09 21:33:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-01-09 21:33:54,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8024691358024691 [2025-01-09 21:33:54,727 INFO L175 Difference]: Start difference. First operand has 162 places, 160 transitions, 332 flow. Second operand 3 states and 520 transitions. [2025-01-09 21:33:54,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 159 transitions, 356 flow [2025-01-09 21:33:54,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 159 transitions, 354 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:54,729 INFO L231 Difference]: Finished difference. Result has 162 places, 159 transitions, 332 flow [2025-01-09 21:33:54,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=162, PETRI_TRANSITIONS=159} [2025-01-09 21:33:54,729 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -34 predicate places. [2025-01-09 21:33:54,729 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 159 transitions, 332 flow [2025-01-09 21:33:54,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,730 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:54,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:33:54,730 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1884554306, now seen corresponding path program 1 times [2025-01-09 21:33:54,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920719503] [2025-01-09 21:33:54,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:33:54,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:33:54,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920719503] [2025-01-09 21:33:54,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920719503] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658701954] [2025-01-09 21:33:54,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,763 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 216 [2025-01-09 21:33:54,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 159 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 216 [2025-01-09 21:33:54,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,790 INFO L124 PetriNetUnfolderBase]: 11/205 cut-off events. [2025-01-09 21:33:54,790 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:33:54,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 205 events. 11/205 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 295 event pairs, 5 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 193. Up to 23 conditions per place. [2025-01-09 21:33:54,792 INFO L140 encePairwiseOnDemand]: 214/216 looper letters, 10 selfloop transitions, 1 changer transitions 0/158 dead transitions. [2025-01-09 21:33:54,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 158 transitions, 352 flow [2025-01-09 21:33:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:33:54,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8132716049382716 [2025-01-09 21:33:54,793 INFO L175 Difference]: Start difference. First operand has 162 places, 159 transitions, 332 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:33:54,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 158 transitions, 352 flow [2025-01-09 21:33:54,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 158 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:54,795 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 328 flow [2025-01-09 21:33:54,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-01-09 21:33:54,796 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -35 predicate places. [2025-01-09 21:33:54,796 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 328 flow [2025-01-09 21:33:54,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,799 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] [2025-01-09 21:33:54,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:33:54,799 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash -864894326, now seen corresponding path program 1 times [2025-01-09 21:33:54,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750580478] [2025-01-09 21:33:54,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:33:54,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:33:54,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:54,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:54,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:54,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750580478] [2025-01-09 21:33:54,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750580478] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:54,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937782094] [2025-01-09 21:33:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:54,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:54,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:54,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:54,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2025-01-09 21:33:54,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:54,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2025-01-09 21:33:54,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:54,911 INFO L124 PetriNetUnfolderBase]: 11/204 cut-off events. [2025-01-09 21:33:54,911 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:33:54,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 248 conditions, 204 events. 11/204 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 291 event pairs, 5 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 193. Up to 25 conditions per place. [2025-01-09 21:33:54,912 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 11 selfloop transitions, 2 changer transitions 0/157 dead transitions. [2025-01-09 21:33:54,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 157 transitions, 352 flow [2025-01-09 21:33:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:54,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:54,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2025-01-09 21:33:54,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8024691358024691 [2025-01-09 21:33:54,913 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 328 flow. Second operand 3 states and 520 transitions. [2025-01-09 21:33:54,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 157 transitions, 352 flow [2025-01-09 21:33:54,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 157 transitions, 351 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:54,915 INFO L231 Difference]: Finished difference. Result has 161 places, 157 transitions, 329 flow [2025-01-09 21:33:54,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=161, PETRI_TRANSITIONS=157} [2025-01-09 21:33:54,916 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -35 predicate places. [2025-01-09 21:33:54,916 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 157 transitions, 329 flow [2025-01-09 21:33:54,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:54,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:54,917 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] [2025-01-09 21:33:54,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:33:54,917 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:54,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:54,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1000211288, now seen corresponding path program 1 times [2025-01-09 21:33:54,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:54,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667634560] [2025-01-09 21:33:54,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:54,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:54,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:33:54,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:33:54,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:54,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:55,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667634560] [2025-01-09 21:33:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667634560] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:33:55,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063442930] [2025-01-09 21:33:55,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:33:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:33:55,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:33:55,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 216 [2025-01-09 21:33:55,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 157 transitions, 329 flow. Second operand has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 216 [2025-01-09 21:33:55,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,430 INFO L124 PetriNetUnfolderBase]: 11/203 cut-off events. [2025-01-09 21:33:55,430 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-01-09 21:33:55,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 203 events. 11/203 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 288 event pairs, 5 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 203. Up to 30 conditions per place. [2025-01-09 21:33:55,431 INFO L140 encePairwiseOnDemand]: 210/216 looper letters, 16 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-01-09 21:33:55,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 156 transitions, 369 flow [2025-01-09 21:33:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:33:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:33:55,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 993 transitions. [2025-01-09 21:33:55,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7662037037037037 [2025-01-09 21:33:55,434 INFO L175 Difference]: Start difference. First operand has 161 places, 157 transitions, 329 flow. Second operand 6 states and 993 transitions. [2025-01-09 21:33:55,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 156 transitions, 369 flow [2025-01-09 21:33:55,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 156 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,436 INFO L231 Difference]: Finished difference. Result has 163 places, 156 transitions, 333 flow [2025-01-09 21:33:55,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=333, PETRI_PLACES=163, PETRI_TRANSITIONS=156} [2025-01-09 21:33:55,437 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -33 predicate places. [2025-01-09 21:33:55,437 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 156 transitions, 333 flow [2025-01-09 21:33:55,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 163.5) internal successors, (981), 6 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:55,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:33:55,438 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash -92688201, now seen corresponding path program 1 times [2025-01-09 21:33:55,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610785842] [2025-01-09 21:33:55,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:33:55,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:33:55,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610785842] [2025-01-09 21:33:55,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610785842] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879188288] [2025-01-09 21:33:55,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 216 [2025-01-09 21:33:55,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 156 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 216 [2025-01-09 21:33:55,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,528 INFO L124 PetriNetUnfolderBase]: 19/194 cut-off events. [2025-01-09 21:33:55,529 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:33:55,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 194 events. 19/194 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 287 event pairs, 9 based on Foata normal form. 1/181 useless extension candidates. Maximal degree in co-relation 243. Up to 38 conditions per place. [2025-01-09 21:33:55,529 INFO L140 encePairwiseOnDemand]: 212/216 looper letters, 12 selfloop transitions, 1 changer transitions 2/153 dead transitions. [2025-01-09 21:33:55,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 153 transitions, 355 flow [2025-01-09 21:33:55,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-01-09 21:33:55,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7932098765432098 [2025-01-09 21:33:55,531 INFO L175 Difference]: Start difference. First operand has 163 places, 156 transitions, 333 flow. Second operand 3 states and 514 transitions. [2025-01-09 21:33:55,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 153 transitions, 355 flow [2025-01-09 21:33:55,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 153 transitions, 345 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:33:55,533 INFO L231 Difference]: Finished difference. Result has 157 places, 151 transitions, 315 flow [2025-01-09 21:33:55,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=157, PETRI_TRANSITIONS=151} [2025-01-09 21:33:55,534 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -39 predicate places. [2025-01-09 21:33:55,534 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 151 transitions, 315 flow [2025-01-09 21:33:55,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:55,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:33:55,535 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:55,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1549887833, now seen corresponding path program 1 times [2025-01-09 21:33:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174065128] [2025-01-09 21:33:55,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:33:55,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:33:55,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:55,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174065128] [2025-01-09 21:33:55,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174065128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899737059] [2025-01-09 21:33:55,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,604 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2025-01-09 21:33:55,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 151 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2025-01-09 21:33:55,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,649 INFO L124 PetriNetUnfolderBase]: 20/208 cut-off events. [2025-01-09 21:33:55,649 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-01-09 21:33:55,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 208 events. 20/208 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 402 event pairs, 8 based on Foata normal form. 1/201 useless extension candidates. Maximal degree in co-relation 216. Up to 29 conditions per place. [2025-01-09 21:33:55,650 INFO L140 encePairwiseOnDemand]: 211/216 looper letters, 11 selfloop transitions, 2 changer transitions 2/152 dead transitions. [2025-01-09 21:33:55,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 152 transitions, 348 flow [2025-01-09 21:33:55,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 523 transitions. [2025-01-09 21:33:55,652 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8070987654320988 [2025-01-09 21:33:55,652 INFO L175 Difference]: Start difference. First operand has 157 places, 151 transitions, 315 flow. Second operand 3 states and 523 transitions. [2025-01-09 21:33:55,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 152 transitions, 348 flow [2025-01-09 21:33:55,653 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 152 transitions, 347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:33:55,654 INFO L231 Difference]: Finished difference. Result has 154 places, 147 transitions, 309 flow [2025-01-09 21:33:55,654 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=309, PETRI_PLACES=154, PETRI_TRANSITIONS=147} [2025-01-09 21:33:55,655 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -42 predicate places. [2025-01-09 21:33:55,655 INFO L471 AbstractCegarLoop]: Abstraction has has 154 places, 147 transitions, 309 flow [2025-01-09 21:33:55,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.66666666666666) internal successors, (512), 3 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,655 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:33:55,655 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] [2025-01-09 21:33:55,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:33:55,655 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE (and 67 more)] === [2025-01-09 21:33:55,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:33:55,656 INFO L85 PathProgramCache]: Analyzing trace with hash 305591708, now seen corresponding path program 1 times [2025-01-09 21:33:55,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:33:55,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011769371] [2025-01-09 21:33:55,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:33:55,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:33:55,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 21:33:55,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 21:33:55,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:33:55,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:33:55,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:33:55,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:33:55,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011769371] [2025-01-09 21:33:55,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011769371] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:33:55,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:33:55,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:33:55,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799042003] [2025-01-09 21:33:55,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:33:55,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:33:55,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:33:55,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:33:55,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:33:55,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 216 [2025-01-09 21:33:55,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 147 transitions, 309 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:33:55,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 216 [2025-01-09 21:33:55,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:33:55,747 INFO L124 PetriNetUnfolderBase]: 26/209 cut-off events. [2025-01-09 21:33:55,747 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-01-09 21:33:55,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 291 conditions, 209 events. 26/209 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 433 event pairs, 14 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 237. Up to 42 conditions per place. [2025-01-09 21:33:55,748 INFO L140 encePairwiseOnDemand]: 213/216 looper letters, 0 selfloop transitions, 0 changer transitions 149/149 dead transitions. [2025-01-09 21:33:55,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 149 transitions, 344 flow [2025-01-09 21:33:55,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:33:55,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:33:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 522 transitions. [2025-01-09 21:33:55,749 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8055555555555556 [2025-01-09 21:33:55,749 INFO L175 Difference]: Start difference. First operand has 154 places, 147 transitions, 309 flow. Second operand 3 states and 522 transitions. [2025-01-09 21:33:55,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 149 transitions, 344 flow [2025-01-09 21:33:55,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 149 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:33:55,751 INFO L231 Difference]: Finished difference. Result has 151 places, 0 transitions, 0 flow [2025-01-09 21:33:55,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=216, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=151, PETRI_TRANSITIONS=0} [2025-01-09 21:33:55,751 INFO L279 CegarLoopForPetriNet]: 196 programPoint places, -45 predicate places. [2025-01-09 21:33:55,751 INFO L471 AbstractCegarLoop]: Abstraction has has 151 places, 0 transitions, 0 flow [2025-01-09 21:33:55,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (70 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (69 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (68 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (67 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (66 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (65 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (64 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (63 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (62 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (61 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (60 of 71 remaining) [2025-01-09 21:33:55,754 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (59 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (58 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (57 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (56 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (55 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (54 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (48 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (46 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (45 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (44 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (43 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (42 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (40 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (38 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (37 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (36 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (35 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (34 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (33 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (32 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (31 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (30 of 71 remaining) [2025-01-09 21:33:55,755 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (27 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (26 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (25 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (24 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (23 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (22 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (21 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (20 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (18 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (17 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (16 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (15 of 71 remaining) [2025-01-09 21:33:55,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (13 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (12 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (11 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (10 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (9 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (8 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (7 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (6 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (4 of 71 remaining) [2025-01-09 21:33:55,757 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (3 of 71 remaining) [2025-01-09 21:33:55,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (2 of 71 remaining) [2025-01-09 21:33:55,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 71 remaining) [2025-01-09 21:33:55,758 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (0 of 71 remaining) [2025-01-09 21:33:55,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:33:55,758 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:33:55,761 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:33:55,762 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:33:55,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:33:55 BasicIcfg [2025-01-09 21:33:55,765 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:33:55,765 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:33:55,766 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:33:55,766 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:33:55,766 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:33:53" (3/4) ... [2025-01-09 21:33:55,767 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:33:55,769 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:33:55,769 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:33:55,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-01-09 21:33:55,774 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:33:55,775 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:33:55,775 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:33:55,827 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:33:55,827 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:33:55,827 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:33:55,828 INFO L158 Benchmark]: Toolchain (without parser) took 2798.86ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 124.3MB in the beginning and 185.2MB in the end (delta: -60.9MB). Peak memory consumption was 125.2MB. Max. memory is 16.1GB. [2025-01-09 21:33:55,828 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:55,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.54ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 111.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:55,829 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.10ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 109.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:55,829 INFO L158 Benchmark]: Boogie Preprocessor took 46.25ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:33:55,829 INFO L158 Benchmark]: RCFGBuilder took 580.15ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 38.3MB in the end (delta: 69.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-01-09 21:33:55,829 INFO L158 Benchmark]: TraceAbstraction took 1808.36ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 38.3MB in the beginning and 192.1MB in the end (delta: -153.8MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2025-01-09 21:33:55,829 INFO L158 Benchmark]: Witness Printer took 61.97ms. Allocated memory is still 352.3MB. Free memory was 192.1MB in the beginning and 185.2MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:33:55,830 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.12ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.54ms. Allocated memory is still 167.8MB. Free memory was 123.6MB in the beginning and 111.8MB in the end (delta: 11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.10ms. Allocated memory is still 167.8MB. Free memory was 111.8MB in the beginning and 109.4MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.25ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 107.4MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 580.15ms. Allocated memory is still 167.8MB. Free memory was 107.4MB in the beginning and 38.3MB in the end (delta: 69.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1808.36ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 38.3MB in the beginning and 192.1MB in the end (delta: -153.8MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * Witness Printer took 61.97ms. Allocated memory is still 352.3MB. Free memory was 192.1MB in the beginning and 185.2MB in the end (delta: 6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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: 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 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: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 267 locations, 71 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 330 IncrementalHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 31 mSDtfsCounter, 330 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=406occurred in iteration=0, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 680 NumberOfCodeBlocks, 680 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 669 ConstructedInterpolants, 0 QuantifiedInterpolants, 804 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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 40 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:33:55,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE