./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash de0411014dc6a77a3d6f6b87d1d3911a4ed9d471cff70aeb544ffa33b63e5b55 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:32:23,654 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:32:23,704 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:32:23,707 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:32:23,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:32:23,722 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:32:23,723 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:32:23,723 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:32:23,723 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:32:23,723 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:32:23,724 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:32:23,724 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:32:23,724 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:32:23,724 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:32:23,724 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:32:23,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:32:23,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:32:23,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:32:23,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:32:23,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:32:23,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:23,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:23,726 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:32:23,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:32:23,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:32:23,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:32:23,727 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:32:23,727 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:32:23,727 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0411014dc6a77a3d6f6b87d1d3911a4ed9d471cff70aeb544ffa33b63e5b55 [2025-01-09 21:32:24,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:32:24,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:32:24,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:32:24,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:32:24,110 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:32:24,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c [2025-01-09 21:32:25,216 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/674f1a1ac/bafeeb59b4314b6cadd5ada335cad23f/FLAGd0600323e [2025-01-09 21:32:25,479 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:32:25,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/parallel-simple-equiv.wvr.c [2025-01-09 21:32:25,496 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/674f1a1ac/bafeeb59b4314b6cadd5ada335cad23f/FLAGd0600323e [2025-01-09 21:32:25,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/674f1a1ac/bafeeb59b4314b6cadd5ada335cad23f [2025-01-09 21:32:25,525 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:32:25,526 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:32:25,527 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:25,527 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:32:25,533 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:32:25,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,534 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61afeb98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25, skipping insertion in model container [2025-01-09 21:32:25,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,546 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:32:25,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:25,664 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:32:25,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:32:25,695 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:32:25,700 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25 WrapperNode [2025-01-09 21:32:25,700 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:32:25,701 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:25,701 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:32:25,701 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:32:25,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,731 INFO L138 Inliner]: procedures = 19, calls = 12, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 70 [2025-01-09 21:32:25,733 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:32:25,734 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:32:25,734 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:32:25,734 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:32:25,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,738 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,739 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,741 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,743 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,744 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,750 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,750 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:32:25,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:32:25,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:32:25,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:32:25,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (1/1) ... [2025-01-09 21:32:25,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:32:25,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:32:25,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:32:25,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:32:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:32:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:32:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:32:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:32:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:32:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:32:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:32:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:32:25,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:32:25,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:32:25,822 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:32:25,902 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:32:25,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:32:26,065 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:32:26,065 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:32:26,088 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:32:26,088 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:32:26,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:26 BoogieIcfgContainer [2025-01-09 21:32:26,089 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:32:26,090 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:32:26,090 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:32:26,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:32:26,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:32:25" (1/3) ... [2025-01-09 21:32:26,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39beb469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:26, skipping insertion in model container [2025-01-09 21:32:26,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:32:25" (2/3) ... [2025-01-09 21:32:26,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39beb469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:32:26, skipping insertion in model container [2025-01-09 21:32:26,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:26" (3/3) ... [2025-01-09 21:32:26,103 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-simple-equiv.wvr.c [2025-01-09 21:32:26,130 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:32:26,131 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-simple-equiv.wvr.c that has 4 procedures, 135 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-01-09 21:32:26,131 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:32:26,223 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:32:26,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 144 places, 136 transitions, 293 flow [2025-01-09 21:32:26,303 INFO L124 PetriNetUnfolderBase]: 2/133 cut-off events. [2025-01-09 21:32:26,306 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:32:26,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 133 events. 2/133 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2025-01-09 21:32:26,309 INFO L82 GeneralOperation]: Start removeDead. Operand has 144 places, 136 transitions, 293 flow [2025-01-09 21:32:26,312 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 116 transitions, 250 flow [2025-01-09 21:32:26,317 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:32:26,325 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;@20e3ad0e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:32:26,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:32:26,333 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:32:26,333 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:32:26,333 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:32:26,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:26,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:26,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:26,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:26,337 INFO L85 PathProgramCache]: Analyzing trace with hash 499808123, now seen corresponding path program 1 times [2025-01-09 21:32:26,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:26,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206709737] [2025-01-09 21:32:26,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:26,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:26,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:32:26,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:32:26,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:26,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:26,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:26,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206709737] [2025-01-09 21:32:26,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206709737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:26,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:26,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:26,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843975955] [2025-01-09 21:32:26,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:26,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:26,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:26,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:26,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:26,547 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2025-01-09 21:32:26,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 116 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:26,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2025-01-09 21:32:26,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:26,610 INFO L124 PetriNetUnfolderBase]: 39/249 cut-off events. [2025-01-09 21:32:26,611 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-01-09 21:32:26,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 249 events. 39/249 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 786 event pairs, 39 based on Foata normal form. 1/218 useless extension candidates. Maximal degree in co-relation 265. Up to 87 conditions per place. [2025-01-09 21:32:26,614 INFO L140 encePairwiseOnDemand]: 132/136 looper letters, 17 selfloop transitions, 2 changer transitions 1/114 dead transitions. [2025-01-09 21:32:26,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 114 transitions, 284 flow [2025-01-09 21:32:26,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:26,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2025-01-09 21:32:26,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.875 [2025-01-09 21:32:26,624 INFO L175 Difference]: Start difference. First operand has 125 places, 116 transitions, 250 flow. Second operand 3 states and 357 transitions. [2025-01-09 21:32:26,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 114 transitions, 284 flow [2025-01-09 21:32:26,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 114 transitions, 272 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:32:26,629 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 236 flow [2025-01-09 21:32:26,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2025-01-09 21:32:26,633 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -5 predicate places. [2025-01-09 21:32:26,633 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 236 flow [2025-01-09 21:32:26,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:26,634 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] [2025-01-09 21:32:26,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:32:26,635 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -691008764, now seen corresponding path program 1 times [2025-01-09 21:32:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316942940] [2025-01-09 21:32:26,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:26,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-09 21:32:26,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-09 21:32:26,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:26,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:26,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:26,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:26,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316942940] [2025-01-09 21:32:26,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316942940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:26,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:26,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:26,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376908391] [2025-01-09 21:32:26,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:26,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:26,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:26,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:26,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:26,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2025-01-09 21:32:26,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:26,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2025-01-09 21:32:26,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:26,775 INFO L124 PetriNetUnfolderBase]: 39/247 cut-off events. [2025-01-09 21:32:26,775 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-01-09 21:32:26,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 247 events. 39/247 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 786 event pairs, 39 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 315. Up to 85 conditions per place. [2025-01-09 21:32:26,777 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 15 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-01-09 21:32:26,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 112 transitions, 268 flow [2025-01-09 21:32:26,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:26,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:26,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2025-01-09 21:32:26,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8823529411764706 [2025-01-09 21:32:26,781 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 236 flow. Second operand 3 states and 360 transitions. [2025-01-09 21:32:26,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 112 transitions, 268 flow [2025-01-09 21:32:26,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 112 transitions, 264 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:26,783 INFO L231 Difference]: Finished difference. Result has 118 places, 112 transitions, 234 flow [2025-01-09 21:32:26,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=118, PETRI_TRANSITIONS=112} [2025-01-09 21:32:26,784 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -7 predicate places. [2025-01-09 21:32:26,784 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 112 transitions, 234 flow [2025-01-09 21:32:26,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:26,784 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] [2025-01-09 21:32:26,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:32:26,784 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:26,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:26,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1972543682, now seen corresponding path program 1 times [2025-01-09 21:32:26,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:26,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258760815] [2025-01-09 21:32:26,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:26,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:26,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:32:26,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:32:26,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:26,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:26,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:26,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:26,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258760815] [2025-01-09 21:32:26,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258760815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:26,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:26,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:26,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263320793] [2025-01-09 21:32:26,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:26,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:26,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:26,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:26,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:26,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 136 [2025-01-09 21:32:26,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 112 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:26,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 136 [2025-01-09 21:32:26,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:26,912 INFO L124 PetriNetUnfolderBase]: 55/415 cut-off events. [2025-01-09 21:32:26,912 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-09 21:32:26,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 542 conditions, 415 events. 55/415 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1789 event pairs, 39 based on Foata normal form. 1/366 useless extension candidates. Maximal degree in co-relation 505. Up to 83 conditions per place. [2025-01-09 21:32:26,915 INFO L140 encePairwiseOnDemand]: 127/136 looper letters, 16 selfloop transitions, 4 changer transitions 2/112 dead transitions. [2025-01-09 21:32:26,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 112 transitions, 280 flow [2025-01-09 21:32:26,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:26,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:26,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2025-01-09 21:32:26,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8725490196078431 [2025-01-09 21:32:26,918 INFO L175 Difference]: Start difference. First operand has 118 places, 112 transitions, 234 flow. Second operand 3 states and 356 transitions. [2025-01-09 21:32:26,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 112 transitions, 280 flow [2025-01-09 21:32:26,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 112 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:26,922 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 225 flow [2025-01-09 21:32:26,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=225, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2025-01-09 21:32:26,923 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -11 predicate places. [2025-01-09 21:32:26,923 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 225 flow [2025-01-09 21:32:26,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:26,923 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:26,923 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] [2025-01-09 21:32:26,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:32:26,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:26,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:26,924 INFO L85 PathProgramCache]: Analyzing trace with hash 312560932, now seen corresponding path program 1 times [2025-01-09 21:32:26,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:26,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024606736] [2025-01-09 21:32:26,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:26,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:26,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:32:26,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:32:26,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:26,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024606736] [2025-01-09 21:32:27,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024606736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777820761] [2025-01-09 21:32:27,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2025-01-09 21:32:27,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2025-01-09 21:32:27,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,149 INFO L124 PetriNetUnfolderBase]: 63/396 cut-off events. [2025-01-09 21:32:27,154 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:32:27,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 396 events. 63/396 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1665 event pairs, 47 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 289. Up to 97 conditions per place. [2025-01-09 21:32:27,156 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 17 selfloop transitions, 2 changer transitions 0/109 dead transitions. [2025-01-09 21:32:27,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 109 transitions, 271 flow [2025-01-09 21:32:27,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-01-09 21:32:27,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2025-01-09 21:32:27,160 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 225 flow. Second operand 3 states and 368 transitions. [2025-01-09 21:32:27,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 109 transitions, 271 flow [2025-01-09 21:32:27,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 109 transitions, 263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,162 INFO L231 Difference]: Finished difference. Result has 111 places, 105 transitions, 219 flow [2025-01-09 21:32:27,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=219, PETRI_PLACES=111, PETRI_TRANSITIONS=105} [2025-01-09 21:32:27,162 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -14 predicate places. [2025-01-09 21:32:27,162 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 105 transitions, 219 flow [2025-01-09 21:32:27,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,164 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-01-09 21:32:27,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:32:27,164 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread3Err2ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:27,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,167 INFO L85 PathProgramCache]: Analyzing trace with hash 13955208, now seen corresponding path program 1 times [2025-01-09 21:32:27,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246049970] [2025-01-09 21:32:27,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:32:27,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:32:27,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246049970] [2025-01-09 21:32:27,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246049970] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322898417] [2025-01-09 21:32:27,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,239 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2025-01-09 21:32:27,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 105 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,240 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,240 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2025-01-09 21:32:27,240 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,285 INFO L124 PetriNetUnfolderBase]: 55/350 cut-off events. [2025-01-09 21:32:27,285 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-09 21:32:27,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 479 conditions, 350 events. 55/350 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1335 event pairs, 23 based on Foata normal form. 0/321 useless extension candidates. Maximal degree in co-relation 323. Up to 60 conditions per place. [2025-01-09 21:32:27,287 INFO L140 encePairwiseOnDemand]: 131/136 looper letters, 15 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2025-01-09 21:32:27,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 107 transitions, 261 flow [2025-01-09 21:32:27,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-01-09 21:32:27,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2025-01-09 21:32:27,291 INFO L175 Difference]: Start difference. First operand has 111 places, 105 transitions, 219 flow. Second operand 3 states and 368 transitions. [2025-01-09 21:32:27,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 107 transitions, 261 flow [2025-01-09 21:32:27,292 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 107 transitions, 257 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,293 INFO L231 Difference]: Finished difference. Result has 109 places, 103 transitions, 217 flow [2025-01-09 21:32:27,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=217, PETRI_PLACES=109, PETRI_TRANSITIONS=103} [2025-01-09 21:32:27,296 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -16 predicate places. [2025-01-09 21:32:27,296 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 103 transitions, 217 flow [2025-01-09 21:32:27,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,296 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,296 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] [2025-01-09 21:32:27,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:32:27,296 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:27,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1258925045, now seen corresponding path program 1 times [2025-01-09 21:32:27,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197311742] [2025-01-09 21:32:27,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-01-09 21:32:27,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-01-09 21:32:27,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197311742] [2025-01-09 21:32:27,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197311742] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173852225] [2025-01-09 21:32:27,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2025-01-09 21:32:27,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 103 transitions, 217 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2025-01-09 21:32:27,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,438 INFO L124 PetriNetUnfolderBase]: 63/351 cut-off events. [2025-01-09 21:32:27,438 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:32:27,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 351 events. 63/351 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1368 event pairs, 47 based on Foata normal form. 0/324 useless extension candidates. Maximal degree in co-relation 232. Up to 98 conditions per place. [2025-01-09 21:32:27,440 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 18 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2025-01-09 21:32:27,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 265 flow [2025-01-09 21:32:27,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-01-09 21:32:27,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8897058823529411 [2025-01-09 21:32:27,443 INFO L175 Difference]: Start difference. First operand has 109 places, 103 transitions, 217 flow. Second operand 3 states and 363 transitions. [2025-01-09 21:32:27,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 265 flow [2025-01-09 21:32:27,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 106 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,445 INFO L231 Difference]: Finished difference. Result has 108 places, 102 transitions, 213 flow [2025-01-09 21:32:27,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=213, PETRI_PLACES=108, PETRI_TRANSITIONS=102} [2025-01-09 21:32:27,447 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -17 predicate places. [2025-01-09 21:32:27,447 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 102 transitions, 213 flow [2025-01-09 21:32:27,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,448 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-01-09 21:32:27,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:32:27,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:27,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1472934931, now seen corresponding path program 1 times [2025-01-09 21:32:27,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999078667] [2025-01-09 21:32:27,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:32:27,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:32:27,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999078667] [2025-01-09 21:32:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999078667] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109574710] [2025-01-09 21:32:27,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,542 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 136 [2025-01-09 21:32:27,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 102 transitions, 213 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,542 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,542 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 136 [2025-01-09 21:32:27,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,608 INFO L124 PetriNetUnfolderBase]: 63/320 cut-off events. [2025-01-09 21:32:27,608 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:32:27,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 458 conditions, 320 events. 63/320 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1147 event pairs, 47 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 260. Up to 97 conditions per place. [2025-01-09 21:32:27,610 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 17 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-01-09 21:32:27,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 105 transitions, 259 flow [2025-01-09 21:32:27,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-01-09 21:32:27,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2025-01-09 21:32:27,611 INFO L175 Difference]: Start difference. First operand has 108 places, 102 transitions, 213 flow. Second operand 3 states and 368 transitions. [2025-01-09 21:32:27,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 105 transitions, 259 flow [2025-01-09 21:32:27,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,612 INFO L231 Difference]: Finished difference. Result has 107 places, 101 transitions, 211 flow [2025-01-09 21:32:27,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=107, PETRI_TRANSITIONS=101} [2025-01-09 21:32:27,617 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -18 predicate places. [2025-01-09 21:32:27,617 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 101 transitions, 211 flow [2025-01-09 21:32:27,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:32:27,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:27,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:32:27,617 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread3Err0ASSERT_VIOLATIONDATA_RACE, thread3Err1ASSERT_VIOLATIONDATA_RACE, thread3Err2ASSERT_VIOLATIONDATA_RACE, thread3Err3ASSERT_VIOLATIONDATA_RACE (and 19 more)] === [2025-01-09 21:32:27,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:32:27,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2144522868, now seen corresponding path program 1 times [2025-01-09 21:32:27,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:32:27,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673270659] [2025-01-09 21:32:27,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:32:27,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:32:27,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:32:27,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:32:27,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:32:27,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:32:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:32:27,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:32:27,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673270659] [2025-01-09 21:32:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673270659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:32:27,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:32:27,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:32:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997539188] [2025-01-09 21:32:27,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:32:27,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:32:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:32:27,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:32:27,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:32:27,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 136 [2025-01-09 21:32:27,743 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 101 transitions, 211 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:32:27,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 136 [2025-01-09 21:32:27,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:32:27,798 INFO L124 PetriNetUnfolderBase]: 63/289 cut-off events. [2025-01-09 21:32:27,798 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:32:27,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 289 events. 63/289 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1004 event pairs, 47 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 271. Up to 98 conditions per place. [2025-01-09 21:32:27,801 INFO L140 encePairwiseOnDemand]: 133/136 looper letters, 0 selfloop transitions, 0 changer transitions 104/104 dead transitions. [2025-01-09 21:32:27,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 104 transitions, 259 flow [2025-01-09 21:32:27,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:32:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:32:27,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-01-09 21:32:27,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8897058823529411 [2025-01-09 21:32:27,806 INFO L175 Difference]: Start difference. First operand has 107 places, 101 transitions, 211 flow. Second operand 3 states and 363 transitions. [2025-01-09 21:32:27,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 104 transitions, 259 flow [2025-01-09 21:32:27,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 104 transitions, 255 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:32:27,807 INFO L231 Difference]: Finished difference. Result has 106 places, 0 transitions, 0 flow [2025-01-09 21:32:27,808 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=106, PETRI_TRANSITIONS=0} [2025-01-09 21:32:27,809 INFO L279 CegarLoopForPetriNet]: 125 programPoint places, -19 predicate places. [2025-01-09 21:32:27,809 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 0 transitions, 0 flow [2025-01-09 21:32:27,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (22 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 23 remaining) [2025-01-09 21:32:27,815 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:32:27,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:32:27,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:32:27,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:32:27,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:32:27,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:32:27,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:32:27,816 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:32:27,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:32:27,816 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:32:27,825 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:32:27,825 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:32:27,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:32:27 BasicIcfg [2025-01-09 21:32:27,832 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:32:27,838 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:32:27,838 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:32:27,838 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:32:27,838 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:32:26" (3/4) ... [2025-01-09 21:32:27,839 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:32:27,848 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:32:27,848 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:32:27,848 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-01-09 21:32:27,855 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2025-01-09 21:32:27,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:32:27,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:32:27,856 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:32:27,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:32:27,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:32:27,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:32:27,990 INFO L158 Benchmark]: Toolchain (without parser) took 2460.57ms. Allocated memory is still 201.3MB. Free memory was 158.3MB in the beginning and 152.8MB in the end (delta: 5.6MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2025-01-09 21:32:27,991 INFO L158 Benchmark]: CDTParser took 1.35ms. Allocated memory is still 209.7MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:27,991 INFO L158 Benchmark]: CACSL2BoogieTranslator took 173.65ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 146.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:27,991 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.11ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:27,991 INFO L158 Benchmark]: Boogie Preprocessor took 19.49ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.6MB in the end (delta: 923.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:32:27,991 INFO L158 Benchmark]: RCFGBuilder took 335.17ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 130.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:32:27,991 INFO L158 Benchmark]: TraceAbstraction took 1741.89ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 158.6MB in the end (delta: -29.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2025-01-09 21:32:27,992 INFO L158 Benchmark]: Witness Printer took 148.37ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 152.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:32:27,994 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.35ms. Allocated memory is still 209.7MB. Free memory is still 124.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 173.65ms. Allocated memory is still 201.3MB. Free memory was 158.0MB in the beginning and 146.8MB in the end (delta: 11.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.11ms. Allocated memory is still 201.3MB. Free memory was 146.8MB in the beginning and 145.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.49ms. Allocated memory is still 201.3MB. Free memory was 145.6MB in the beginning and 144.6MB in the end (delta: 923.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 335.17ms. Allocated memory is still 201.3MB. Free memory was 144.6MB in the beginning and 130.1MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1741.89ms. Allocated memory is still 201.3MB. Free memory was 129.5MB in the beginning and 158.6MB in the end (delta: -29.0MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. * Witness Printer took 148.37ms. Allocated memory is still 201.3MB. Free memory was 158.6MB in the beginning and 152.8MB in the end (delta: 5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 190 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 332 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 84 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 385 IncrementalHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 84 mSDtfsCounter, 385 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=250occurred in iteration=0, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 439 NumberOfCodeBlocks, 439 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 431 ConstructedInterpolants, 0 QuantifiedInterpolants, 447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:32:28,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE