./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/06-symbeq_11-equ_nr.i --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/06-symbeq_11-equ_nr.i -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 071be118cd0932d66afa6bce30fcab76880adc6e53d2ca540223cce2e13054f4 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:26:42,202 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:26:42,247 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:26:42,250 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:26:42,252 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:26:42,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:26:42,274 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:26:42,274 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:26:42,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:26:42,275 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:26:42,275 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:26:42,276 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:26:42,276 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:26:42,276 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:26:42,276 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:26:42,276 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:26:42,277 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:26:42,278 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:26:42,278 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:26:42,278 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:26:42,278 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:42,278 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:42,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:42,279 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:42,279 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:26:42,279 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:26:42,280 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 -> 071be118cd0932d66afa6bce30fcab76880adc6e53d2ca540223cce2e13054f4 [2025-04-30 10:26:42,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:26:42,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:26:42,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:26:42,476 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:26:42,476 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:26:42,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/06-symbeq_11-equ_nr.i [2025-04-30 10:26:43,751 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1287da1bb/a2e45818a2d14079ae1a942d8f2c6f61/FLAG295065a87 [2025-04-30 10:26:43,984 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:26:43,984 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/06-symbeq_11-equ_nr.i [2025-04-30 10:26:44,000 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1287da1bb/a2e45818a2d14079ae1a942d8f2c6f61/FLAG295065a87 [2025-04-30 10:26:44,753 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1287da1bb/a2e45818a2d14079ae1a942d8f2c6f61 [2025-04-30 10:26:44,755 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:26:44,756 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:26:44,757 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:44,757 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:26:44,760 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:26:44,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,761 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1909019d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:44, skipping insertion in model container [2025-04-30 10:26:44,761 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:26:44" (1/1) ... [2025-04-30 10:26:44,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:26:45,096 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:45,108 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:26:45,146 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:26:45,190 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:26:45,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45 WrapperNode [2025-04-30 10:26:45,191 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:26:45,192 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:45,192 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:26:45,192 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:26:45,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,233 INFO L138 Inliner]: procedures = 265, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2025-04-30 10:26:45,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:26:45,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:26:45,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:26:45,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:26:45,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,241 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,241 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,245 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,250 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,256 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:26:45,261 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:26:45,261 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:26:45,261 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:26:45,262 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (1/1) ... [2025-04-30 10:26:45,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:26:45,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:26:45,297 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-30 10:26:45,303 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-30 10:26:45,317 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:26:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-30 10:26:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:26:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:26:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:26:45,318 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:26:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:26:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:26:45,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:26:45,319 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:26:45,392 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:26:45,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:26:45,533 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:26:45,533 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:26:45,549 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:26:45,549 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:26:45,549 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:45 BoogieIcfgContainer [2025-04-30 10:26:45,549 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:26:45,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:26:45,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:26:45,555 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:26:45,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:26:44" (1/3) ... [2025-04-30 10:26:45,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f50f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:45, skipping insertion in model container [2025-04-30 10:26:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:26:45" (2/3) ... [2025-04-30 10:26:45,556 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11f50f1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:26:45, skipping insertion in model container [2025-04-30 10:26:45,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:45" (3/3) ... [2025-04-30 10:26:45,557 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_11-equ_nr.i [2025-04-30 10:26:45,567 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:26:45,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_11-equ_nr.i that has 2 procedures, 88 locations, 88 edges, 1 initial locations, 0 loop locations, and 2 error locations. [2025-04-30 10:26:45,570 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:26:45,609 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-30 10:26:45,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 91 places, 89 transitions, 182 flow [2025-04-30 10:26:45,674 INFO L116 PetriNetUnfolderBase]: 1/91 cut-off events. [2025-04-30 10:26:45,677 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:45,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 91 events. 1/91 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 55. Up to 2 conditions per place. [2025-04-30 10:26:45,679 INFO L82 GeneralOperation]: Start removeDead. Operand has 91 places, 89 transitions, 182 flow [2025-04-30 10:26:45,683 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 86 transitions, 175 flow [2025-04-30 10:26:45,688 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:26:45,696 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;@3c8b0401, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:26:45,696 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-30 10:26:45,719 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:26:45,719 INFO L116 PetriNetUnfolderBase]: 1/70 cut-off events. [2025-04-30 10:26:45,720 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:26:45,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:45,720 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:45,721 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:45,725 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:45,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1662276444, now seen corresponding path program 1 times [2025-04-30 10:26:45,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:45,731 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439384879] [2025-04-30 10:26:45,731 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:45,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:45,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-30 10:26:45,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-30 10:26:45,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:45,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:46,478 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-30 10:26:46,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:46,478 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439384879] [2025-04-30 10:26:46,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439384879] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:46,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984730944] [2025-04-30 10:26:46,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:46,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:46,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:46,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:46,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:46,639 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 89 [2025-04-30 10:26:46,642 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:46,642 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:46,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 89 [2025-04-30 10:26:46,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:46,789 INFO L116 PetriNetUnfolderBase]: 79/333 cut-off events. [2025-04-30 10:26:46,790 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-30 10:26:46,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 333 events. 79/333 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1416 event pairs, 25 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 459. Up to 130 conditions per place. [2025-04-30 10:26:46,794 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 21 selfloop transitions, 22 changer transitions 4/115 dead transitions. [2025-04-30 10:26:46,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 327 flow [2025-04-30 10:26:46,796 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:46,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:46,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 474 transitions. [2025-04-30 10:26:46,805 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8876404494382022 [2025-04-30 10:26:46,806 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 175 flow. Second operand 6 states and 474 transitions. [2025-04-30 10:26:46,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 327 flow [2025-04-30 10:26:46,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 115 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:26:46,815 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 324 flow [2025-04-30 10:26:46,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2025-04-30 10:26:46,820 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 9 predicate places. [2025-04-30 10:26:46,821 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 324 flow [2025-04-30 10:26:46,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.5) internal successors, (435), 6 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:26:46,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:46,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:46,822 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:26:46,822 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:46,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:46,823 INFO L85 PathProgramCache]: Analyzing trace with hash -2018367890, now seen corresponding path program 1 times [2025-04-30 10:26:46,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:46,823 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857527197] [2025-04-30 10:26:46,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:46,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:46,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-04-30 10:26:46,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-04-30 10:26:46,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:46,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:47,124 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-30 10:26:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:47,125 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857527197] [2025-04-30 10:26:47,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857527197] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:47,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:47,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:26:47,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835051596] [2025-04-30 10:26:47,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:47,126 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-30 10:26:47,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:47,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-30 10:26:47,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-30 10:26:47,181 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 89 [2025-04-30 10:26:47,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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-30 10:26:47,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:47,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 89 [2025-04-30 10:26:47,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:47,319 INFO L116 PetriNetUnfolderBase]: 132/466 cut-off events. [2025-04-30 10:26:47,319 INFO L117 PetriNetUnfolderBase]: For 136/144 co-relation queries the response was YES. [2025-04-30 10:26:47,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 466 events. 132/466 cut-off events. For 136/144 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2203 event pairs, 31 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 995. Up to 218 conditions per place. [2025-04-30 10:26:47,322 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 39 selfloop transitions, 29 changer transitions 7/142 dead transitions. [2025-04-30 10:26:47,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 142 transitions, 614 flow [2025-04-30 10:26:47,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:26:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:26:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 459 transitions. [2025-04-30 10:26:47,325 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8595505617977528 [2025-04-30 10:26:47,325 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 324 flow. Second operand 6 states and 459 transitions. [2025-04-30 10:26:47,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 142 transitions, 614 flow [2025-04-30 10:26:47,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 142 transitions, 614 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:47,329 INFO L231 Difference]: Finished difference. Result has 108 places, 131 transitions, 578 flow [2025-04-30 10:26:47,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=108, PETRI_TRANSITIONS=131} [2025-04-30 10:26:47,330 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 19 predicate places. [2025-04-30 10:26:47,330 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 131 transitions, 578 flow [2025-04-30 10:26:47,330 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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-30 10:26:47,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:47,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:47,331 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:26:47,332 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:47,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:47,332 INFO L85 PathProgramCache]: Analyzing trace with hash 958307322, now seen corresponding path program 1 times [2025-04-30 10:26:47,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:47,332 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617289633] [2025-04-30 10:26:47,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:47,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:47,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:26:47,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:26:47,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:47,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:47,674 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-30 10:26:47,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:47,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617289633] [2025-04-30 10:26:47,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617289633] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:47,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:47,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:26:47,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361668806] [2025-04-30 10:26:47,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:47,676 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:26:47,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:47,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:26:47,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:26:47,847 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 89 [2025-04-30 10:26:47,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 131 transitions, 578 flow. Second operand has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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-30 10:26:47,848 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:47,848 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 89 [2025-04-30 10:26:47,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:47,968 INFO L116 PetriNetUnfolderBase]: 88/430 cut-off events. [2025-04-30 10:26:47,968 INFO L117 PetriNetUnfolderBase]: For 188/192 co-relation queries the response was YES. [2025-04-30 10:26:47,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1059 conditions, 430 events. 88/430 cut-off events. For 188/192 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2092 event pairs, 10 based on Foata normal form. 2/428 useless extension candidates. Maximal degree in co-relation 834. Up to 83 conditions per place. [2025-04-30 10:26:47,972 INFO L140 encePairwiseOnDemand]: 80/89 looper letters, 15 selfloop transitions, 1 changer transitions 14/140 dead transitions. [2025-04-30 10:26:47,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 140 transitions, 650 flow [2025-04-30 10:26:47,973 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-30 10:26:47,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-30 10:26:47,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 532 transitions. [2025-04-30 10:26:47,975 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8539325842696629 [2025-04-30 10:26:47,975 INFO L175 Difference]: Start difference. First operand has 108 places, 131 transitions, 578 flow. Second operand 7 states and 532 transitions. [2025-04-30 10:26:47,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 140 transitions, 650 flow [2025-04-30 10:26:47,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 140 transitions, 632 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-04-30 10:26:47,987 INFO L231 Difference]: Finished difference. Result has 118 places, 126 transitions, 572 flow [2025-04-30 10:26:47,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=572, PETRI_PLACES=118, PETRI_TRANSITIONS=126} [2025-04-30 10:26:47,989 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 29 predicate places. [2025-04-30 10:26:47,989 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 126 transitions, 572 flow [2025-04-30 10:26:47,990 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 73.85714285714286) internal successors, (517), 7 states have internal predecessors, (517), 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-30 10:26:47,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:47,990 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:47,990 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:26:47,990 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:47,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:47,991 INFO L85 PathProgramCache]: Analyzing trace with hash -549552350, now seen corresponding path program 1 times [2025-04-30 10:26:47,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:47,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922803547] [2025-04-30 10:26:47,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:47,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:48,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:26:48,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:26:48,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:48,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:48,410 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-30 10:26:48,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:48,410 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922803547] [2025-04-30 10:26:48,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922803547] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:48,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:48,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:48,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897963221] [2025-04-30 10:26:48,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:48,411 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:48,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:48,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:48,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:48,820 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-04-30 10:26:48,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 126 transitions, 572 flow. Second operand has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-30 10:26:48,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:48,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-04-30 10:26:48,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:49,105 INFO L116 PetriNetUnfolderBase]: 133/461 cut-off events. [2025-04-30 10:26:49,105 INFO L117 PetriNetUnfolderBase]: For 451/451 co-relation queries the response was YES. [2025-04-30 10:26:49,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 461 events. 133/461 cut-off events. For 451/451 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2207 event pairs, 24 based on Foata normal form. 11/469 useless extension candidates. Maximal degree in co-relation 1406. Up to 89 conditions per place. [2025-04-30 10:26:49,108 INFO L140 encePairwiseOnDemand]: 77/89 looper letters, 62 selfloop transitions, 32 changer transitions 25/177 dead transitions. [2025-04-30 10:26:49,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 177 transitions, 1128 flow [2025-04-30 10:26:49,108 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:26:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:26:49,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 758 transitions. [2025-04-30 10:26:49,109 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7742594484167518 [2025-04-30 10:26:49,110 INFO L175 Difference]: Start difference. First operand has 118 places, 126 transitions, 572 flow. Second operand 11 states and 758 transitions. [2025-04-30 10:26:49,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 177 transitions, 1128 flow [2025-04-30 10:26:49,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 177 transitions, 1099 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-04-30 10:26:49,115 INFO L231 Difference]: Finished difference. Result has 122 places, 127 transitions, 676 flow [2025-04-30 10:26:49,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=561, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=676, PETRI_PLACES=122, PETRI_TRANSITIONS=127} [2025-04-30 10:26:49,115 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 33 predicate places. [2025-04-30 10:26:49,115 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 127 transitions, 676 flow [2025-04-30 10:26:49,116 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-30 10:26:49,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:49,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:49,116 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:26:49,116 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:49,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:49,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1345470727, now seen corresponding path program 1 times [2025-04-30 10:26:49,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:49,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818828765] [2025-04-30 10:26:49,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:49,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:49,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-30 10:26:49,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-30 10:26:49,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:49,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:49,429 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-30 10:26:49,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:49,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818828765] [2025-04-30 10:26:49,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818828765] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:49,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:49,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:49,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595349706] [2025-04-30 10:26:49,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:49,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:49,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:49,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:49,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:49,759 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-04-30 10:26:49,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 127 transitions, 676 flow. Second operand has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-30 10:26:49,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:49,760 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-04-30 10:26:49,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:49,969 INFO L116 PetriNetUnfolderBase]: 107/395 cut-off events. [2025-04-30 10:26:49,970 INFO L117 PetriNetUnfolderBase]: For 643/669 co-relation queries the response was YES. [2025-04-30 10:26:49,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1390 conditions, 395 events. 107/395 cut-off events. For 643/669 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1755 event pairs, 22 based on Foata normal form. 16/409 useless extension candidates. Maximal degree in co-relation 1366. Up to 86 conditions per place. [2025-04-30 10:26:49,974 INFO L140 encePairwiseOnDemand]: 78/89 looper letters, 45 selfloop transitions, 28 changer transitions 33/157 dead transitions. [2025-04-30 10:26:49,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 157 transitions, 1156 flow [2025-04-30 10:26:49,975 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-30 10:26:49,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-30 10:26:49,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 682 transitions. [2025-04-30 10:26:49,976 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7662921348314606 [2025-04-30 10:26:49,978 INFO L175 Difference]: Start difference. First operand has 122 places, 127 transitions, 676 flow. Second operand 10 states and 682 transitions. [2025-04-30 10:26:49,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 157 transitions, 1156 flow [2025-04-30 10:26:49,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 157 transitions, 1106 flow, removed 8 selfloop flow, removed 7 redundant places. [2025-04-30 10:26:49,987 INFO L231 Difference]: Finished difference. Result has 122 places, 108 transitions, 562 flow [2025-04-30 10:26:49,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=562, PETRI_PLACES=122, PETRI_TRANSITIONS=108} [2025-04-30 10:26:49,990 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 33 predicate places. [2025-04-30 10:26:49,990 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 108 transitions, 562 flow [2025-04-30 10:26:49,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.54545454545455) internal successors, (710), 11 states have internal predecessors, (710), 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-30 10:26:49,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:49,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:49,992 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:26:49,992 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:49,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -684530505, now seen corresponding path program 1 times [2025-04-30 10:26:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:49,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332535856] [2025-04-30 10:26:49,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:26:49,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:50,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-30 10:26:50,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-30 10:26:50,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:26:50,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:50,343 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-30 10:26:50,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:50,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332535856] [2025-04-30 10:26:50,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332535856] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:50,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:50,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:50,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982050221] [2025-04-30 10:26:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:50,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:50,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:50,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:50,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:50,662 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-04-30 10:26:50,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 108 transitions, 562 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-30 10:26:50,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:50,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-04-30 10:26:50,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:50,866 INFO L116 PetriNetUnfolderBase]: 50/223 cut-off events. [2025-04-30 10:26:50,867 INFO L117 PetriNetUnfolderBase]: For 458/467 co-relation queries the response was YES. [2025-04-30 10:26:50,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 223 events. 50/223 cut-off events. For 458/467 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 693 event pairs, 12 based on Foata normal form. 10/231 useless extension candidates. Maximal degree in co-relation 775. Up to 40 conditions per place. [2025-04-30 10:26:50,868 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 37 selfloop transitions, 17 changer transitions 21/129 dead transitions. [2025-04-30 10:26:50,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 129 transitions, 856 flow [2025-04-30 10:26:50,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:26:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:26:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 739 transitions. [2025-04-30 10:26:50,870 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7548518896833504 [2025-04-30 10:26:50,870 INFO L175 Difference]: Start difference. First operand has 122 places, 108 transitions, 562 flow. Second operand 11 states and 739 transitions. [2025-04-30 10:26:50,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 129 transitions, 856 flow [2025-04-30 10:26:50,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 129 transitions, 741 flow, removed 5 selfloop flow, removed 12 redundant places. [2025-04-30 10:26:50,874 INFO L231 Difference]: Finished difference. Result has 115 places, 98 transitions, 433 flow [2025-04-30 10:26:50,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=433, PETRI_PLACES=115, PETRI_TRANSITIONS=98} [2025-04-30 10:26:50,875 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 26 predicate places. [2025-04-30 10:26:50,875 INFO L485 AbstractCegarLoop]: Abstraction has has 115 places, 98 transitions, 433 flow [2025-04-30 10:26:50,875 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-30 10:26:50,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:50,876 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:50,876 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:26:50,876 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:50,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:50,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1157351047, now seen corresponding path program 2 times [2025-04-30 10:26:50,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:50,877 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798014664] [2025-04-30 10:26:50,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:26:50,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:50,887 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 73 statements into 1 equivalence classes. [2025-04-30 10:26:50,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-30 10:26:50,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:26:50,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:51,206 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-30 10:26:51,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:51,207 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798014664] [2025-04-30 10:26:51,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798014664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:51,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:51,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:51,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665142572] [2025-04-30 10:26:51,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:51,208 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:51,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:51,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:51,210 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:51,512 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-04-30 10:26:51,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 98 transitions, 433 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-30 10:26:51,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:51,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-04-30 10:26:51,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:51,699 INFO L116 PetriNetUnfolderBase]: 37/194 cut-off events. [2025-04-30 10:26:51,699 INFO L117 PetriNetUnfolderBase]: For 389/394 co-relation queries the response was YES. [2025-04-30 10:26:51,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 630 conditions, 194 events. 37/194 cut-off events. For 389/394 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 543 event pairs, 12 based on Foata normal form. 6/198 useless extension candidates. Maximal degree in co-relation 611. Up to 36 conditions per place. [2025-04-30 10:26:51,701 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 25 selfloop transitions, 9 changer transitions 29/116 dead transitions. [2025-04-30 10:26:51,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 116 transitions, 661 flow [2025-04-30 10:26:51,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-30 10:26:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-30 10:26:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 800 transitions. [2025-04-30 10:26:51,703 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7490636704119851 [2025-04-30 10:26:51,703 INFO L175 Difference]: Start difference. First operand has 115 places, 98 transitions, 433 flow. Second operand 12 states and 800 transitions. [2025-04-30 10:26:51,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 116 transitions, 661 flow [2025-04-30 10:26:51,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 116 transitions, 618 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-04-30 10:26:51,707 INFO L231 Difference]: Finished difference. Result has 116 places, 84 transitions, 307 flow [2025-04-30 10:26:51,707 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=307, PETRI_PLACES=116, PETRI_TRANSITIONS=84} [2025-04-30 10:26:51,708 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 27 predicate places. [2025-04-30 10:26:51,708 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 84 transitions, 307 flow [2025-04-30 10:26:51,709 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-30 10:26:51,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:26:51,709 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:26:51,709 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:26:51,709 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, t_funErr0ASSERT_VIOLATIONDATA_RACE (and 1 more)] === [2025-04-30 10:26:51,710 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:26:51,710 INFO L85 PathProgramCache]: Analyzing trace with hash -1325905017, now seen corresponding path program 3 times [2025-04-30 10:26:51,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:26:51,710 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205814438] [2025-04-30 10:26:51,710 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-30 10:26:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:26:51,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 1 equivalence classes. [2025-04-30 10:26:51,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-30 10:26:51,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-30 10:26:51,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:26:51,958 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-30 10:26:51,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:26:51,959 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205814438] [2025-04-30 10:26:51,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205814438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:26:51,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:26:51,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-30 10:26:51,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246072543] [2025-04-30 10:26:51,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:26:51,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-30 10:26:51,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:26:51,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-30 10:26:51,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-04-30 10:26:52,264 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 89 [2025-04-30 10:26:52,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 84 transitions, 307 flow. Second operand has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-30 10:26:52,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:26:52,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 89 [2025-04-30 10:26:52,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:26:52,382 INFO L116 PetriNetUnfolderBase]: 17/137 cut-off events. [2025-04-30 10:26:52,383 INFO L117 PetriNetUnfolderBase]: For 157/158 co-relation queries the response was YES. [2025-04-30 10:26:52,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 137 events. 17/137 cut-off events. For 157/158 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 280 event pairs, 12 based on Foata normal form. 2/137 useless extension candidates. Maximal degree in co-relation 332. Up to 34 conditions per place. [2025-04-30 10:26:52,383 INFO L140 encePairwiseOnDemand]: 79/89 looper letters, 0 selfloop transitions, 0 changer transitions 88/88 dead transitions. [2025-04-30 10:26:52,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 88 transitions, 399 flow [2025-04-30 10:26:52,383 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-30 10:26:52,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-30 10:26:52,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 721 transitions. [2025-04-30 10:26:52,385 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7364657814096016 [2025-04-30 10:26:52,385 INFO L175 Difference]: Start difference. First operand has 116 places, 84 transitions, 307 flow. Second operand 11 states and 721 transitions. [2025-04-30 10:26:52,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 88 transitions, 399 flow [2025-04-30 10:26:52,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 88 transitions, 354 flow, removed 7 selfloop flow, removed 14 redundant places. [2025-04-30 10:26:52,388 INFO L231 Difference]: Finished difference. Result has 102 places, 0 transitions, 0 flow [2025-04-30 10:26:52,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=0, PETRI_PLACES=102, PETRI_TRANSITIONS=0} [2025-04-30 10:26:52,389 INFO L279 CegarLoopForPetriNet]: 89 programPoint places, 13 predicate places. [2025-04-30 10:26:52,389 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 0 transitions, 0 flow [2025-04-30 10:26:52,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 65.0909090909091) internal successors, (716), 11 states have internal predecessors, (716), 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-30 10:26:52,393 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 4 remaining) [2025-04-30 10:26:52,393 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-30 10:26:52,393 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 4 remaining) [2025-04-30 10:26:52,393 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 4 remaining) [2025-04-30 10:26:52,393 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:26:52,393 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2025-04-30 10:26:52,397 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:26:52,397 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:26:52,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:26:52 BasicIcfg [2025-04-30 10:26:52,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:26:52,403 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:26:52,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:26:52,403 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:26:52,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:26:45" (3/4) ... [2025-04-30 10:26:52,405 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:26:52,407 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-30 10:26:52,410 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-04-30 10:26:52,411 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:26:52,411 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:26:52,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:26:52,465 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:26:52,466 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:26:52,466 INFO L158 Benchmark]: Toolchain (without parser) took 7710.11ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 122.6MB in the beginning and 129.0MB in the end (delta: -6.5MB). Peak memory consumption was 199.5MB. Max. memory is 16.1GB. [2025-04-30 10:26:52,467 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:52,467 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.04ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 91.6MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:26:52,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.33ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:52,469 INFO L158 Benchmark]: Boogie Preprocessor took 27.05ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 88.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:52,469 INFO L158 Benchmark]: RCFGBuilder took 288.46ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 72.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-30 10:26:52,469 INFO L158 Benchmark]: TraceAbstraction took 6851.77ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 71.3MB in the beginning and 137.4MB in the end (delta: -66.0MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB. [2025-04-30 10:26:52,470 INFO L158 Benchmark]: Witness Printer took 62.73ms. Allocated memory is still 377.5MB. Free memory was 137.4MB in the beginning and 129.0MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:26:52,471 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.17ms. Allocated memory is still 201.3MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.04ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 91.6MB in the end (delta: 31.0MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.33ms. Allocated memory is still 167.8MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.05ms. Allocated memory is still 167.8MB. Free memory was 89.5MB in the beginning and 88.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 288.46ms. Allocated memory is still 167.8MB. Free memory was 88.1MB in the beginning and 72.0MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 6851.77ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 71.3MB in the beginning and 137.4MB in the end (delta: -66.0MB). Peak memory consumption was 149.1MB. Max. memory is 16.1GB. * Witness Printer took 62.73ms. Allocated memory is still 377.5MB. Free memory was 137.4MB in the beginning and 129.0MB in the end (delta: 8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1022]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 996]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 106 locations, 106 edges, 4 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: 6.8s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1947 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1599 mSDsluCounter, 1845 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1768 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4998 IncrementalHoareTripleChecker+Invalid, 5105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 77 mSDtfsCounter, 4998 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=676occurred in iteration=4, InterpolantAutomatonStates: 74, 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, 2.8s InterpolantComputationTime, 521 NumberOfCodeBlocks, 521 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 513 ConstructedInterpolants, 0 QuantifiedInterpolants, 3028 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:26:52,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE