./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_08-glob_fld_2_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/05-lval_ls_08-glob_fld_2_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 f42aa68b87f2b35193e6ff5d46d2fe0f91ded9a814a1ef0270a9838c89e0ea48 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:18,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:18,130 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:18,133 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:18,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:18,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:18,157 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:18,157 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:18,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:18,157 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:18,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:18,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:18,158 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:18,159 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:18,159 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:18,160 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:18,160 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:18,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:18,161 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:18,161 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:18,161 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 -> f42aa68b87f2b35193e6ff5d46d2fe0f91ded9a814a1ef0270a9838c89e0ea48 [2025-04-29 11:08:18,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:18,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:18,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:18,405 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:18,405 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:18,406 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/05-lval_ls_08-glob_fld_2_rc.c [2025-04-29 11:08:19,760 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4c79158/f226132aefd3423c9dee269bf0f5364e/FLAG69714532d [2025-04-29 11:08:19,940 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:19,941 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/05-lval_ls_08-glob_fld_2_rc.c [2025-04-29 11:08:19,944 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:19,949 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4c79158/f226132aefd3423c9dee269bf0f5364e/FLAG69714532d [2025-04-29 11:08:20,911 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e4c79158/f226132aefd3423c9dee269bf0f5364e [2025-04-29 11:08:20,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:20,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:20,914 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:20,914 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:20,918 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:20,921 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:20" (1/1) ... [2025-04-29 11:08:20,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@520115a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:20, skipping insertion in model container [2025-04-29 11:08:20,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:20" (1/1) ... [2025-04-29 11:08:20,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:21,076 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:21,082 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:21,113 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:21,129 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:21,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:21 WrapperNode [2025-04-29 11:08:21,130 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:21,131 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:21,131 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:21,131 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:21,135 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:21" (1/1) ... [2025-04-29 11:08:21,141 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:21" (1/1) ... [2025-04-29 11:08:21,157 INFO L138 Inliner]: procedures = 9, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2025-04-29 11:08:21,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:21,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:21,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:21,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:21,163 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:21" (1/1) ... [2025-04-29 11:08:21,164 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:21" (1/1) ... [2025-04-29 11:08:21,169 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:21" (1/1) ... [2025-04-29 11:08:21,169 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:21" (1/1) ... [2025-04-29 11:08:21,173 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:21" (1/1) ... [2025-04-29 11:08:21,175 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:21" (1/1) ... [2025-04-29 11:08:21,176 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:21" (1/1) ... [2025-04-29 11:08:21,179 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:21" (1/1) ... [2025-04-29 11:08:21,179 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:21" (1/1) ... [2025-04-29 11:08:21,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:21,186 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:21,186 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:21,186 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:21,187 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:21" (1/1) ... [2025-04-29 11:08:21,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:21,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:21,210 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:21,215 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:21,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:08:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:08:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:08:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:08:21,231 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:08:21,231 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:08:21,231 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:21,287 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:21,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:21,421 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:21,421 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:21,431 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:21,432 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:21,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:21 BoogieIcfgContainer [2025-04-29 11:08:21,432 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:21,434 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:21,434 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:21,437 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:21,437 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:20" (1/3) ... [2025-04-29 11:08:21,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d9daf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:21, skipping insertion in model container [2025-04-29 11:08:21,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:21" (2/3) ... [2025-04-29 11:08:21,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d9daf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:21, skipping insertion in model container [2025-04-29 11:08:21,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:21" (3/3) ... [2025-04-29 11:08:21,439 INFO L128 eAbstractionObserver]: Analyzing ICFG 05-lval_ls_08-glob_fld_2_rc.c [2025-04-29 11:08:21,449 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:21,451 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 05-lval_ls_08-glob_fld_2_rc.c that has 2 procedures, 69 locations, 67 edges, 1 initial locations, 0 loop locations, and 4 error locations. [2025-04-29 11:08:21,452 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:21,522 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:21,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 91 transitions, 190 flow [2025-04-29 11:08:21,604 INFO L116 PetriNetUnfolderBase]: 0/89 cut-off events. [2025-04-29 11:08:21,605 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:21,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96 conditions, 89 events. 0/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 135 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:08:21,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 91 transitions, 190 flow [2025-04-29 11:08:21,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 89 transitions, 184 flow [2025-04-29 11:08:21,620 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:21,633 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;@1add005f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:21,634 INFO L341 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-04-29 11:08:21,642 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:21,643 INFO L116 PetriNetUnfolderBase]: 0/28 cut-off events. [2025-04-29 11:08:21,643 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:21,643 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:21,644 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] [2025-04-29 11:08:21,644 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-29 11:08:21,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:21,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1849040290, now seen corresponding path program 1 times [2025-04-29 11:08:21,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:21,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210669614] [2025-04-29 11:08:21,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:21,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:21,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:08:21,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:08:21,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:21,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:22,184 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:22,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:22,185 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210669614] [2025-04-29 11:08:22,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210669614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:22,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:22,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:22,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789031801] [2025-04-29 11:08:22,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:22,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:22,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:22,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:22,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:22,497 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 91 [2025-04-29 11:08:22,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 89 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:22,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:22,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 91 [2025-04-29 11:08:22,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:22,775 INFO L116 PetriNetUnfolderBase]: 208/742 cut-off events. [2025-04-29 11:08:22,776 INFO L117 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-04-29 11:08:22,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1231 conditions, 742 events. 208/742 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4674 event pairs, 46 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 1209. Up to 194 conditions per place. [2025-04-29 11:08:22,786 INFO L140 encePairwiseOnDemand]: 69/91 looper letters, 73 selfloop transitions, 42 changer transitions 0/179 dead transitions. [2025-04-29 11:08:22,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 179 transitions, 606 flow [2025-04-29 11:08:22,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:22,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2025-04-29 11:08:22,798 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9395604395604396 [2025-04-29 11:08:22,799 INFO L175 Difference]: Start difference. First operand has 96 places, 89 transitions, 184 flow. Second operand 6 states and 513 transitions. [2025-04-29 11:08:22,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 179 transitions, 606 flow [2025-04-29 11:08:22,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 179 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:22,811 INFO L231 Difference]: Finished difference. Result has 104 places, 135 transitions, 498 flow [2025-04-29 11:08:22,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=104, PETRI_TRANSITIONS=135} [2025-04-29 11:08:22,815 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 8 predicate places. [2025-04-29 11:08:22,817 INFO L485 AbstractCegarLoop]: Abstraction has has 104 places, 135 transitions, 498 flow [2025-04-29 11:08:22,818 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:22,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:22,818 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] [2025-04-29 11:08:22,818 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:22,818 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-29 11:08:22,819 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:22,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1075224150, now seen corresponding path program 1 times [2025-04-29 11:08:22,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:22,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552805924] [2025-04-29 11:08:22,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:22,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:22,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-29 11:08:22,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-29 11:08:22,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:22,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:23,047 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:23,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:23,047 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552805924] [2025-04-29 11:08:23,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552805924] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:23,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:23,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:23,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437404216] [2025-04-29 11:08:23,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:23,048 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:23,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:23,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:23,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:23,267 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 91 [2025-04-29 11:08:23,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 135 transitions, 498 flow. Second operand has 6 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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:23,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:23,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 91 [2025-04-29 11:08:23,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:23,331 INFO L116 PetriNetUnfolderBase]: 114/565 cut-off events. [2025-04-29 11:08:23,332 INFO L117 PetriNetUnfolderBase]: For 98/119 co-relation queries the response was YES. [2025-04-29 11:08:23,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1075 conditions, 565 events. 114/565 cut-off events. For 98/119 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3650 event pairs, 24 based on Foata normal form. 3/555 useless extension candidates. Maximal degree in co-relation 1050. Up to 118 conditions per place. [2025-04-29 11:08:23,336 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 8 selfloop transitions, 5 changer transitions 0/134 dead transitions. [2025-04-29 11:08:23,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 134 transitions, 522 flow [2025-04-29 11:08:23,336 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:23,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 476 transitions. [2025-04-29 11:08:23,338 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8717948717948718 [2025-04-29 11:08:23,338 INFO L175 Difference]: Start difference. First operand has 104 places, 135 transitions, 498 flow. Second operand 6 states and 476 transitions. [2025-04-29 11:08:23,338 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 134 transitions, 522 flow [2025-04-29 11:08:23,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 134 transitions, 522 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:23,343 INFO L231 Difference]: Finished difference. Result has 108 places, 134 transitions, 506 flow [2025-04-29 11:08:23,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=506, PETRI_PLACES=108, PETRI_TRANSITIONS=134} [2025-04-29 11:08:23,343 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 12 predicate places. [2025-04-29 11:08:23,343 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 134 transitions, 506 flow [2025-04-29 11:08:23,344 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 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:23,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:23,344 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:23,344 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:08:23,344 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-29 11:08:23,345 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:23,345 INFO L85 PathProgramCache]: Analyzing trace with hash 115021223, now seen corresponding path program 1 times [2025-04-29 11:08:23,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:23,345 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729342614] [2025-04-29 11:08:23,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:23,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:23,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-29 11:08:23,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-29 11:08:23,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:23,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:23,550 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:23,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:23,552 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729342614] [2025-04-29 11:08:23,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729342614] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:23,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:23,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:23,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956356669] [2025-04-29 11:08:23,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:23,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:23,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:23,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:23,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:23,732 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2025-04-29 11:08:23,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 134 transitions, 506 flow. Second operand has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:23,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:23,733 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2025-04-29 11:08:23,733 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:23,951 INFO L116 PetriNetUnfolderBase]: 354/1090 cut-off events. [2025-04-29 11:08:23,952 INFO L117 PetriNetUnfolderBase]: For 526/559 co-relation queries the response was YES. [2025-04-29 11:08:23,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2829 conditions, 1090 events. 354/1090 cut-off events. For 526/559 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7224 event pairs, 71 based on Foata normal form. 21/1097 useless extension candidates. Maximal degree in co-relation 2803. Up to 491 conditions per place. [2025-04-29 11:08:23,965 INFO L140 encePairwiseOnDemand]: 74/91 looper letters, 98 selfloop transitions, 53 changer transitions 0/213 dead transitions. [2025-04-29 11:08:23,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 213 transitions, 1160 flow [2025-04-29 11:08:23,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 481 transitions. [2025-04-29 11:08:23,967 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8809523809523809 [2025-04-29 11:08:23,967 INFO L175 Difference]: Start difference. First operand has 108 places, 134 transitions, 506 flow. Second operand 6 states and 481 transitions. [2025-04-29 11:08:23,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 213 transitions, 1160 flow [2025-04-29 11:08:23,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 213 transitions, 1150 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:23,976 INFO L231 Difference]: Finished difference. Result has 113 places, 187 transitions, 1012 flow [2025-04-29 11:08:23,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1012, PETRI_PLACES=113, PETRI_TRANSITIONS=187} [2025-04-29 11:08:23,978 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 17 predicate places. [2025-04-29 11:08:23,978 INFO L485 AbstractCegarLoop]: Abstraction has has 113 places, 187 transitions, 1012 flow [2025-04-29 11:08:23,978 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.16666666666667) internal successors, (403), 6 states have internal predecessors, (403), 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:23,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:23,978 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:23,979 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:08:23,979 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-29 11:08:23,979 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:23,980 INFO L85 PathProgramCache]: Analyzing trace with hash -204228954, now seen corresponding path program 1 times [2025-04-29 11:08:23,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:23,980 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437299602] [2025-04-29 11:08:23,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:23,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:23,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:08:24,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:08:24,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:24,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:24,161 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:24,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:24,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437299602] [2025-04-29 11:08:24,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437299602] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:24,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:24,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:24,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678312483] [2025-04-29 11:08:24,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:24,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:24,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:24,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:24,341 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 91 [2025-04-29 11:08:24,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 187 transitions, 1012 flow. Second operand has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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:24,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:24,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 91 [2025-04-29 11:08:24,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:24,572 INFO L116 PetriNetUnfolderBase]: 478/1384 cut-off events. [2025-04-29 11:08:24,573 INFO L117 PetriNetUnfolderBase]: For 2033/2077 co-relation queries the response was YES. [2025-04-29 11:08:24,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4584 conditions, 1384 events. 478/1384 cut-off events. For 2033/2077 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 9571 event pairs, 83 based on Foata normal form. 23/1384 useless extension candidates. Maximal degree in co-relation 4554. Up to 661 conditions per place. [2025-04-29 11:08:24,590 INFO L140 encePairwiseOnDemand]: 74/91 looper letters, 139 selfloop transitions, 68 changer transitions 0/273 dead transitions. [2025-04-29 11:08:24,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 273 transitions, 1946 flow [2025-04-29 11:08:24,591 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:24,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:24,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions. [2025-04-29 11:08:24,592 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8736263736263736 [2025-04-29 11:08:24,592 INFO L175 Difference]: Start difference. First operand has 113 places, 187 transitions, 1012 flow. Second operand 6 states and 477 transitions. [2025-04-29 11:08:24,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 273 transitions, 1946 flow [2025-04-29 11:08:24,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 273 transitions, 1938 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:24,605 INFO L231 Difference]: Finished difference. Result has 123 places, 248 transitions, 1724 flow [2025-04-29 11:08:24,606 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1004, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1724, PETRI_PLACES=123, PETRI_TRANSITIONS=248} [2025-04-29 11:08:24,607 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 27 predicate places. [2025-04-29 11:08:24,607 INFO L485 AbstractCegarLoop]: Abstraction has has 123 places, 248 transitions, 1724 flow [2025-04-29 11:08:24,608 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 67.33333333333333) internal successors, (404), 6 states have internal predecessors, (404), 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:24,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:24,608 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] [2025-04-29 11:08:24,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:08:24,608 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-29 11:08:24,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:24,608 INFO L85 PathProgramCache]: Analyzing trace with hash -905531948, now seen corresponding path program 1 times [2025-04-29 11:08:24,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:24,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276280072] [2025-04-29 11:08:24,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:24,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:24,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:08:24,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:08:24,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:24,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:24,819 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:24,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:24,820 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276280072] [2025-04-29 11:08:24,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276280072] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:24,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:24,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:24,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414474844] [2025-04-29 11:08:24,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:24,820 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:08:24,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:24,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:08:24,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:25,049 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2025-04-29 11:08:25,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 248 transitions, 1724 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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:25,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:25,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2025-04-29 11:08:25,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:25,160 INFO L116 PetriNetUnfolderBase]: 343/1172 cut-off events. [2025-04-29 11:08:25,161 INFO L117 PetriNetUnfolderBase]: For 2391/2443 co-relation queries the response was YES. [2025-04-29 11:08:25,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3856 conditions, 1172 events. 343/1172 cut-off events. For 2391/2443 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8414 event pairs, 29 based on Foata normal form. 15/1174 useless extension candidates. Maximal degree in co-relation 3820. Up to 284 conditions per place. [2025-04-29 11:08:25,172 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 12 selfloop transitions, 5 changer transitions 36/247 dead transitions. [2025-04-29 11:08:25,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 247 transitions, 1756 flow [2025-04-29 11:08:25,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:08:25,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:08:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 456 transitions. [2025-04-29 11:08:25,177 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8351648351648352 [2025-04-29 11:08:25,177 INFO L175 Difference]: Start difference. First operand has 123 places, 248 transitions, 1724 flow. Second operand 6 states and 456 transitions. [2025-04-29 11:08:25,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 247 transitions, 1756 flow [2025-04-29 11:08:25,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 247 transitions, 1740 flow, removed 8 selfloop flow, removed 0 redundant places. [2025-04-29 11:08:25,195 INFO L231 Difference]: Finished difference. Result has 127 places, 211 transitions, 1420 flow [2025-04-29 11:08:25,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1706, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=247, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=242, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1420, PETRI_PLACES=127, PETRI_TRANSITIONS=211} [2025-04-29 11:08:25,196 INFO L279 CegarLoopForPetriNet]: 96 programPoint places, 31 predicate places. [2025-04-29 11:08:25,197 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 211 transitions, 1420 flow [2025-04-29 11:08:25,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 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:25,197 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:25,198 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:25,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:08:25,198 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 7 more)] === [2025-04-29 11:08:25,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:25,200 INFO L85 PathProgramCache]: Analyzing trace with hash -165107083, now seen corresponding path program 1 times [2025-04-29 11:08:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:25,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715070639] [2025-04-29 11:08:25,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:25,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:25,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:08:25,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:08:25,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:25,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:25,218 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:25,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:08:25,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:08:25,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:25,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:25,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:25,240 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:25,241 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-04-29 11:08:25,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-04-29 11:08:25,242 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:08:25,242 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:08:25,275 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:25,275 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:25,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:25 BasicIcfg [2025-04-29 11:08:25,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:25,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:25,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:25,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:25,282 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:21" (3/4) ... [2025-04-29 11:08:25,282 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:25,321 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-29 11:08:25,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:25,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:25,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:25,349 INFO L158 Benchmark]: Toolchain (without parser) took 4435.74ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 107.8MB in the beginning and 64.7MB in the end (delta: 43.1MB). Peak memory consumption was 72.3MB. Max. memory is 16.1GB. [2025-04-29 11:08:25,349 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:25,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.94ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 94.0MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:25,351 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.32ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:25,351 INFO L158 Benchmark]: Boogie Preprocessor took 27.01ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 91.2MB in the end (delta: 925.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:25,351 INFO L158 Benchmark]: RCFGBuilder took 246.18ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 77.7MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:25,352 INFO L158 Benchmark]: TraceAbstraction took 3846.47ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.2MB in the beginning and 72.0MB in the end (delta: 5.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:25,352 INFO L158 Benchmark]: Witness Printer took 67.91ms. Allocated memory is still 176.2MB. Free memory was 72.0MB in the beginning and 64.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:25,354 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.86ms. Allocated memory is still 201.3MB. Free memory is still 127.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.94ms. Allocated memory is still 142.6MB. Free memory was 107.8MB in the beginning and 94.0MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.32ms. Allocated memory is still 142.6MB. Free memory was 94.0MB in the beginning and 92.1MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.01ms. Allocated memory is still 142.6MB. Free memory was 92.1MB in the beginning and 91.2MB in the end (delta: 925.7kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 246.18ms. Allocated memory is still 142.6MB. Free memory was 91.2MB in the beginning and 77.7MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3846.47ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 77.2MB in the beginning and 72.0MB in the end (delta: 5.2MB). Peak memory consumption was 38.8MB. Max. memory is 16.1GB. * Witness Printer took 67.91ms. Allocated memory is still 176.2MB. Free memory was 72.0MB in the beginning and 64.7MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 16]: Data race detected Data race detected The following path leads to a data race: [L10-L13] 0 struct { int x; int y; } data; VAL [data={1:0}] [L21] 0 pthread_t id, id2; VAL [data={1:0}] [L22] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, data={1:0}, id=-1] [L16] EXPR 1 data.x VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] [L16] 1 data.x++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] [L23] FCALL, FORK 0 pthread_create(&id2, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}, id2=0, id=-1] [L16] EXPR 2 data.x VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] [L16] 2 data.x++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, data={1:0}] Now there is a data race (on the heap) between C: data.x++ [16] and C: data.x++ [16] - UnprovableResult [Line: 24]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 22]: 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: 23]: 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: 16]: 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 4 procedures, 117 locations, 115 edges, 10 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 664 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 359 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1489 IncrementalHoareTripleChecker+Invalid, 1848 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 359 mSolverCounterUnsat, 9 mSDtfsCounter, 1489 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1724occurred in iteration=4, InterpolantAutomatonStates: 30, 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.2s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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:25,367 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)