./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:55:58,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:55:58,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:55:58,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:55:58,990 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:55:59,009 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:55:59,010 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:55:59,010 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:55:59,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:55:59,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:55:59,010 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:55:59,010 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:55:59,010 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:55:59,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:55:59,011 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:55:59,011 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:55:59,011 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:55:59,012 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:55:59,012 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/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 -> 34bb015d05a3d6b765805bee36bd4c1bc3f74929c05e61a51973bc9a4fc2cfc0 [2025-03-04 06:55:59,222 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:55:59,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:55:59,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:55:59,232 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:55:59,233 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:55:59,234 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-03-04 06:56:00,342 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4551fa101/de35de698af341a0874b3c92485c6230/FLAG443d649e2 [2025-03-04 06:56:00,542 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:56:00,543 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-03-04 06:56:00,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4551fa101/de35de698af341a0874b3c92485c6230/FLAG443d649e2 [2025-03-04 06:56:00,578 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4551fa101/de35de698af341a0874b3c92485c6230 [2025-03-04 06:56:00,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:56:00,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:56:00,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:00,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:56:00,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:56:00,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14f98fca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00, skipping insertion in model container [2025-03-04 06:56:00,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:56:00,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:00,730 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:56:00,752 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:56:00,765 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:56:00,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00 WrapperNode [2025-03-04 06:56:00,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:56:00,767 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:00,767 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:56:00,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:56:00,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,784 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,806 INFO L138 Inliner]: procedures = 21, calls = 23, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 188 [2025-03-04 06:56:00,808 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:56:00,809 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:56:00,810 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:56:00,810 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:56:00,815 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,817 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,821 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,829 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,830 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,831 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:56:00,837 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:56:00,837 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:56:00,837 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:56:00,838 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (1/1) ... [2025-03-04 06:56:00,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:56:00,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:56:00,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:56:00,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 06:56:00,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 06:56:00,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 06:56:00,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-04 06:56:00,891 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 06:56:00,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:56:00,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:56:00,892 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:56:00,982 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:56:00,984 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:56:01,296 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:56:01,296 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:56:01,412 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:56:01,412 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:56:01,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:01 BoogieIcfgContainer [2025-03-04 06:56:01,412 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:56:01,414 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:56:01,414 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:56:01,417 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:56:01,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:56:00" (1/3) ... [2025-03-04 06:56:01,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e64b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:01, skipping insertion in model container [2025-03-04 06:56:01,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:56:00" (2/3) ... [2025-03-04 06:56:01,418 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e64b0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:56:01, skipping insertion in model container [2025-03-04 06:56:01,418 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:01" (3/3) ... [2025-03-04 06:56:01,418 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c [2025-03-04 06:56:01,429 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:56:01,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-proofs-counter-add-4-semi-Q67.wvr.c that has 5 procedures, 203 locations, 1 initial locations, 4 loop locations, and 37 error locations. [2025-03-04 06:56:01,432 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:56:01,486 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-04 06:56:01,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 215 places, 214 transitions, 456 flow [2025-03-04 06:56:01,588 INFO L124 PetriNetUnfolderBase]: 12/210 cut-off events. [2025-03-04 06:56:01,590 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:56:01,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 210 events. 12/210 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 284 event pairs, 0 based on Foata normal form. 0/161 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2025-03-04 06:56:01,596 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 214 transitions, 456 flow [2025-03-04 06:56:01,601 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 195 places, 193 transitions, 410 flow [2025-03-04 06:56:01,609 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:56:01,619 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;@4416634f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:56:01,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2025-03-04 06:56:01,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:56:01,631 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2025-03-04 06:56:01,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:56:01,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:01,632 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] [2025-03-04 06:56:01,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:01,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:01,639 INFO L85 PathProgramCache]: Analyzing trace with hash -581305761, now seen corresponding path program 1 times [2025-03-04 06:56:01,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:01,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750391468] [2025-03-04 06:56:01,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:01,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:01,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-04 06:56:01,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-04 06:56:01,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:01,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:01,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:01,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:01,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750391468] [2025-03-04 06:56:01,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750391468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:01,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:01,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250651101] [2025-03-04 06:56:01,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:01,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:01,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:01,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:01,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:01,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 214 [2025-03-04 06:56:01,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 193 transitions, 410 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-03-04 06:56:01,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:01,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 214 [2025-03-04 06:56:01,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:02,092 INFO L124 PetriNetUnfolderBase]: 158/704 cut-off events. [2025-03-04 06:56:02,093 INFO L125 PetriNetUnfolderBase]: For 65/66 co-relation queries the response was YES. [2025-03-04 06:56:02,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 990 conditions, 704 events. 158/704 cut-off events. For 65/66 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3585 event pairs, 66 based on Foata normal form. 157/726 useless extension candidates. Maximal degree in co-relation 791. Up to 219 conditions per place. [2025-03-04 06:56:02,105 INFO L140 encePairwiseOnDemand]: 188/214 looper letters, 19 selfloop transitions, 2 changer transitions 1/169 dead transitions. [2025-03-04 06:56:02,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 169 transitions, 404 flow [2025-03-04 06:56:02,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:02,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:02,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-03-04 06:56:02,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457943925233645 [2025-03-04 06:56:02,120 INFO L175 Difference]: Start difference. First operand has 195 places, 193 transitions, 410 flow. Second operand 3 states and 543 transitions. [2025-03-04 06:56:02,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 169 transitions, 404 flow [2025-03-04 06:56:02,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 169 transitions, 388 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 06:56:02,130 INFO L231 Difference]: Finished difference. Result has 170 places, 168 transitions, 348 flow [2025-03-04 06:56:02,132 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=170, PETRI_TRANSITIONS=168} [2025-03-04 06:56:02,135 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -25 predicate places. [2025-03-04 06:56:02,137 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 168 transitions, 348 flow [2025-03-04 06:56:02,137 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-03-04 06:56:02,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:02,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:02,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:56:02,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:02,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:02,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1812225967, now seen corresponding path program 1 times [2025-03-04 06:56:02,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:02,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802219194] [2025-03-04 06:56:02,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:02,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:02,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 06:56:02,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 06:56:02,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:02,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:02,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:02,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:02,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802219194] [2025-03-04 06:56:02,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802219194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:02,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:02,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:02,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56828988] [2025-03-04 06:56:02,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:02,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:02,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:02,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:02,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:02,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 214 [2025-03-04 06:56:02,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 168 transitions, 348 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-03-04 06:56:02,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:02,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 214 [2025-03-04 06:56:02,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:02,347 INFO L124 PetriNetUnfolderBase]: 176/758 cut-off events. [2025-03-04 06:56:02,347 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 06:56:02,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 758 events. 176/758 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3812 event pairs, 72 based on Foata normal form. 0/609 useless extension candidates. Maximal degree in co-relation 985. Up to 238 conditions per place. [2025-03-04 06:56:02,355 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 17 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-03-04 06:56:02,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 167 transitions, 384 flow [2025-03-04 06:56:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:02,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-03-04 06:56:02,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8161993769470405 [2025-03-04 06:56:02,357 INFO L175 Difference]: Start difference. First operand has 170 places, 168 transitions, 348 flow. Second operand 3 states and 524 transitions. [2025-03-04 06:56:02,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 167 transitions, 384 flow [2025-03-04 06:56:02,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 167 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:02,359 INFO L231 Difference]: Finished difference. Result has 168 places, 167 transitions, 346 flow [2025-03-04 06:56:02,360 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=346, PETRI_PLACES=168, PETRI_TRANSITIONS=167} [2025-03-04 06:56:02,360 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -27 predicate places. [2025-03-04 06:56:02,360 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 167 transitions, 346 flow [2025-03-04 06:56:02,361 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-03-04 06:56:02,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:02,361 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:02,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:56:02,361 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:02,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:02,362 INFO L85 PathProgramCache]: Analyzing trace with hash -421562456, now seen corresponding path program 1 times [2025-03-04 06:56:02,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:02,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150230614] [2025-03-04 06:56:02,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:02,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:02,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 06:56:02,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 06:56:02,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:02,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:02,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:02,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150230614] [2025-03-04 06:56:02,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150230614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:02,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:02,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:02,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125649554] [2025-03-04 06:56:02,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:02,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:02,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:02,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:02,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:02,436 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 214 [2025-03-04 06:56:02,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 167 transitions, 346 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-03-04 06:56:02,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:02,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 214 [2025-03-04 06:56:02,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:02,509 INFO L124 PetriNetUnfolderBase]: 180/688 cut-off events. [2025-03-04 06:56:02,509 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 06:56:02,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 688 events. 180/688 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 3394 event pairs, 72 based on Foata normal form. 0/557 useless extension candidates. Maximal degree in co-relation 909. Up to 242 conditions per place. [2025-03-04 06:56:02,515 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 17 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-04 06:56:02,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 166 transitions, 382 flow [2025-03-04 06:56:02,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:02,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:02,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-03-04 06:56:02,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8161993769470405 [2025-03-04 06:56:02,517 INFO L175 Difference]: Start difference. First operand has 168 places, 167 transitions, 346 flow. Second operand 3 states and 524 transitions. [2025-03-04 06:56:02,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 166 transitions, 382 flow [2025-03-04 06:56:02,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 166 transitions, 378 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:02,519 INFO L231 Difference]: Finished difference. Result has 167 places, 166 transitions, 344 flow [2025-03-04 06:56:02,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=340, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=344, PETRI_PLACES=167, PETRI_TRANSITIONS=166} [2025-03-04 06:56:02,520 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -28 predicate places. [2025-03-04 06:56:02,520 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 166 transitions, 344 flow [2025-03-04 06:56:02,520 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-03-04 06:56:02,521 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:02,521 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:02,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:56:02,521 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:02,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:02,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1507535081, now seen corresponding path program 1 times [2025-03-04 06:56:02,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:02,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109607366] [2025-03-04 06:56:02,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:02,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:02,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 06:56:02,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 06:56:02,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:02,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:02,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:02,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109607366] [2025-03-04 06:56:02,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109607366] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:02,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:02,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:02,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769758342] [2025-03-04 06:56:02,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:02,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:02,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:02,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:02,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:02,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 214 [2025-03-04 06:56:02,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 166 transitions, 344 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-03-04 06:56:02,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:02,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 214 [2025-03-04 06:56:02,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:02,673 INFO L124 PetriNetUnfolderBase]: 171/679 cut-off events. [2025-03-04 06:56:02,673 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 06:56:02,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 927 conditions, 679 events. 171/679 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3272 event pairs, 65 based on Foata normal form. 0/564 useless extension candidates. Maximal degree in co-relation 876. Up to 230 conditions per place. [2025-03-04 06:56:02,678 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 17 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-03-04 06:56:02,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 165 transitions, 380 flow [2025-03-04 06:56:02,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:02,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 524 transitions. [2025-03-04 06:56:02,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8161993769470405 [2025-03-04 06:56:02,680 INFO L175 Difference]: Start difference. First operand has 167 places, 166 transitions, 344 flow. Second operand 3 states and 524 transitions. [2025-03-04 06:56:02,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 165 transitions, 380 flow [2025-03-04 06:56:02,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 165 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:02,683 INFO L231 Difference]: Finished difference. Result has 166 places, 165 transitions, 342 flow [2025-03-04 06:56:02,683 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=164, 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=342, PETRI_PLACES=166, PETRI_TRANSITIONS=165} [2025-03-04 06:56:02,684 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -29 predicate places. [2025-03-04 06:56:02,684 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 165 transitions, 342 flow [2025-03-04 06:56:02,684 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-03-04 06:56:02,684 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:02,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:02,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:56:02,685 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:02,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:02,685 INFO L85 PathProgramCache]: Analyzing trace with hash -873468873, now seen corresponding path program 1 times [2025-03-04 06:56:02,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:02,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430642441] [2025-03-04 06:56:02,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:02,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:02,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 06:56:02,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 06:56:02,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:02,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:02,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:02,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430642441] [2025-03-04 06:56:02,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430642441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:02,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:02,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368681905] [2025-03-04 06:56:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:02,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:02,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:02,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:02,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:02,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 214 [2025-03-04 06:56:02,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 165 transitions, 342 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-03-04 06:56:02,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:02,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 214 [2025-03-04 06:56:02,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:02,820 INFO L124 PetriNetUnfolderBase]: 199/867 cut-off events. [2025-03-04 06:56:02,821 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 06:56:02,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1173 conditions, 867 events. 199/867 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4980 event pairs, 90 based on Foata normal form. 0/698 useless extension candidates. Maximal degree in co-relation 1114. Up to 274 conditions per place. [2025-03-04 06:56:02,828 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 20 selfloop transitions, 1 changer transitions 0/161 dead transitions. [2025-03-04 06:56:02,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 161 transitions, 376 flow [2025-03-04 06:56:02,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:02,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2025-03-04 06:56:02,831 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8052959501557633 [2025-03-04 06:56:02,831 INFO L175 Difference]: Start difference. First operand has 166 places, 165 transitions, 342 flow. Second operand 3 states and 517 transitions. [2025-03-04 06:56:02,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 161 transitions, 376 flow [2025-03-04 06:56:02,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 161 transitions, 372 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:02,833 INFO L231 Difference]: Finished difference. Result has 162 places, 161 transitions, 332 flow [2025-03-04 06:56:02,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=162, PETRI_TRANSITIONS=161} [2025-03-04 06:56:02,833 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -33 predicate places. [2025-03-04 06:56:02,833 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 161 transitions, 332 flow [2025-03-04 06:56:02,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 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-03-04 06:56:02,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:02,834 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] [2025-03-04 06:56:02,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:56:02,834 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:02,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:02,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1884951114, now seen corresponding path program 1 times [2025-03-04 06:56:02,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:02,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200815810] [2025-03-04 06:56:02,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:02,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:02,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-04 06:56:02,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-04 06:56:02,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:02,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:02,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:02,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:02,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200815810] [2025-03-04 06:56:02,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200815810] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:02,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:02,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:02,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887224394] [2025-03-04 06:56:02,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:02,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:02,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:02,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:02,884 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:02,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2025-03-04 06:56:02,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 161 transitions, 332 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-03-04 06:56:02,896 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:02,896 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2025-03-04 06:56:02,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:02,966 INFO L124 PetriNetUnfolderBase]: 232/875 cut-off events. [2025-03-04 06:56:02,966 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-04 06:56:02,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 875 events. 232/875 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 4791 event pairs, 103 based on Foata normal form. 0/714 useless extension candidates. Maximal degree in co-relation 1154. Up to 309 conditions per place. [2025-03-04 06:56:02,973 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 16 selfloop transitions, 1 changer transitions 0/159 dead transitions. [2025-03-04 06:56:02,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 159 transitions, 362 flow [2025-03-04 06:56:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 529 transitions. [2025-03-04 06:56:02,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.82398753894081 [2025-03-04 06:56:02,974 INFO L175 Difference]: Start difference. First operand has 162 places, 161 transitions, 332 flow. Second operand 3 states and 529 transitions. [2025-03-04 06:56:02,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 159 transitions, 362 flow [2025-03-04 06:56:02,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 159 transitions, 361 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:02,976 INFO L231 Difference]: Finished difference. Result has 161 places, 159 transitions, 329 flow [2025-03-04 06:56:02,977 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=327, 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=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=329, PETRI_PLACES=161, PETRI_TRANSITIONS=159} [2025-03-04 06:56:02,977 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -34 predicate places. [2025-03-04 06:56:02,977 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 159 transitions, 329 flow [2025-03-04 06:56:02,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-03-04 06:56:02,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:02,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:02,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:56:02,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:02,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:02,979 INFO L85 PathProgramCache]: Analyzing trace with hash -25216636, now seen corresponding path program 1 times [2025-03-04 06:56:02,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:02,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366468101] [2025-03-04 06:56:02,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:02,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:02,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-03-04 06:56:02,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-03-04 06:56:02,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:02,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:03,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:03,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:03,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366468101] [2025-03-04 06:56:03,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366468101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:03,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:03,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:03,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250294963] [2025-03-04 06:56:03,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:03,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:03,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:03,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:03,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:03,050 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2025-03-04 06:56:03,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 159 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-03-04 06:56:03,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:03,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2025-03-04 06:56:03,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:03,158 INFO L124 PetriNetUnfolderBase]: 300/998 cut-off events. [2025-03-04 06:56:03,159 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2025-03-04 06:56:03,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 998 events. 300/998 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5536 event pairs, 28 based on Foata normal form. 0/867 useless extension candidates. Maximal degree in co-relation 1372. Up to 332 conditions per place. [2025-03-04 06:56:03,167 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 25 selfloop transitions, 2 changer transitions 0/167 dead transitions. [2025-03-04 06:56:03,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 167 transitions, 405 flow [2025-03-04 06:56:03,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:03,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:03,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2025-03-04 06:56:03,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.839563862928349 [2025-03-04 06:56:03,169 INFO L175 Difference]: Start difference. First operand has 161 places, 159 transitions, 329 flow. Second operand 3 states and 539 transitions. [2025-03-04 06:56:03,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 167 transitions, 405 flow [2025-03-04 06:56:03,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 167 transitions, 404 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:56:03,172 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 334 flow [2025-03-04 06:56:03,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=334, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-03-04 06:56:03,173 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -34 predicate places. [2025-03-04 06:56:03,173 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 334 flow [2025-03-04 06:56:03,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-03-04 06:56:03,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:03,173 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] [2025-03-04 06:56:03,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:56:03,174 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:03,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:03,174 INFO L85 PathProgramCache]: Analyzing trace with hash 2079166109, now seen corresponding path program 1 times [2025-03-04 06:56:03,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:03,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566575203] [2025-03-04 06:56:03,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:03,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:03,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 06:56:03,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 06:56:03,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:03,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:03,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:03,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:03,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566575203] [2025-03-04 06:56:03,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566575203] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:03,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:03,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 06:56:03,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976927015] [2025-03-04 06:56:03,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:03,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 06:56:03,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:03,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 06:56:03,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 06:56:03,273 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 214 [2025-03-04 06:56:03,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 334 flow. Second operand has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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-03-04 06:56:03,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:03,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 214 [2025-03-04 06:56:03,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:03,387 INFO L124 PetriNetUnfolderBase]: 169/842 cut-off events. [2025-03-04 06:56:03,388 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 06:56:03,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1132 conditions, 842 events. 169/842 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 4612 event pairs, 54 based on Foata normal form. 0/729 useless extension candidates. Maximal degree in co-relation 1073. Up to 241 conditions per place. [2025-03-04 06:56:03,397 INFO L140 encePairwiseOnDemand]: 208/214 looper letters, 23 selfloop transitions, 5 changer transitions 0/163 dead transitions. [2025-03-04 06:56:03,398 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 163 transitions, 400 flow [2025-03-04 06:56:03,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 06:56:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 06:56:03,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 854 transitions. [2025-03-04 06:56:03,400 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7981308411214953 [2025-03-04 06:56:03,400 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 334 flow. Second operand 5 states and 854 transitions. [2025-03-04 06:56:03,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 163 transitions, 400 flow [2025-03-04 06:56:03,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 163 transitions, 400 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:03,403 INFO L231 Difference]: Finished difference. Result has 169 places, 162 transitions, 372 flow [2025-03-04 06:56:03,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=372, PETRI_PLACES=169, PETRI_TRANSITIONS=162} [2025-03-04 06:56:03,403 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -26 predicate places. [2025-03-04 06:56:03,403 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 162 transitions, 372 flow [2025-03-04 06:56:03,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.25) internal successors, (665), 4 states have internal predecessors, (665), 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-03-04 06:56:03,404 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:03,404 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] [2025-03-04 06:56:03,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:56:03,404 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:03,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:03,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1592261745, now seen corresponding path program 1 times [2025-03-04 06:56:03,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:03,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597274833] [2025-03-04 06:56:03,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:03,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:03,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 06:56:03,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 06:56:03,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:03,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:03,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:03,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597274833] [2025-03-04 06:56:03,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597274833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:03,448 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:03,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:03,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581494707] [2025-03-04 06:56:03,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:03,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:03,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:03,449 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:03,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:03,461 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 214 [2025-03-04 06:56:03,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 162 transitions, 372 flow. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-03-04 06:56:03,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:03,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 214 [2025-03-04 06:56:03,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:03,623 INFO L124 PetriNetUnfolderBase]: 376/1322 cut-off events. [2025-03-04 06:56:03,624 INFO L125 PetriNetUnfolderBase]: For 91/91 co-relation queries the response was YES. [2025-03-04 06:56:03,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1915 conditions, 1322 events. 376/1322 cut-off events. For 91/91 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8378 event pairs, 50 based on Foata normal form. 0/1165 useless extension candidates. Maximal degree in co-relation 1852. Up to 382 conditions per place. [2025-03-04 06:56:03,636 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 26 selfloop transitions, 2 changer transitions 0/171 dead transitions. [2025-03-04 06:56:03,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 171 transitions, 453 flow [2025-03-04 06:56:03,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:03,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:03,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2025-03-04 06:56:03,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8411214953271028 [2025-03-04 06:56:03,638 INFO L175 Difference]: Start difference. First operand has 169 places, 162 transitions, 372 flow. Second operand 3 states and 540 transitions. [2025-03-04 06:56:03,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 171 transitions, 453 flow [2025-03-04 06:56:03,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 171 transitions, 453 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:03,641 INFO L231 Difference]: Finished difference. Result has 170 places, 161 transitions, 378 flow [2025-03-04 06:56:03,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=378, PETRI_PLACES=170, PETRI_TRANSITIONS=161} [2025-03-04 06:56:03,641 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -25 predicate places. [2025-03-04 06:56:03,642 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 161 transitions, 378 flow [2025-03-04 06:56:03,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 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-03-04 06:56:03,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:03,642 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] [2025-03-04 06:56:03,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:56:03,642 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:03,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:03,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1247528685, now seen corresponding path program 1 times [2025-03-04 06:56:03,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:03,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878114614] [2025-03-04 06:56:03,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:03,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:03,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-04 06:56:03,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-04 06:56:03,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:03,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:03,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878114614] [2025-03-04 06:56:03,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878114614] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:03,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:03,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:03,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911453036] [2025-03-04 06:56:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:03,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:03,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:03,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:03,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 214 [2025-03-04 06:56:03,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 161 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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-03-04 06:56:03,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:03,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 214 [2025-03-04 06:56:03,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:03,844 INFO L124 PetriNetUnfolderBase]: 363/1373 cut-off events. [2025-03-04 06:56:03,845 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:56:03,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2029 conditions, 1373 events. 363/1373 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 9210 event pairs, 61 based on Foata normal form. 0/1195 useless extension candidates. Maximal degree in co-relation 1966. Up to 340 conditions per place. [2025-03-04 06:56:03,861 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 18 selfloop transitions, 2 changer transitions 0/166 dead transitions. [2025-03-04 06:56:03,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 166 transitions, 431 flow [2025-03-04 06:56:03,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:03,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-03-04 06:56:03,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457943925233645 [2025-03-04 06:56:03,863 INFO L175 Difference]: Start difference. First operand has 170 places, 161 transitions, 378 flow. Second operand 3 states and 543 transitions. [2025-03-04 06:56:03,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 166 transitions, 431 flow [2025-03-04 06:56:03,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 166 transitions, 431 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:56:03,866 INFO L231 Difference]: Finished difference. Result has 171 places, 160 transitions, 380 flow [2025-03-04 06:56:03,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=169, 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=380, PETRI_PLACES=171, PETRI_TRANSITIONS=160} [2025-03-04 06:56:03,867 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -24 predicate places. [2025-03-04 06:56:03,867 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 160 transitions, 380 flow [2025-03-04 06:56:03,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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-03-04 06:56:03,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:03,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:03,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:56:03,867 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:03,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:03,868 INFO L85 PathProgramCache]: Analyzing trace with hash -746581598, now seen corresponding path program 1 times [2025-03-04 06:56:03,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:03,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980669455] [2025-03-04 06:56:03,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:03,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:03,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-04 06:56:03,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-04 06:56:03,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:03,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:03,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:03,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:03,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980669455] [2025-03-04 06:56:03,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980669455] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:03,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:03,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:03,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548752031] [2025-03-04 06:56:03,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:03,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:03,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:03,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:03,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:03,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 214 [2025-03-04 06:56:03,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 160 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-03-04 06:56:03,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:03,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 214 [2025-03-04 06:56:03,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:04,042 INFO L124 PetriNetUnfolderBase]: 416/1381 cut-off events. [2025-03-04 06:56:04,043 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2025-03-04 06:56:04,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2235 conditions, 1381 events. 416/1381 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 9026 event pairs, 75 based on Foata normal form. 0/1226 useless extension candidates. Maximal degree in co-relation 2171. Up to 344 conditions per place. [2025-03-04 06:56:04,058 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 18 selfloop transitions, 2 changer transitions 0/165 dead transitions. [2025-03-04 06:56:04,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 165 transitions, 435 flow [2025-03-04 06:56:04,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-03-04 06:56:04,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457943925233645 [2025-03-04 06:56:04,060 INFO L175 Difference]: Start difference. First operand has 171 places, 160 transitions, 380 flow. Second operand 3 states and 543 transitions. [2025-03-04 06:56:04,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 165 transitions, 435 flow [2025-03-04 06:56:04,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 165 transitions, 429 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:04,062 INFO L231 Difference]: Finished difference. Result has 170 places, 159 transitions, 378 flow [2025-03-04 06:56:04,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=168, 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=378, PETRI_PLACES=170, PETRI_TRANSITIONS=159} [2025-03-04 06:56:04,065 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -25 predicate places. [2025-03-04 06:56:04,065 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 159 transitions, 378 flow [2025-03-04 06:56:04,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 states have internal predecessors, (526), 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-03-04 06:56:04,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:04,066 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:04,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:56:04,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:04,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:04,067 INFO L85 PathProgramCache]: Analyzing trace with hash -693973373, now seen corresponding path program 1 times [2025-03-04 06:56:04,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:04,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314293029] [2025-03-04 06:56:04,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:04,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:04,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 06:56:04,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 06:56:04,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:04,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:04,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:04,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:04,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314293029] [2025-03-04 06:56:04,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314293029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:04,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:04,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:04,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442544187] [2025-03-04 06:56:04,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:04,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:04,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:04,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:04,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:04,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 214 [2025-03-04 06:56:04,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 159 transitions, 378 flow. Second operand has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-03-04 06:56:04,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:04,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 214 [2025-03-04 06:56:04,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:04,242 INFO L124 PetriNetUnfolderBase]: 507/1401 cut-off events. [2025-03-04 06:56:04,243 INFO L125 PetriNetUnfolderBase]: For 265/265 co-relation queries the response was YES. [2025-03-04 06:56:04,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2419 conditions, 1401 events. 507/1401 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 8621 event pairs, 79 based on Foata normal form. 0/1277 useless extension candidates. Maximal degree in co-relation 2355. Up to 399 conditions per place. [2025-03-04 06:56:04,251 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 18 selfloop transitions, 2 changer transitions 0/164 dead transitions. [2025-03-04 06:56:04,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 164 transitions, 433 flow [2025-03-04 06:56:04,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:04,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:04,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-03-04 06:56:04,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457943925233645 [2025-03-04 06:56:04,253 INFO L175 Difference]: Start difference. First operand has 170 places, 159 transitions, 378 flow. Second operand 3 states and 543 transitions. [2025-03-04 06:56:04,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 164 transitions, 433 flow [2025-03-04 06:56:04,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 164 transitions, 427 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:04,255 INFO L231 Difference]: Finished difference. Result has 169 places, 158 transitions, 376 flow [2025-03-04 06:56:04,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=376, PETRI_PLACES=169, PETRI_TRANSITIONS=158} [2025-03-04 06:56:04,257 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -26 predicate places. [2025-03-04 06:56:04,257 INFO L471 AbstractCegarLoop]: Abstraction has has 169 places, 158 transitions, 376 flow [2025-03-04 06:56:04,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 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-03-04 06:56:04,257 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:04,257 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] [2025-03-04 06:56:04,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:56:04,257 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread4Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2046338275, now seen corresponding path program 1 times [2025-03-04 06:56:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905728896] [2025-03-04 06:56:04,258 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:04,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:04,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-04 06:56:04,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-04 06:56:04,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:04,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:04,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:04,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:04,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905728896] [2025-03-04 06:56:04,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905728896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:04,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:04,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:04,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933953224] [2025-03-04 06:56:04,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:04,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:04,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:04,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:04,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:04,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 214 [2025-03-04 06:56:04,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 158 transitions, 376 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-03-04 06:56:04,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:04,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 214 [2025-03-04 06:56:04,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:04,410 INFO L124 PetriNetUnfolderBase]: 514/1468 cut-off events. [2025-03-04 06:56:04,410 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2025-03-04 06:56:04,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 1468 events. 514/1468 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8927 event pairs, 91 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 2364. Up to 376 conditions per place. [2025-03-04 06:56:04,419 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 18 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2025-03-04 06:56:04,420 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 163 transitions, 431 flow [2025-03-04 06:56:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:04,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-03-04 06:56:04,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457943925233645 [2025-03-04 06:56:04,421 INFO L175 Difference]: Start difference. First operand has 169 places, 158 transitions, 376 flow. Second operand 3 states and 543 transitions. [2025-03-04 06:56:04,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 163 transitions, 431 flow [2025-03-04 06:56:04,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 163 transitions, 425 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:04,427 INFO L231 Difference]: Finished difference. Result has 168 places, 157 transitions, 374 flow [2025-03-04 06:56:04,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=166, 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=374, PETRI_PLACES=168, PETRI_TRANSITIONS=157} [2025-03-04 06:56:04,428 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -27 predicate places. [2025-03-04 06:56:04,428 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 157 transitions, 374 flow [2025-03-04 06:56:04,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 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-03-04 06:56:04,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:56:04,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:04,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 06:56:04,429 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE (and 63 more)] === [2025-03-04 06:56:04,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:56:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1287272163, now seen corresponding path program 1 times [2025-03-04 06:56:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:56:04,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660967742] [2025-03-04 06:56:04,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:56:04,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:56:04,437 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-04 06:56:04,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-04 06:56:04,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:56:04,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:56:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:56:04,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:56:04,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660967742] [2025-03-04 06:56:04,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660967742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:56:04,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:56:04,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 06:56:04,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994364067] [2025-03-04 06:56:04,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:56:04,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:56:04,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:56:04,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:56:04,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:56:04,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 214 [2025-03-04 06:56:04,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 157 transitions, 374 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-03-04 06:56:04,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:56:04,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 214 [2025-03-04 06:56:04,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:56:04,558 INFO L124 PetriNetUnfolderBase]: 220/1023 cut-off events. [2025-03-04 06:56:04,559 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-04 06:56:04,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1464 conditions, 1023 events. 220/1023 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 6207 event pairs, 79 based on Foata normal form. 1/957 useless extension candidates. Maximal degree in co-relation 1400. Up to 307 conditions per place. [2025-03-04 06:56:04,563 INFO L140 encePairwiseOnDemand]: 212/214 looper letters, 0 selfloop transitions, 0 changer transitions 156/156 dead transitions. [2025-03-04 06:56:04,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 156 transitions, 398 flow [2025-03-04 06:56:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:56:04,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:56:04,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 536 transitions. [2025-03-04 06:56:04,564 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8348909657320872 [2025-03-04 06:56:04,564 INFO L175 Difference]: Start difference. First operand has 168 places, 157 transitions, 374 flow. Second operand 3 states and 536 transitions. [2025-03-04 06:56:04,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 156 transitions, 398 flow [2025-03-04 06:56:04,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 156 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:56:04,566 INFO L231 Difference]: Finished difference. Result has 167 places, 0 transitions, 0 flow [2025-03-04 06:56:04,566 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=167, PETRI_TRANSITIONS=0} [2025-03-04 06:56:04,566 INFO L279 CegarLoopForPetriNet]: 195 programPoint places, -28 predicate places. [2025-03-04 06:56:04,566 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 0 transitions, 0 flow [2025-03-04 06:56:04,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 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-03-04 06:56:04,569 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (64 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (63 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (62 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (61 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (60 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (59 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (58 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (57 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (56 of 67 remaining) [2025-03-04 06:56:04,570 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (55 of 67 remaining) [2025-03-04 06:56:04,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 67 remaining) [2025-03-04 06:56:04,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (53 of 67 remaining) [2025-03-04 06:56:04,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (52 of 67 remaining) [2025-03-04 06:56:04,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (51 of 67 remaining) [2025-03-04 06:56:04,571 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (50 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (49 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (48 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (47 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (46 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (45 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (44 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (43 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (42 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (41 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (40 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (39 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (38 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (37 of 67 remaining) [2025-03-04 06:56:04,572 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (32 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (31 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (30 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (29 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (28 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (27 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (26 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (22 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (21 of 67 remaining) [2025-03-04 06:56:04,573 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (20 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (19 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (18 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (17 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (16 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (15 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (14 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (12 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (11 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (10 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (9 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (8 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 67 remaining) [2025-03-04 06:56:04,574 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 67 remaining) [2025-03-04 06:56:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 67 remaining) [2025-03-04 06:56:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 67 remaining) [2025-03-04 06:56:04,575 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 67 remaining) [2025-03-04 06:56:04,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:56:04,575 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:56:04,579 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 06:56:04,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 06:56:04,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 06:56:04 BasicIcfg [2025-03-04 06:56:04,584 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 06:56:04,584 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 06:56:04,584 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 06:56:04,585 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 06:56:04,585 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:56:01" (3/4) ... [2025-03-04 06:56:04,586 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 06:56:04,588 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 06:56:04,588 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 06:56:04,588 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 06:56:04,588 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-04 06:56:04,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-03-04 06:56:04,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-04 06:56:04,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 06:56:04,591 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 06:56:04,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 06:56:04,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 06:56:04,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 06:56:04,641 INFO L158 Benchmark]: Toolchain (without parser) took 4060.08ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 123.5MB in the beginning and 133.0MB in the end (delta: -9.5MB). Peak memory consumption was 170.9MB. Max. memory is 16.1GB. [2025-03-04 06:56:04,641 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:04,641 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.88ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:04,641 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.48ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 109.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:04,641 INFO L158 Benchmark]: Boogie Preprocessor took 27.86ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.1MB in the end (delta: 829.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 06:56:04,642 INFO L158 Benchmark]: IcfgBuilder took 575.14ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 73.9MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 06:56:04,642 INFO L158 Benchmark]: TraceAbstraction took 3170.27ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 73.9MB in the beginning and 136.7MB in the end (delta: -62.8MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. [2025-03-04 06:56:04,642 INFO L158 Benchmark]: Witness Printer took 55.91ms. Allocated memory is still 352.3MB. Free memory was 136.7MB in the beginning and 133.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 06:56:04,645 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.42ms. Allocated memory is still 201.3MB. Free memory is still 118.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 184.88ms. Allocated memory is still 167.8MB. Free memory was 123.5MB in the beginning and 111.5MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.48ms. Allocated memory is still 167.8MB. Free memory was 111.5MB in the beginning and 109.9MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.86ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 109.1MB in the end (delta: 829.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 575.14ms. Allocated memory is still 167.8MB. Free memory was 109.1MB in the beginning and 73.9MB in the end (delta: 35.2MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3170.27ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 73.9MB in the beginning and 136.7MB in the end (delta: -62.8MB). Peak memory consumption was 120.6MB. Max. memory is 16.1GB. * Witness Printer took 55.91ms. Allocated memory is still 352.3MB. Free memory was 136.7MB in the beginning and 133.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: 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: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 273 locations, 67 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.1s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 85 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 524 IncrementalHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 74 mSDtfsCounter, 524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=410occurred in iteration=0, InterpolantAutomatonStates: 44, 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.5s InterpolantComputationTime, 937 NumberOfCodeBlocks, 937 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 923 ConstructedInterpolants, 0 QuantifiedInterpolants, 951 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 37 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 06:56:04,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE