./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init-race.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/pthread-race-challenges/per-thread-array-init-race.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 e14e099abbc01826e441f1a8304ff4c0bd38573f3bace86fc88236ce3208de57 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:10:38,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:10:38,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:10:38,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:10:38,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:10:39,013 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:10:39,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:10:39,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:10:39,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:10:39,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:10:39,015 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:10:39,015 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:10:39,015 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:10:39,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:10:39,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:10:39,017 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:10:39,017 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:10:39,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:10:39,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:39,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:39,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:39,017 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:10:39,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:10:39,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:39,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:10:39,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:10:39,018 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 -> e14e099abbc01826e441f1a8304ff4c0bd38573f3bace86fc88236ce3208de57 [2025-04-29 11:10:39,240 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:10:39,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:10:39,250 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:10:39,250 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:10:39,250 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:10:39,251 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init-race.c [2025-04-29 11:10:40,548 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f5c3776/c340f49b707f44fcb45cb3f25e6752c3/FLAGb32ae7ff0 [2025-04-29 11:10:40,750 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:10:40,755 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/per-thread-array-init-race.c [2025-04-29 11:10:40,757 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:40,758 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:10:40,770 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f5c3776/c340f49b707f44fcb45cb3f25e6752c3/FLAGb32ae7ff0 [2025-04-29 11:10:41,549 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/26f5c3776/c340f49b707f44fcb45cb3f25e6752c3 [2025-04-29 11:10:41,551 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:10:41,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:10:41,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:41,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:10:41,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:10:41,556 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,557 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc49576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41, skipping insertion in model container [2025-04-29 11:10:41,557 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,567 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:10:41,726 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:41,738 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:10:41,761 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:10:41,780 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:10:41,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41 WrapperNode [2025-04-29 11:10:41,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:10:41,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:41,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:10:41,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:10:41,789 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:10:41" (1/1) ... [2025-04-29 11:10:41,802 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:10:41" (1/1) ... [2025-04-29 11:10:41,821 INFO L138 Inliner]: procedures = 12, calls = 13, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2025-04-29 11:10:41,823 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:10:41,824 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:10:41,824 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:10:41,824 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:10:41,829 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,838 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,843 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,851 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,852 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,858 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:10:41,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:10:41,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:10:41,859 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:10:41,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (1/1) ... [2025-04-29 11:10:41,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:10:41,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:10:41,885 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:10:41,887 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:10:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:10:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:10:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:10:41,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:10:41,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:10:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:10:41,904 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:10:41,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:10:41,904 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:10:41,963 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:10:41,965 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:10:42,141 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:10:42,141 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:10:42,153 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:10:42,157 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:10:42,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:42 BoogieIcfgContainer [2025-04-29 11:10:42,157 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:10:42,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:10:42,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:10:42,166 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:10:42,166 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:10:41" (1/3) ... [2025-04-29 11:10:42,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37df84be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:42, skipping insertion in model container [2025-04-29 11:10:42,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:10:41" (2/3) ... [2025-04-29 11:10:42,167 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37df84be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:10:42, skipping insertion in model container [2025-04-29 11:10:42,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:42" (3/3) ... [2025-04-29 11:10:42,168 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-array-init-race.c [2025-04-29 11:10:42,189 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:10:42,194 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-array-init-race.c that has 2 procedures, 89 locations, 90 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-29 11:10:42,197 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:10:42,268 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:10:42,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 91 transitions, 189 flow [2025-04-29 11:10:42,351 INFO L116 PetriNetUnfolderBase]: 2/121 cut-off events. [2025-04-29 11:10:42,353 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:10:42,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 121 events. 2/121 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 152 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 56. Up to 3 conditions per place. [2025-04-29 11:10:42,355 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 91 transitions, 189 flow [2025-04-29 11:10:42,359 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 92 places, 91 transitions, 189 flow [2025-04-29 11:10:42,364 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:10:42,372 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;@603ea1e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:10:42,372 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:10:42,386 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:10:42,386 INFO L116 PetriNetUnfolderBase]: 1/51 cut-off events. [2025-04-29 11:10:42,386 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:10:42,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:42,388 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] [2025-04-29 11:10:42,388 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:42,392 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:42,394 INFO L85 PathProgramCache]: Analyzing trace with hash -33807218, now seen corresponding path program 1 times [2025-04-29 11:10:42,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:42,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097792915] [2025-04-29 11:10:42,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:42,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:42,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:42,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:42,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:42,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:42,714 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:10:42,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:42,715 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097792915] [2025-04-29 11:10:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097792915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:42,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092549788] [2025-04-29 11:10:42,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:42,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:10:42,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:42,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:10:42,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:10:42,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 91 [2025-04-29 11:10:42,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 91 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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:10:42,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:42,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 91 [2025-04-29 11:10:42,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:42,954 INFO L116 PetriNetUnfolderBase]: 1/127 cut-off events. [2025-04-29 11:10:42,957 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:10:42,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 127 events. 1/127 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 2/122 useless extension candidates. Maximal degree in co-relation 23. Up to 16 conditions per place. [2025-04-29 11:10:42,960 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 11 selfloop transitions, 2 changer transitions 6/95 dead transitions. [2025-04-29 11:10:42,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 95 transitions, 233 flow [2025-04-29 11:10:42,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:42,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 482 transitions. [2025-04-29 11:10:42,974 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8827838827838828 [2025-04-29 11:10:42,976 INFO L175 Difference]: Start difference. First operand has 92 places, 91 transitions, 189 flow. Second operand 6 states and 482 transitions. [2025-04-29 11:10:42,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 95 transitions, 233 flow [2025-04-29 11:10:42,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 95 transitions, 233 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:42,988 INFO L231 Difference]: Finished difference. Result has 101 places, 89 transitions, 203 flow [2025-04-29 11:10:42,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=203, PETRI_PLACES=101, PETRI_TRANSITIONS=89} [2025-04-29 11:10:42,993 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 9 predicate places. [2025-04-29 11:10:42,994 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 89 transitions, 203 flow [2025-04-29 11:10:42,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 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:10:42,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:42,995 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] [2025-04-29 11:10:42,996 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:10:42,996 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:42,997 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:42,997 INFO L85 PathProgramCache]: Analyzing trace with hash 702020375, now seen corresponding path program 1 times [2025-04-29 11:10:42,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:42,998 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300621228] [2025-04-29 11:10:42,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:42,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:10:43,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:10:43,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:43,450 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:10:43,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:43,450 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300621228] [2025-04-29 11:10:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300621228] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:43,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:43,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:43,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281411005] [2025-04-29 11:10:43,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:43,451 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:43,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:43,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:43,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:43,604 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 91 [2025-04-29 11:10:43,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 89 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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:10:43,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:43,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 91 [2025-04-29 11:10:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:43,763 INFO L116 PetriNetUnfolderBase]: 86/436 cut-off events. [2025-04-29 11:10:43,763 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-29 11:10:43,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711 conditions, 436 events. 86/436 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2072 event pairs, 51 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 619. Up to 186 conditions per place. [2025-04-29 11:10:43,768 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 27 selfloop transitions, 22 changer transitions 0/110 dead transitions. [2025-04-29 11:10:43,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 110 transitions, 343 flow [2025-04-29 11:10:43,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:43,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:43,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 422 transitions. [2025-04-29 11:10:43,774 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7728937728937729 [2025-04-29 11:10:43,774 INFO L175 Difference]: Start difference. First operand has 101 places, 89 transitions, 203 flow. Second operand 6 states and 422 transitions. [2025-04-29 11:10:43,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 110 transitions, 343 flow [2025-04-29 11:10:43,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 110 transitions, 329 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-04-29 11:10:43,779 INFO L231 Difference]: Finished difference. Result has 102 places, 110 transitions, 339 flow [2025-04-29 11:10:43,780 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=339, PETRI_PLACES=102, PETRI_TRANSITIONS=110} [2025-04-29 11:10:43,780 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 10 predicate places. [2025-04-29 11:10:43,780 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 110 transitions, 339 flow [2025-04-29 11:10:43,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 63.5) internal successors, (381), 6 states have internal predecessors, (381), 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:10:43,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:43,781 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:10:43,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:10:43,782 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:43,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:43,782 INFO L85 PathProgramCache]: Analyzing trace with hash -387151555, now seen corresponding path program 1 times [2025-04-29 11:10:43,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:43,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704174339] [2025-04-29 11:10:43,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:43,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:43,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:10:43,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:10:43,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:43,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,068 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:10:44,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,069 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704174339] [2025-04-29 11:10:44,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704174339] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054446037] [2025-04-29 11:10:44,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,070 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:44,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:44,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:44,171 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2025-04-29 11:10:44,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 110 transitions, 339 flow. Second operand has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 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:10:44,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2025-04-29 11:10:44,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,330 INFO L116 PetriNetUnfolderBase]: 106/639 cut-off events. [2025-04-29 11:10:44,330 INFO L117 PetriNetUnfolderBase]: For 143/174 co-relation queries the response was YES. [2025-04-29 11:10:44,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 639 events. 106/639 cut-off events. For 143/174 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3704 event pairs, 12 based on Foata normal form. 4/602 useless extension candidates. Maximal degree in co-relation 1071. Up to 186 conditions per place. [2025-04-29 11:10:44,337 INFO L140 encePairwiseOnDemand]: 77/91 looper letters, 32 selfloop transitions, 47 changer transitions 0/153 dead transitions. [2025-04-29 11:10:44,337 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 153 transitions, 656 flow [2025-04-29 11:10:44,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:44,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 493 transitions. [2025-04-29 11:10:44,339 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9029304029304029 [2025-04-29 11:10:44,339 INFO L175 Difference]: Start difference. First operand has 102 places, 110 transitions, 339 flow. Second operand 6 states and 493 transitions. [2025-04-29 11:10:44,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 153 transitions, 656 flow [2025-04-29 11:10:44,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 153 transitions, 656 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:44,345 INFO L231 Difference]: Finished difference. Result has 112 places, 152 transitions, 719 flow [2025-04-29 11:10:44,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=719, PETRI_PLACES=112, PETRI_TRANSITIONS=152} [2025-04-29 11:10:44,346 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 20 predicate places. [2025-04-29 11:10:44,346 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 152 transitions, 719 flow [2025-04-29 11:10:44,346 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.83333333333333) internal successors, (449), 6 states have internal predecessors, (449), 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:10:44,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,347 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] [2025-04-29 11:10:44,347 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:10:44,347 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:44,347 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,348 INFO L85 PathProgramCache]: Analyzing trace with hash -556593687, now seen corresponding path program 1 times [2025-04-29 11:10:44,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,348 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291442937] [2025-04-29 11:10:44,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:10:44,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:10:44,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:10:44,586 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:10:44,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:10:44,587 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291442937] [2025-04-29 11:10:44,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291442937] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:10:44,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:10:44,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:10:44,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204184162] [2025-04-29 11:10:44,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:10:44,587 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:10:44,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:10:44,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:10:44,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:10:44,688 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 91 [2025-04-29 11:10:44,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 152 transitions, 719 flow. Second operand has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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:10:44,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:10:44,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 91 [2025-04-29 11:10:44,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:10:44,812 INFO L116 PetriNetUnfolderBase]: 186/810 cut-off events. [2025-04-29 11:10:44,812 INFO L117 PetriNetUnfolderBase]: For 627/649 co-relation queries the response was YES. [2025-04-29 11:10:44,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2117 conditions, 810 events. 186/810 cut-off events. For 627/649 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4993 event pairs, 38 based on Foata normal form. 0/776 useless extension candidates. Maximal degree in co-relation 1976. Up to 391 conditions per place. [2025-04-29 11:10:44,818 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 83 selfloop transitions, 32 changer transitions 0/179 dead transitions. [2025-04-29 11:10:44,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 179 transitions, 1111 flow [2025-04-29 11:10:44,818 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:10:44,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:10:44,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 422 transitions. [2025-04-29 11:10:44,819 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7728937728937729 [2025-04-29 11:10:44,820 INFO L175 Difference]: Start difference. First operand has 112 places, 152 transitions, 719 flow. Second operand 6 states and 422 transitions. [2025-04-29 11:10:44,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 179 transitions, 1111 flow [2025-04-29 11:10:44,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 179 transitions, 1093 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-29 11:10:44,829 INFO L231 Difference]: Finished difference. Result has 122 places, 179 transitions, 1023 flow [2025-04-29 11:10:44,830 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=701, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1023, PETRI_PLACES=122, PETRI_TRANSITIONS=179} [2025-04-29 11:10:44,830 INFO L279 CegarLoopForPetriNet]: 92 programPoint places, 30 predicate places. [2025-04-29 11:10:44,830 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 179 transitions, 1023 flow [2025-04-29 11:10:44,831 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 64.33333333333333) internal successors, (386), 6 states have internal predecessors, (386), 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:10:44,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:10:44,831 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:10:44,831 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:10:44,831 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:10:44,832 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:10:44,832 INFO L85 PathProgramCache]: Analyzing trace with hash -604836732, now seen corresponding path program 1 times [2025-04-29 11:10:44,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:10:44,832 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020880510] [2025-04-29 11:10:44,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:10:44,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:10:44,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:44,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:44,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:44,859 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:10:44,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:10:44,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:10:44,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:10:44,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:10:44,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:10:44,897 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:10:44,897 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (5 of 6 remaining) [2025-04-29 11:10:44,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-29 11:10:44,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-29 11:10:44,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-29 11:10:44,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2025-04-29 11:10:44,900 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-29 11:10:44,900 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:10:44,901 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-04-29 11:10:44,940 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:10:44,941 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:10:44,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:10:44 BasicIcfg [2025-04-29 11:10:44,946 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:10:44,946 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:10:44,946 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:10:44,946 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:10:44,947 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:10:42" (3/4) ... [2025-04-29 11:10:44,948 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:10:44,988 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 5. [2025-04-29 11:10:45,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:10:45,022 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:10:45,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:10:45,023 INFO L158 Benchmark]: Toolchain (without parser) took 3471.53ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 112.4MB in the beginning and 149.4MB in the end (delta: -37.0MB). Peak memory consumption was 112.8MB. Max. memory is 16.1GB. [2025-04-29 11:10:45,024 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:10:45,024 INFO L158 Benchmark]: CACSL2BoogieTranslator took 228.35ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:10:45,024 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.57ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:10:45,024 INFO L158 Benchmark]: Boogie Preprocessor took 34.32ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.9MB in the end (delta: 890.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:10:45,024 INFO L158 Benchmark]: RCFGBuilder took 298.71ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 79.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:10:45,025 INFO L158 Benchmark]: TraceAbstraction took 2787.51ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 78.1MB in the beginning and 156.4MB in the end (delta: -78.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. [2025-04-29 11:10:45,025 INFO L158 Benchmark]: Witness Printer took 76.28ms. Allocated memory is still 293.6MB. Free memory was 156.4MB in the beginning and 149.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:10:45,029 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 127.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 228.35ms. Allocated memory is still 142.6MB. Free memory was 111.5MB in the beginning and 97.6MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.57ms. Allocated memory is still 142.6MB. Free memory was 97.6MB in the beginning and 95.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 34.32ms. Allocated memory is still 142.6MB. Free memory was 95.8MB in the beginning and 94.9MB in the end (delta: 890.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 298.71ms. Allocated memory is still 142.6MB. Free memory was 94.9MB in the beginning and 79.0MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2787.51ms. Allocated memory was 142.6MB in the beginning and 293.6MB in the end (delta: 151.0MB). Free memory was 78.1MB in the beginning and 156.4MB in the end (delta: -78.3MB). Peak memory consumption was 70.8MB. Max. memory is 16.1GB. * Witness Printer took 76.28ms. Allocated memory is still 293.6MB. Free memory was 156.4MB in the beginning and 149.4MB in the end (delta: 7.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 20]: Data race detected Data race detected The following path leads to a data race: [L25] 0 int threads_total = __VERIFIER_nondet_int(); VAL [threads_total=1] [L26] CALL 0 assume_abort_if_not(threads_total >= 0) [L14] COND FALSE 0 !(!cond) VAL [\at(cond, Pre)=1, cond=1] [L26] RET 0 assume_abort_if_not(threads_total >= 0) [L28] 0 pthread_t *tids = malloc(threads_total * sizeof(pthread_t)); VAL [threads_total=1, tids={-2:0}] [L29] EXPR, FCALL 0 calloc(threads_total, sizeof(int)) [L29] 0 int *is = calloc(threads_total, sizeof(int)); VAL [is={-3:0}, threads_total=1, tids={-2:0}] [L32] 0 int i = 0; VAL [i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L32] COND TRUE 0 i < threads_total [L33] 0 pthread_create(&tids[i], NULL, &thread, &is[i]) VAL [i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L33] FCALL, FORK 0 pthread_create(&tids[i], NULL, &thread, &is[i]) VAL [\at(arg, Pre)={-3:0}, i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L34] 0 is[i] = i VAL [\at(arg, Pre)={-3:0}, i=0, is={-3:0}, threads_total=1, tids={-2:0}] [L19] 1 int *p = arg; VAL [\at(arg, Pre)={-3:0}, arg={-3:0}, p={-3:0}] [L20] EXPR 1 \read(*p) VAL [\at(arg, Pre)={-3:0}, arg={-3:0}, p={-3:0}] [L20] 1 int i = *p; VAL [\at(arg, Pre)={-3:0}, arg={-3:0}, p={-3:0}] [L34] 0 is[i] = i VAL [\at(arg, Pre)={-3:0}, arg={-3:0}, i=0, is={-3:0}, p={-3:0}, threads_total=1, tids={-2:0}] [L20] 1 int i = *p; VAL [\at(arg, Pre)={-3:0}, arg={-3:0}, p={-3: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: is[i] = i [34] * C: pthread_create(&tids[i], NULL, &thread, &is[i]) [33] * C: pthread_create(&tids[i], NULL, &thread, &is[i]) [33] * C: pthread_create(&tids[i], NULL, &thread, &is[i]) [33] * C: pthread_create(&tids[i], NULL, &thread, &is[i]) [33] and C: int i = *p; [20] - UnprovableResult [Line: 39]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 33]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 33]: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 104 locations, 106 edges, 6 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.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 363 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 235 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 679 IncrementalHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 23 mSDtfsCounter, 679 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1023occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 205 NumberOfCodeBlocks, 205 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 475 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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:10:45,042 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)