./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e4b633f518697e1629a4783908b5111a4ab34de5cf9d8ef7b61ef08c4d5ab8ee --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:09:49,336 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:09:49,387 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:09:49,390 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:09:49,391 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:09:49,410 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:09:49,411 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:09:49,411 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:09:49,411 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:09:49,411 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:09:49,412 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:09:49,412 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:09:49,412 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:09:49,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:09:49,413 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:09:49,414 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:49,414 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:09:49,414 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:49,415 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:09:49,415 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:09:49,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:09:49,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:09:49,416 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 -> e4b633f518697e1629a4783908b5111a4ab34de5cf9d8ef7b61ef08c4d5ab8ee [2025-04-29 11:09:49,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:09:49,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:09:49,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:09:49,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:09:49,652 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:09:49,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.c [2025-04-29 11:09:50,927 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a50e7de/1a93cee5ad6e427c86a7771968ef80e0/FLAG4fb4cafee [2025-04-29 11:09:51,172 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:09:51,173 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_01-priv_nr_true.c [2025-04-29 11:09:51,174 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:51,174 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:09:51,178 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a50e7de/1a93cee5ad6e427c86a7771968ef80e0/FLAG4fb4cafee [2025-04-29 11:09:51,976 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a50e7de/1a93cee5ad6e427c86a7771968ef80e0 [2025-04-29 11:09:51,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:09:51,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:09:51,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:51,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:09:51,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:09:51,984 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:51" (1/1) ... [2025-04-29 11:09:51,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5447008e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:51, skipping insertion in model container [2025-04-29 11:09:51,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:09:51" (1/1) ... [2025-04-29 11:09:51,993 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:09:52,137 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:52,144 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:09:52,170 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:09:52,186 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:09:52,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52 WrapperNode [2025-04-29 11:09:52,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:09:52,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:52,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:09:52,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:09:52,191 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,212 INFO L138 Inliner]: procedures = 14, calls = 14, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 100 [2025-04-29 11:09:52,214 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:09:52,214 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:09:52,214 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:09:52,214 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:09:52,218 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,227 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,231 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,232 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,232 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,239 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:09:52,240 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:09:52,240 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:09:52,240 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:09:52,244 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (1/1) ... [2025-04-29 11:09:52,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:09:52,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:09:52,267 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:09:52,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:09:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:09:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:09:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:09:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:09:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:09:52,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:09:52,285 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:09:52,285 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:09:52,286 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:09:52,343 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:09:52,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:09:52,470 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:09:52,470 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:09:52,490 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:09:52,490 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:09:52,491 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:52 BoogieIcfgContainer [2025-04-29 11:09:52,491 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:09:52,492 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:09:52,493 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:09:52,496 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:09:52,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:09:51" (1/3) ... [2025-04-29 11:09:52,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746c1f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:52, skipping insertion in model container [2025-04-29 11:09:52,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:09:52" (2/3) ... [2025-04-29 11:09:52,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746c1f39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:09:52, skipping insertion in model container [2025-04-29 11:09:52,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:52" (3/3) ... [2025-04-29 11:09:52,498 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_01-priv_nr_true.c [2025-04-29 11:09:52,507 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:09:52,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_01-priv_nr_true.c that has 2 procedures, 114 locations, 116 edges, 1 initial locations, 0 loop locations, and 10 error locations. [2025-04-29 11:09:52,509 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:09:52,549 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:09:52,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 117 transitions, 241 flow [2025-04-29 11:09:52,609 INFO L116 PetriNetUnfolderBase]: 4/116 cut-off events. [2025-04-29 11:09:52,611 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:52,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 116 events. 4/116 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 123 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2025-04-29 11:09:52,613 INFO L82 GeneralOperation]: Start removeDead. Operand has 117 places, 117 transitions, 241 flow [2025-04-29 11:09:52,616 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 111 transitions, 225 flow [2025-04-29 11:09:52,621 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:09:52,633 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@644d22ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:09:52,633 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:09:52,636 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:09:52,636 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-29 11:09:52,636 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:09:52,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:52,636 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:52,637 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:09:52,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:52,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1003196310, now seen corresponding path program 1 times [2025-04-29 11:09:52,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:52,645 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418702792] [2025-04-29 11:09:52,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:52,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:52,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:09:52,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:09:52,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:52,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:52,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:52,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:52,747 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418702792] [2025-04-29 11:09:52,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418702792] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:52,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:52,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:52,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988284590] [2025-04-29 11:09:52,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:52,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:52,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:52,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:52,823 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 117 [2025-04-29 11:09:52,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 111 transitions, 225 flow. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:52,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:52,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 117 [2025-04-29 11:09:52,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:52,980 INFO L116 PetriNetUnfolderBase]: 110/768 cut-off events. [2025-04-29 11:09:52,981 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:09:52,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 768 events. 110/768 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4679 event pairs, 49 based on Foata normal form. 43/716 useless extension candidates. Maximal degree in co-relation 1012. Up to 167 conditions per place. [2025-04-29 11:09:52,989 INFO L140 encePairwiseOnDemand]: 92/117 looper letters, 29 selfloop transitions, 15 changer transitions 1/120 dead transitions. [2025-04-29 11:09:52,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 120 transitions, 331 flow [2025-04-29 11:09:52,991 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:52,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-04-29 11:09:53,003 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8547008547008547 [2025-04-29 11:09:53,005 INFO L175 Difference]: Start difference. First operand has 111 places, 111 transitions, 225 flow. Second operand 3 states and 300 transitions. [2025-04-29 11:09:53,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 120 transitions, 331 flow [2025-04-29 11:09:53,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 120 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:53,016 INFO L231 Difference]: Finished difference. Result has 109 places, 115 transitions, 330 flow [2025-04-29 11:09:53,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=109, PETRI_TRANSITIONS=115} [2025-04-29 11:09:53,020 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -2 predicate places. [2025-04-29 11:09:53,021 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 115 transitions, 330 flow [2025-04-29 11:09:53,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:53,021 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:53,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:09:53,021 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:09:53,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:53,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1033544740, now seen corresponding path program 1 times [2025-04-29 11:09:53,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:53,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727229610] [2025-04-29 11:09:53,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:53,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:53,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:09:53,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:09:53,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:53,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:53,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727229610] [2025-04-29 11:09:53,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727229610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:53,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:53,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952393796] [2025-04-29 11:09:53,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,100 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:53,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:53,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:53,151 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2025-04-29 11:09:53,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 115 transitions, 330 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:53,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2025-04-29 11:09:53,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:53,235 INFO L116 PetriNetUnfolderBase]: 132/892 cut-off events. [2025-04-29 11:09:53,235 INFO L117 PetriNetUnfolderBase]: For 299/320 co-relation queries the response was YES. [2025-04-29 11:09:53,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 892 events. 132/892 cut-off events. For 299/320 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 5775 event pairs, 59 based on Foata normal form. 2/792 useless extension candidates. Maximal degree in co-relation 1477. Up to 229 conditions per place. [2025-04-29 11:09:53,241 INFO L140 encePairwiseOnDemand]: 109/117 looper letters, 29 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2025-04-29 11:09:53,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 125 transitions, 448 flow [2025-04-29 11:09:53,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:53,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 290 transitions. [2025-04-29 11:09:53,244 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8262108262108262 [2025-04-29 11:09:53,245 INFO L175 Difference]: Start difference. First operand has 109 places, 115 transitions, 330 flow. Second operand 3 states and 290 transitions. [2025-04-29 11:09:53,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 125 transitions, 448 flow [2025-04-29 11:09:53,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 125 transitions, 410 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:09:53,250 INFO L231 Difference]: Finished difference. Result has 110 places, 123 transitions, 386 flow [2025-04-29 11:09:53,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=386, PETRI_PLACES=110, PETRI_TRANSITIONS=123} [2025-04-29 11:09:53,251 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -1 predicate places. [2025-04-29 11:09:53,251 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 123 transitions, 386 flow [2025-04-29 11:09:53,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:53,252 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:09:53,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:09:53,252 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:09:53,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1086776873, now seen corresponding path program 1 times [2025-04-29 11:09:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:53,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455827738] [2025-04-29 11:09:53,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:53,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:09:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:09:53,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:53,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:53,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,404 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455827738] [2025-04-29 11:09:53,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455827738] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:53,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:09:53,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087160304] [2025-04-29 11:09:53,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,406 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:53,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:53,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:53,413 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 117 [2025-04-29 11:09:53,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 123 transitions, 386 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:53,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 117 [2025-04-29 11:09:53,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:53,432 INFO L116 PetriNetUnfolderBase]: 1/163 cut-off events. [2025-04-29 11:09:53,433 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:09:53,433 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 163 events. 1/163 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 170 event pairs, 0 based on Foata normal form. 2/153 useless extension candidates. Maximal degree in co-relation 194. Up to 21 conditions per place. [2025-04-29 11:09:53,433 INFO L140 encePairwiseOnDemand]: 113/117 looper letters, 2 selfloop transitions, 4 changer transitions 3/97 dead transitions. [2025-04-29 11:09:53,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 97 transitions, 260 flow [2025-04-29 11:09:53,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:53,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:53,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2025-04-29 11:09:53,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8945868945868946 [2025-04-29 11:09:53,435 INFO L175 Difference]: Start difference. First operand has 110 places, 123 transitions, 386 flow. Second operand 3 states and 314 transitions. [2025-04-29 11:09:53,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 97 transitions, 260 flow [2025-04-29 11:09:53,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 97 transitions, 230 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-29 11:09:53,438 INFO L231 Difference]: Finished difference. Result has 102 places, 94 transitions, 220 flow [2025-04-29 11:09:53,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=102, PETRI_TRANSITIONS=94} [2025-04-29 11:09:53,439 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -9 predicate places. [2025-04-29 11:09:53,439 INFO L485 AbstractCegarLoop]: Abstraction has has 102 places, 94 transitions, 220 flow [2025-04-29 11:09:53,439 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:53,439 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] [2025-04-29 11:09:53,439 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:09:53,439 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:09:53,440 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 714829411, now seen corresponding path program 1 times [2025-04-29 11:09:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:53,440 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042691251] [2025-04-29 11:09:53,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:53,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:09:53,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:09:53,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:53,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:53,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042691251] [2025-04-29 11:09:53,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042691251] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:53,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:53,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107103401] [2025-04-29 11:09:53,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,492 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:53,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:53,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:53,528 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2025-04-29 11:09:53,528 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 94 transitions, 220 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:53,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2025-04-29 11:09:53,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:53,544 INFO L116 PetriNetUnfolderBase]: 1/155 cut-off events. [2025-04-29 11:09:53,545 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:09:53,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 155 events. 1/155 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 146 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 189. Up to 31 conditions per place. [2025-04-29 11:09:53,545 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 18 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2025-04-29 11:09:53,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 93 transitions, 258 flow [2025-04-29 11:09:53,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:53,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2025-04-29 11:09:53,546 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2025-04-29 11:09:53,546 INFO L175 Difference]: Start difference. First operand has 102 places, 94 transitions, 220 flow. Second operand 3 states and 286 transitions. [2025-04-29 11:09:53,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 93 transitions, 258 flow [2025-04-29 11:09:53,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 93 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:09:53,548 INFO L231 Difference]: Finished difference. Result has 99 places, 93 transitions, 218 flow [2025-04-29 11:09:53,548 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=99, PETRI_TRANSITIONS=93} [2025-04-29 11:09:53,548 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -12 predicate places. [2025-04-29 11:09:53,548 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 93 transitions, 218 flow [2025-04-29 11:09:53,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:53,549 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] [2025-04-29 11:09:53,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:09:53,549 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:09:53,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:53,549 INFO L85 PathProgramCache]: Analyzing trace with hash 2088969255, now seen corresponding path program 1 times [2025-04-29 11:09:53,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:53,549 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582989461] [2025-04-29 11:09:53,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:53,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:53,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:09:53,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:09:53,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:53,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:53,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582989461] [2025-04-29 11:09:53,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582989461] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:53,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:53,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421205513] [2025-04-29 11:09:53,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,582 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:53,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:53,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:53,629 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 117 [2025-04-29 11:09:53,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 93 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:53,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 117 [2025-04-29 11:09:53,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:53,648 INFO L116 PetriNetUnfolderBase]: 1/153 cut-off events. [2025-04-29 11:09:53,649 INFO L117 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-04-29 11:09:53,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 153 events. 1/153 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 139 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 187. Up to 32 conditions per place. [2025-04-29 11:09:53,649 INFO L140 encePairwiseOnDemand]: 114/117 looper letters, 17 selfloop transitions, 2 changer transitions 7/92 dead transitions. [2025-04-29 11:09:53,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 92 transitions, 258 flow [2025-04-29 11:09:53,649 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:53,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:53,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2025-04-29 11:09:53,650 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8005698005698005 [2025-04-29 11:09:53,650 INFO L175 Difference]: Start difference. First operand has 99 places, 93 transitions, 218 flow. Second operand 3 states and 281 transitions. [2025-04-29 11:09:53,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 92 transitions, 258 flow [2025-04-29 11:09:53,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 92 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:09:53,653 INFO L231 Difference]: Finished difference. Result has 98 places, 85 transitions, 199 flow [2025-04-29 11:09:53,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=199, PETRI_PLACES=98, PETRI_TRANSITIONS=85} [2025-04-29 11:09:53,654 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -13 predicate places. [2025-04-29 11:09:53,654 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 85 transitions, 199 flow [2025-04-29 11:09:53,654 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:09:53,654 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] [2025-04-29 11:09:53,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:09:53,654 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:09:53,655 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:09:53,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1602222893, now seen corresponding path program 1 times [2025-04-29 11:09:53,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:09:53,655 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732567580] [2025-04-29 11:09:53,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:09:53,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:09:53,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:09:53,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:09:53,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:09:53,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:09:53,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:09:53,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:09:53,690 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732567580] [2025-04-29 11:09:53,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732567580] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:09:53,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:09:53,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:09:53,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932241557] [2025-04-29 11:09:53,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:09:53,691 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:09:53,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:09:53,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:09:53,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:09:53,730 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 117 [2025-04-29 11:09:53,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 85 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:09:53,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 117 [2025-04-29 11:09:53,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:09:53,742 INFO L116 PetriNetUnfolderBase]: 0/110 cut-off events. [2025-04-29 11:09:53,742 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-29 11:09:53,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 110 events. 0/110 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 59 event pairs, 0 based on Foata normal form. 2/112 useless extension candidates. Maximal degree in co-relation 0. Up to 20 conditions per place. [2025-04-29 11:09:53,743 INFO L140 encePairwiseOnDemand]: 115/117 looper letters, 0 selfloop transitions, 0 changer transitions 84/84 dead transitions. [2025-04-29 11:09:53,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 84 transitions, 229 flow [2025-04-29 11:09:53,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:09:53,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:09:53,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2025-04-29 11:09:53,744 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8062678062678063 [2025-04-29 11:09:53,744 INFO L175 Difference]: Start difference. First operand has 98 places, 85 transitions, 199 flow. Second operand 3 states and 283 transitions. [2025-04-29 11:09:53,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 84 transitions, 229 flow [2025-04-29 11:09:53,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 84 transitions, 223 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-29 11:09:53,746 INFO L231 Difference]: Finished difference. Result has 91 places, 0 transitions, 0 flow [2025-04-29 11:09:53,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=117, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=91, PETRI_TRANSITIONS=0} [2025-04-29 11:09:53,748 INFO L279 CegarLoopForPetriNet]: 111 programPoint places, -20 predicate places. [2025-04-29 11:09:53,748 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 0 transitions, 0 flow [2025-04-29 11:09:53,748 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:09:53,750 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-29 11:09:53,751 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-29 11:09:53,752 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-04-29 11:09:53,752 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-29 11:09:53,752 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-29 11:09:53,752 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-29 11:09:53,752 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-29 11:09:53,752 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:09:53,752 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:09:53,756 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:09:53,756 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:09:53,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:09:53 BasicIcfg [2025-04-29 11:09:53,761 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:09:53,761 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:09:53,761 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:09:53,761 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:09:53,762 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:09:52" (3/4) ... [2025-04-29 11:09:53,763 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:09:53,765 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-29 11:09:53,768 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2025-04-29 11:09:53,768 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:09:53,768 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-29 11:09:53,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:09:53,820 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:09:53,820 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:09:53,821 INFO L158 Benchmark]: Toolchain (without parser) took 1841.90ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 66.4MB in the end (delta: 44.0MB). Peak memory consumption was 45.5MB. Max. memory is 16.1GB. [2025-04-29 11:09:53,821 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:09:53,822 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.13ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 96.6MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:09:53,822 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.23ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:09:53,823 INFO L158 Benchmark]: Boogie Preprocessor took 25.05ms. Allocated memory is still 142.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:09:53,823 INFO L158 Benchmark]: RCFGBuilder took 251.26ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 78.7MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:09:53,823 INFO L158 Benchmark]: TraceAbstraction took 1268.48ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 72.0MB in the end (delta: 6.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. [2025-04-29 11:09:53,823 INFO L158 Benchmark]: Witness Printer took 59.28ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 66.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:09:53,824 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.69ms. Allocated memory is still 201.3MB. Free memory is still 125.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.13ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 96.6MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.23ms. Allocated memory is still 142.6MB. Free memory was 96.6MB in the beginning and 94.4MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 25.05ms. Allocated memory is still 142.6MB. Free memory is still 94.4MB. There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 251.26ms. Allocated memory is still 142.6MB. Free memory was 93.3MB in the beginning and 78.7MB in the end (delta: 14.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1268.48ms. Allocated memory is still 142.6MB. Free memory was 78.7MB in the beginning and 72.0MB in the end (delta: 6.7MB). Peak memory consumption was 11.9MB. Max. memory is 16.1GB. * Witness Printer took 59.28ms. Allocated memory is still 142.6MB. Free memory was 72.0MB in the beginning and 66.4MB in the end (delta: 5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 36]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 36]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 37]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 22]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 24]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 25]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 26]: 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, 159 locations, 164 edges, 15 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 295 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 42 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 323 IncrementalHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 42 mSDtfsCounter, 323 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=386occurred in iteration=2, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 224 NumberOfCodeBlocks, 224 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 258 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 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 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:09:53,838 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