./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2076b13c59b7d49779b8c352bd775e6bfc3c974320821f52074d18209bb5536d --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:04,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:04,451 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:04,457 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:04,459 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:04,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:04,483 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:04,483 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:04,483 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:04,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:04,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:04,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:04,485 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:04,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:04,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:04,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:04,487 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:04,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:04,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:04,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:04,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:04,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:04,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:04,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:04,488 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:04,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:04,489 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2076b13c59b7d49779b8c352bd775e6bfc3c974320821f52074d18209bb5536d [2025-04-29 11:08:04,696 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:04,704 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:04,705 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:04,706 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:04,706 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:04,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.c [2025-04-29 11:08:05,980 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2166540b/c0fc449091544560aa57857d531fcb70/FLAG17448775a [2025-04-29 11:08:06,196 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:06,197 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_37-indirect_rc.c [2025-04-29 11:08:06,198 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:06,205 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2166540b/c0fc449091544560aa57857d531fcb70/FLAG17448775a [2025-04-29 11:08:07,131 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2166540b/c0fc449091544560aa57857d531fcb70 [2025-04-29 11:08:07,133 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:07,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:07,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:07,135 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:07,139 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:07,140 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20de96ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07, skipping insertion in model container [2025-04-29 11:08:07,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,152 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:07,316 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:07,325 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:07,345 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:07,365 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:07,365 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07 WrapperNode [2025-04-29 11:08:07,365 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:07,366 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:07,366 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:07,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:07,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,398 INFO L138 Inliner]: procedures = 11, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-04-29 11:08:07,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:07,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:07,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:07,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:07,409 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,416 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,416 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,424 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,428 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,430 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,430 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,434 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,437 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:07,438 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:07,440 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:07,440 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:07,441 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (1/1) ... [2025-04-29 11:08:07,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:07,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:07,470 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:07,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:07,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:07,504 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:07,504 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:07,504 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:07,505 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:07,566 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:07,567 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:07,702 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:07,702 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:07,714 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:07,714 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:07,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:07 BoogieIcfgContainer [2025-04-29 11:08:07,714 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:07,716 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:07,716 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:07,718 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:07,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:07" (1/3) ... [2025-04-29 11:08:07,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c193a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:07, skipping insertion in model container [2025-04-29 11:08:07,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:07" (2/3) ... [2025-04-29 11:08:07,719 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29c193a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:07, skipping insertion in model container [2025-04-29 11:08:07,719 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:07" (3/3) ... [2025-04-29 11:08:07,724 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_37-indirect_rc.c [2025-04-29 11:08:07,734 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:07,736 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_37-indirect_rc.c that has 2 procedures, 93 locations, 91 edges, 1 initial locations, 0 loop locations, and 9 error locations. [2025-04-29 11:08:07,736 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:07,784 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:08:07,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 96 places, 92 transitions, 191 flow [2025-04-29 11:08:07,854 INFO L116 PetriNetUnfolderBase]: 0/91 cut-off events. [2025-04-29 11:08:07,856 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:07,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 91 events. 0/91 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 64 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-04-29 11:08:07,858 INFO L82 GeneralOperation]: Start removeDead. Operand has 96 places, 92 transitions, 191 flow [2025-04-29 11:08:07,861 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 86 transitions, 175 flow [2025-04-29 11:08:07,871 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:07,882 INFO L340 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;@390f155c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:07,882 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:08:07,888 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:07,889 INFO L116 PetriNetUnfolderBase]: 0/17 cut-off events. [2025-04-29 11:08:07,889 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:07,889 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:07,889 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:07,889 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:07,894 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:07,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1913425454, now seen corresponding path program 1 times [2025-04-29 11:08:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:07,900 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445549048] [2025-04-29 11:08:07,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:07,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:08:07,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:08:07,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:07,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:08,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:08,016 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445549048] [2025-04-29 11:08:08,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445549048] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:08,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:08,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:08,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603335179] [2025-04-29 11:08:08,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:08,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:08,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:08,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:08,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:08,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 92 [2025-04-29 11:08:08,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-04-29 11:08:08,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:08,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 92 [2025-04-29 11:08:08,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:08,117 INFO L116 PetriNetUnfolderBase]: 2/115 cut-off events. [2025-04-29 11:08:08,117 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:08,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134 conditions, 115 events. 2/115 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 180 event pairs, 2 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 90. Up to 13 conditions per place. [2025-04-29 11:08:08,120 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 8 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-04-29 11:08:08,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 193 flow [2025-04-29 11:08:08,121 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:08,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:08,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-04-29 11:08:08,131 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8985507246376812 [2025-04-29 11:08:08,133 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 175 flow. Second operand 3 states and 248 transitions. [2025-04-29 11:08:08,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 193 flow [2025-04-29 11:08:08,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 192 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:08,142 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 176 flow [2025-04-29 11:08:08,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2025-04-29 11:08:08,150 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-04-29 11:08:08,150 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 176 flow [2025-04-29 11:08:08,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 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-04-29 11:08:08,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:08,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:08,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:08,152 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:08,152 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash -555851920, now seen corresponding path program 1 times [2025-04-29 11:08:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:08,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883210370] [2025-04-29 11:08:08,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:08,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:08,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:08:08,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:08:08,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:08,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:08,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:08,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:08,203 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883210370] [2025-04-29 11:08:08,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883210370] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:08,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:08,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:08,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5571450] [2025-04-29 11:08:08,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:08,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:08,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:08,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:08,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:08,217 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 92 [2025-04-29 11:08:08,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-04-29 11:08:08,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:08,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 92 [2025-04-29 11:08:08,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:08,252 INFO L116 PetriNetUnfolderBase]: 4/155 cut-off events. [2025-04-29 11:08:08,253 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:08:08,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 155 events. 4/155 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 311 event pairs, 4 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 152. Up to 15 conditions per place. [2025-04-29 11:08:08,254 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 7 selfloop transitions, 1 changer transitions 0/83 dead transitions. [2025-04-29 11:08:08,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 83 transitions, 188 flow [2025-04-29 11:08:08,254 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-04-29 11:08:08,257 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-04-29 11:08:08,257 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 176 flow. Second operand 3 states and 253 transitions. [2025-04-29 11:08:08,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 83 transitions, 188 flow [2025-04-29 11:08:08,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 83 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:08,261 INFO L231 Difference]: Finished difference. Result has 88 places, 83 transitions, 170 flow [2025-04-29 11:08:08,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=170, PETRI_PLACES=88, PETRI_TRANSITIONS=83} [2025-04-29 11:08:08,262 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -2 predicate places. [2025-04-29 11:08:08,263 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 83 transitions, 170 flow [2025-04-29 11:08:08,263 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 3 states have internal predecessors, (246), 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-04-29 11:08:08,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:08,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:08,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:08:08,264 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:08,264 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:08,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2129866237, now seen corresponding path program 1 times [2025-04-29 11:08:08,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:08,264 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813541547] [2025-04-29 11:08:08,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:08,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:08,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-29 11:08:08,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-29 11:08:08,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:08,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:08,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:08,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:08,310 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813541547] [2025-04-29 11:08:08,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813541547] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:08,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:08,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:08,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954065673] [2025-04-29 11:08:08,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:08,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:08,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:08,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:08,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:08,326 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 92 [2025-04-29 11:08:08,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 83 transitions, 170 flow. Second operand has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-04-29 11:08:08,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:08,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 92 [2025-04-29 11:08:08,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:08,348 INFO L116 PetriNetUnfolderBase]: 0/82 cut-off events. [2025-04-29 11:08:08,348 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:08,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2025-04-29 11:08:08,349 INFO L140 encePairwiseOnDemand]: 89/92 looper letters, 7 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-04-29 11:08:08,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 82 transitions, 186 flow [2025-04-29 11:08:08,349 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:08,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:08,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-04-29 11:08:08,350 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9057971014492754 [2025-04-29 11:08:08,350 INFO L175 Difference]: Start difference. First operand has 88 places, 83 transitions, 170 flow. Second operand 3 states and 250 transitions. [2025-04-29 11:08:08,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 82 transitions, 186 flow [2025-04-29 11:08:08,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 82 transitions, 185 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:08,352 INFO L231 Difference]: Finished difference. Result has 88 places, 82 transitions, 171 flow [2025-04-29 11:08:08,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=88, PETRI_TRANSITIONS=82} [2025-04-29 11:08:08,356 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -2 predicate places. [2025-04-29 11:08:08,357 INFO L485 AbstractCegarLoop]: Abstraction has has 88 places, 82 transitions, 171 flow [2025-04-29 11:08:08,357 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.33333333333333) internal successors, (244), 3 states have internal predecessors, (244), 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-04-29 11:08:08,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:08,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:08,357 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:08,357 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:08,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:08,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1466791810, now seen corresponding path program 1 times [2025-04-29 11:08:08,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:08,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970874052] [2025-04-29 11:08:08,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:08,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:08,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:08:08,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:08:08,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:08,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:08,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:08,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:08,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970874052] [2025-04-29 11:08:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970874052] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:08,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:08,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:08:08,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302184485] [2025-04-29 11:08:08,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:08,393 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:08,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:08,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:08,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:08,402 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 92 [2025-04-29 11:08:08,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 82 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-04-29 11:08:08,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:08,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 92 [2025-04-29 11:08:08,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:08,444 INFO L116 PetriNetUnfolderBase]: 0/81 cut-off events. [2025-04-29 11:08:08,445 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:08,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 81 events. 0/81 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2025-04-29 11:08:08,445 INFO L140 encePairwiseOnDemand]: 90/92 looper letters, 5 selfloop transitions, 1 changer transitions 0/81 dead transitions. [2025-04-29 11:08:08,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 81 transitions, 181 flow [2025-04-29 11:08:08,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:08,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:08,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-04-29 11:08:08,446 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9384057971014492 [2025-04-29 11:08:08,446 INFO L175 Difference]: Start difference. First operand has 88 places, 82 transitions, 171 flow. Second operand 3 states and 259 transitions. [2025-04-29 11:08:08,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 81 transitions, 181 flow [2025-04-29 11:08:08,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 81 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:08,448 INFO L231 Difference]: Finished difference. Result has 87 places, 81 transitions, 167 flow [2025-04-29 11:08:08,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=87, PETRI_TRANSITIONS=81} [2025-04-29 11:08:08,448 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -3 predicate places. [2025-04-29 11:08:08,449 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 81 transitions, 167 flow [2025-04-29 11:08:08,449 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 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-04-29 11:08:08,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:08,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:08,449 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:08,449 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:08,450 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:08,450 INFO L85 PathProgramCache]: Analyzing trace with hash 126680934, now seen corresponding path program 1 times [2025-04-29 11:08:08,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:08,450 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226382841] [2025-04-29 11:08:08,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:08,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:08,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:08,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:08,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:08,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:08,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:08,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:08,835 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226382841] [2025-04-29 11:08:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226382841] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247176723] [2025-04-29 11:08:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:08,835 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:08,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:08,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:08,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:08,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2025-04-29 11:08:08,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 81 transitions, 167 flow. Second operand has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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-04-29 11:08:08,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:08,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2025-04-29 11:08:08,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:09,048 INFO L116 PetriNetUnfolderBase]: 84/379 cut-off events. [2025-04-29 11:08:09,048 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:09,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 580 conditions, 379 events. 84/379 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1656 event pairs, 31 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 555. Up to 144 conditions per place. [2025-04-29 11:08:09,050 INFO L140 encePairwiseOnDemand]: 81/92 looper letters, 27 selfloop transitions, 22 changer transitions 0/110 dead transitions. [2025-04-29 11:08:09,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 110 transitions, 323 flow [2025-04-29 11:08:09,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:09,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:09,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2025-04-29 11:08:09,051 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8623188405797102 [2025-04-29 11:08:09,051 INFO L175 Difference]: Start difference. First operand has 87 places, 81 transitions, 167 flow. Second operand 6 states and 476 transitions. [2025-04-29 11:08:09,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 110 transitions, 323 flow [2025-04-29 11:08:09,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 110 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:09,054 INFO L231 Difference]: Finished difference. Result has 96 places, 102 transitions, 316 flow [2025-04-29 11:08:09,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=316, PETRI_PLACES=96, PETRI_TRANSITIONS=102} [2025-04-29 11:08:09,054 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 6 predicate places. [2025-04-29 11:08:09,055 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 102 transitions, 316 flow [2025-04-29 11:08:09,055 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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-04-29 11:08:09,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:09,055 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] [2025-04-29 11:08:09,055 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:09,055 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:09,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash -969257082, now seen corresponding path program 1 times [2025-04-29 11:08:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:09,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310793947] [2025-04-29 11:08:09,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:09,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:08:09,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:08:09,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:09,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:09,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:09,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:09,255 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310793947] [2025-04-29 11:08:09,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310793947] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:09,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:09,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:09,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866430109] [2025-04-29 11:08:09,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:09,256 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:09,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:09,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:09,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:09,376 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 92 [2025-04-29 11:08:09,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 102 transitions, 316 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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-04-29 11:08:09,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:09,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 92 [2025-04-29 11:08:09,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:09,462 INFO L116 PetriNetUnfolderBase]: 97/435 cut-off events. [2025-04-29 11:08:09,463 INFO L117 PetriNetUnfolderBase]: For 126/131 co-relation queries the response was YES. [2025-04-29 11:08:09,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 826 conditions, 435 events. 97/435 cut-off events. For 126/131 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2208 event pairs, 28 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 798. Up to 180 conditions per place. [2025-04-29 11:08:09,467 INFO L140 encePairwiseOnDemand]: 81/92 looper letters, 32 selfloop transitions, 26 changer transitions 0/123 dead transitions. [2025-04-29 11:08:09,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 492 flow [2025-04-29 11:08:09,467 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:09,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:09,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 468 transitions. [2025-04-29 11:08:09,468 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8478260869565217 [2025-04-29 11:08:09,468 INFO L175 Difference]: Start difference. First operand has 96 places, 102 transitions, 316 flow. Second operand 6 states and 468 transitions. [2025-04-29 11:08:09,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 492 flow [2025-04-29 11:08:09,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 123 transitions, 492 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:09,473 INFO L231 Difference]: Finished difference. Result has 106 places, 123 transitions, 500 flow [2025-04-29 11:08:09,474 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=500, PETRI_PLACES=106, PETRI_TRANSITIONS=123} [2025-04-29 11:08:09,475 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 16 predicate places. [2025-04-29 11:08:09,475 INFO L485 AbstractCegarLoop]: Abstraction has has 106 places, 123 transitions, 500 flow [2025-04-29 11:08:09,475 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 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-04-29 11:08:09,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:09,476 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:09,476 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:08:09,476 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:09,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash -330156818, now seen corresponding path program 1 times [2025-04-29 11:08:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:09,477 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566688737] [2025-04-29 11:08:09,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:09,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:09,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:08:09,491 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:08:09,491 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:09,491 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:09,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:09,677 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566688737] [2025-04-29 11:08:09,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566688737] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:09,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:09,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241558350] [2025-04-29 11:08:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:09,678 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:09,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:09,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:09,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:09,758 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 92 [2025-04-29 11:08:09,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 123 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-04-29 11:08:09,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:09,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 92 [2025-04-29 11:08:09,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:09,944 INFO L116 PetriNetUnfolderBase]: 232/770 cut-off events. [2025-04-29 11:08:09,945 INFO L117 PetriNetUnfolderBase]: For 475/490 co-relation queries the response was YES. [2025-04-29 11:08:09,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1922 conditions, 770 events. 232/770 cut-off events. For 475/490 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4430 event pairs, 51 based on Foata normal form. 1/730 useless extension candidates. Maximal degree in co-relation 1887. Up to 406 conditions per place. [2025-04-29 11:08:09,949 INFO L140 encePairwiseOnDemand]: 77/92 looper letters, 66 selfloop transitions, 53 changer transitions 4/178 dead transitions. [2025-04-29 11:08:09,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 178 transitions, 990 flow [2025-04-29 11:08:09,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 451 transitions. [2025-04-29 11:08:09,952 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8170289855072463 [2025-04-29 11:08:09,952 INFO L175 Difference]: Start difference. First operand has 106 places, 123 transitions, 500 flow. Second operand 6 states and 451 transitions. [2025-04-29 11:08:09,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 178 transitions, 990 flow [2025-04-29 11:08:09,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 178 transitions, 990 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:09,961 INFO L231 Difference]: Finished difference. Result has 116 places, 170 transitions, 982 flow [2025-04-29 11:08:09,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=982, PETRI_PLACES=116, PETRI_TRANSITIONS=170} [2025-04-29 11:08:09,961 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 26 predicate places. [2025-04-29 11:08:09,962 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 170 transitions, 982 flow [2025-04-29 11:08:09,962 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 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-04-29 11:08:09,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:09,962 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:09,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:08:09,962 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:09,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:09,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1748428555, now seen corresponding path program 1 times [2025-04-29 11:08:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:09,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522613731] [2025-04-29 11:08:09,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:09,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:09,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:08:09,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:08:09,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:09,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:10,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:10,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:10,194 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522613731] [2025-04-29 11:08:10,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522613731] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:10,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:10,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:10,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449369055] [2025-04-29 11:08:10,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:10,195 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:10,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:10,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:10,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:10,279 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 92 [2025-04-29 11:08:10,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 170 transitions, 982 flow. Second operand has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-04-29 11:08:10,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:10,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 92 [2025-04-29 11:08:10,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:10,507 INFO L116 PetriNetUnfolderBase]: 315/1003 cut-off events. [2025-04-29 11:08:10,507 INFO L117 PetriNetUnfolderBase]: For 1375/1405 co-relation queries the response was YES. [2025-04-29 11:08:10,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3060 conditions, 1003 events. 315/1003 cut-off events. For 1375/1405 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6205 event pairs, 57 based on Foata normal form. 3/974 useless extension candidates. Maximal degree in co-relation 3022. Up to 531 conditions per place. [2025-04-29 11:08:10,517 INFO L140 encePairwiseOnDemand]: 77/92 looper letters, 98 selfloop transitions, 61 changer transitions 6/223 dead transitions. [2025-04-29 11:08:10,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 223 transitions, 1642 flow [2025-04-29 11:08:10,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:10,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:10,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 454 transitions. [2025-04-29 11:08:10,519 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.822463768115942 [2025-04-29 11:08:10,519 INFO L175 Difference]: Start difference. First operand has 116 places, 170 transitions, 982 flow. Second operand 6 states and 454 transitions. [2025-04-29 11:08:10,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 223 transitions, 1642 flow [2025-04-29 11:08:10,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 223 transitions, 1578 flow, removed 32 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:10,533 INFO L231 Difference]: Finished difference. Result has 126 places, 217 transitions, 1504 flow [2025-04-29 11:08:10,533 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=92, PETRI_DIFFERENCE_MINUEND_FLOW=924, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1504, PETRI_PLACES=126, PETRI_TRANSITIONS=217} [2025-04-29 11:08:10,534 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 36 predicate places. [2025-04-29 11:08:10,534 INFO L485 AbstractCegarLoop]: Abstraction has has 126 places, 217 transitions, 1504 flow [2025-04-29 11:08:10,534 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.5) internal successors, (405), 6 states have internal predecessors, (405), 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-04-29 11:08:10,534 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:10,534 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:10,534 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:08:10,534 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-04-29 11:08:10,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:10,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1960103907, now seen corresponding path program 1 times [2025-04-29 11:08:10,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:10,535 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287736620] [2025-04-29 11:08:10,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:10,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:08:10,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:10,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:10,557 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:10,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:08:10,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:08:10,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:10,588 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:10,588 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:10,589 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-04-29 11:08:10,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-04-29 11:08:10,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-04-29 11:08:10,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-04-29 11:08:10,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-04-29 11:08:10,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-04-29 11:08:10,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-04-29 11:08:10,590 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2025-04-29 11:08:10,591 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-04-29 11:08:10,591 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-04-29 11:08:10,592 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-04-29 11:08:10,592 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-04-29 11:08:10,592 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-04-29 11:08:10,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:08:10,592 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:10,650 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:10,650 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:10,657 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:10 BasicIcfg [2025-04-29 11:08:10,657 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:10,658 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:10,658 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:10,658 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:10,659 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:07" (3/4) ... [2025-04-29 11:08:10,659 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:10,719 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-29 11:08:10,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:10,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:10,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:10,747 INFO L158 Benchmark]: Toolchain (without parser) took 3612.87ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 124.6MB in the beginning and 259.8MB in the end (delta: -135.2MB). Peak memory consumption was 102.1MB. Max. memory is 16.1GB. [2025-04-29 11:08:10,747 INFO L158 Benchmark]: CDTParser took 1.54ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:10,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.06ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 110.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:10,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.54ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 109.0MB in the end (delta: 961.9kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:10,747 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:10,747 INFO L158 Benchmark]: RCFGBuilder took 275.82ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 92.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:10,747 INFO L158 Benchmark]: TraceAbstraction took 2941.77ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 91.3MB in the beginning and 268.2MB in the end (delta: -176.9MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2025-04-29 11:08:10,748 INFO L158 Benchmark]: Witness Printer took 88.18ms. Allocated memory is still 402.7MB. Free memory was 268.2MB in the beginning and 259.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:10,751 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.54ms. Allocated memory is still 201.3MB. Free memory is still 117.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.06ms. Allocated memory is still 167.8MB. Free memory was 124.6MB in the beginning and 110.0MB in the end (delta: 14.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.54ms. Allocated memory is still 167.8MB. Free memory was 110.0MB in the beginning and 109.0MB in the end (delta: 961.9kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 167.8MB. Free memory was 109.0MB in the beginning and 107.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 275.82ms. Allocated memory is still 167.8MB. Free memory was 107.1MB in the beginning and 92.3MB in the end (delta: 14.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2941.77ms. Allocated memory was 167.8MB in the beginning and 402.7MB in the end (delta: 234.9MB). Free memory was 91.3MB in the beginning and 268.2MB in the end (delta: -176.9MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. * Witness Printer took 88.18ms. Allocated memory is still 402.7MB. Free memory was 268.2MB in the beginning and 259.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 17]: Data race detected Data race detected The following path leads to a data race: [L10] 0 int g; VAL [g={1:0}] [L11] 0 int *g1; VAL [g1={0:0}, g={1:0}] [L12] 0 int *g2; VAL [g1={0:0}, g2={0:0}, g={1:0}] [L13] 0 pthread_mutex_t mutex = PTHREAD_MUTEX_INITIALIZER; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L23] 0 pthread_t id; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L24] 0 int x; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L25] EXPR 0 g2 = &g VAL [g1={0:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L25] 0 g1 = g2 = &g VAL [g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L27] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L29] EXPR 0 *g2 VAL [\at(arg, Pre)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L29] EXPR 0 \read(*g2) VAL [\at(arg, Pre)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L29] 0 (*g2)++ VAL [\at(arg, Pre)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L17] EXPR 1 *g1 VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L17] EXPR 1 \read(*g1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L17] 1 (*g1)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L29] 0 (*g2)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L17] 1 (*g1)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L29] 0 (*g2)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L17] 1 (*g1)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L29] 0 (*g2)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L17] 1 (*g1)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L29] 0 (*g2)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L17] 1 (*g1)++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: (*g2)++ [29] * C: g2 = &g [25] * C: g1 = g2 = &g [25] and C: (*g1)++ [17] - UnprovableResult [Line: 25]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 25]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 27]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 124 locations, 123 edges, 13 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: 2.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 305 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 745 IncrementalHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 8 mSDtfsCounter, 745 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1504occurred in iteration=8, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 330 NumberOfCodeBlocks, 330 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 267 ConstructedInterpolants, 0 QuantifiedInterpolants, 599 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 RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:08:10,764 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)