./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.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 5730b8f15d0cc07377d36a4e56b14cd6f9afe76bed8cf5546ba186fd0e3c8f24 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:08:06,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:08:06,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:08:06,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:08:06,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:08:06,078 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:08:06,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:08:06,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:08:06,079 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:08:06,079 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:08:06,079 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:08:06,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:08:06,079 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:08:06,079 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:08:06,079 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:08:06,079 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:08:06,079 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:08:06,080 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:08:06,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:08:06,081 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:08:06,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:08:06,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:08:06,081 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:08:06,081 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:08:06,081 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:08:06,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:08:06,082 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:08:06,082 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:08:06,082 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:08:06,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:06,082 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:06,082 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:06,082 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:08:06,082 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:06,083 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:08:06,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:08:06,083 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 -> 5730b8f15d0cc07377d36a4e56b14cd6f9afe76bed8cf5546ba186fd0e3c8f24 [2025-04-29 11:08:06,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:08:06,263 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:08:06,265 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:08:06,266 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:08:06,266 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:08:06,266 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.c [2025-04-29 11:08:07,522 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf41c2084/60f49bdf0a2e4f6d9b301730aee50b80/FLAG45a5f90d0 [2025-04-29 11:08:07,694 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:08:07,694 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_44-malloc_sound.c [2025-04-29 11:08:07,695 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:07,695 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:08:07,709 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf41c2084/60f49bdf0a2e4f6d9b301730aee50b80/FLAG45a5f90d0 [2025-04-29 11:08:08,572 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf41c2084/60f49bdf0a2e4f6d9b301730aee50b80 [2025-04-29 11:08:08,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:08:08,575 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:08:08,576 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:08,576 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:08:08,579 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:08:08,580 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,580 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7da1c2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08, skipping insertion in model container [2025-04-29 11:08:08,580 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,591 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:08:08,731 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:08,736 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:08:08,754 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:08:08,767 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:08:08,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08 WrapperNode [2025-04-29 11:08:08,768 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:08:08,769 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:08,769 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:08:08,769 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:08:08,773 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,780 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,790 INFO L138 Inliner]: procedures = 8, calls = 8, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 57 [2025-04-29 11:08:08,790 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:08:08,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:08:08,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:08:08,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:08:08,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,798 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,800 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,801 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,804 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,804 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,805 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,807 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:08:08,808 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:08:08,808 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:08:08,808 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:08:08,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (1/1) ... [2025-04-29 11:08:08,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:08:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:08,832 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:08:08,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:08:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:08:08,848 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:08:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-04-29 11:08:08,849 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-04-29 11:08:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:08:08,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:08:08,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:08:08,849 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:08:08,901 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:08:08,902 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:08:09,050 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:08:09,051 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:08:09,077 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:08:09,077 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:08:09,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:09 BoogieIcfgContainer [2025-04-29 11:08:09,078 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:08:09,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:08:09,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:08:09,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:08:09,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:08:08" (1/3) ... [2025-04-29 11:08:09,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd9c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:09, skipping insertion in model container [2025-04-29 11:08:09,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:08:08" (2/3) ... [2025-04-29 11:08:09,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11fd9c04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:08:09, skipping insertion in model container [2025-04-29 11:08:09,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:09" (3/3) ... [2025-04-29 11:08:09,086 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_44-malloc_sound.c [2025-04-29 11:08:09,096 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:08:09,100 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_44-malloc_sound.c that has 2 procedures, 89 locations, 90 edges, 1 initial locations, 1 loop locations, and 10 error locations. [2025-04-29 11:08:09,101 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:08:09,147 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:08:09,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 91 transitions, 186 flow [2025-04-29 11:08:09,216 INFO L116 PetriNetUnfolderBase]: 3/90 cut-off events. [2025-04-29 11:08:09,217 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:09,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 90 events. 3/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 152 event pairs, 0 based on Foata normal form. 0/77 useless extension candidates. Maximal degree in co-relation 38. Up to 2 conditions per place. [2025-04-29 11:08:09,220 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 91 transitions, 186 flow [2025-04-29 11:08:09,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 90 transitions, 183 flow [2025-04-29 11:08:09,229 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:08:09,238 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;@4f247d65, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:08:09,239 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:08:09,246 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:08:09,246 INFO L116 PetriNetUnfolderBase]: 0/31 cut-off events. [2025-04-29 11:08:09,246 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:09,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:09,247 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:09,247 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:09,251 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:09,251 INFO L85 PathProgramCache]: Analyzing trace with hash 71143600, now seen corresponding path program 1 times [2025-04-29 11:08:09,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:09,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722013149] [2025-04-29 11:08:09,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:09,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:09,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-29 11:08:09,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-29 11:08:09,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:09,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:09,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:09,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:09,390 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722013149] [2025-04-29 11:08:09,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722013149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:09,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:09,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:08:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660711354] [2025-04-29 11:08:09,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:09,397 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:09,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:09,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:09,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:08:09,444 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-29 11:08:09,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:09,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:09,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-29 11:08:09,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:09,512 INFO L116 PetriNetUnfolderBase]: 9/165 cut-off events. [2025-04-29 11:08:09,513 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:09,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 165 events. 9/165 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 384 event pairs, 6 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 134. Up to 26 conditions per place. [2025-04-29 11:08:09,515 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 12 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-04-29 11:08:09,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 213 flow [2025-04-29 11:08:09,516 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:09,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:09,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-04-29 11:08:09,527 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-04-29 11:08:09,529 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 183 flow. Second operand 3 states and 251 transitions. [2025-04-29 11:08:09,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 213 flow [2025-04-29 11:08:09,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 212 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:09,538 INFO L231 Difference]: Finished difference. Result has 93 places, 91 transitions, 198 flow [2025-04-29 11:08:09,540 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=93, PETRI_TRANSITIONS=91} [2025-04-29 11:08:09,544 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-04-29 11:08:09,545 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 91 transitions, 198 flow [2025-04-29 11:08:09,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:09,545 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:09,546 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] [2025-04-29 11:08:09,546 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:08:09,546 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting fErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:09,547 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:09,547 INFO L85 PathProgramCache]: Analyzing trace with hash -377764226, now seen corresponding path program 1 times [2025-04-29 11:08:09,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:09,548 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127002032] [2025-04-29 11:08:09,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:09,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:09,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:08:09,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:08:09,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:09,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:09,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:09,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:09,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127002032] [2025-04-29 11:08:09,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127002032] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:09,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613745257] [2025-04-29 11:08:09,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:09,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:09,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:09,678 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:09,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:08:09,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:08:09,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:08:09,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:09,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:09,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:09,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:09,757 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:09,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613745257] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:09,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:09,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:09,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767366943] [2025-04-29 11:08:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:09,758 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:09,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:09,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:09,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:09,774 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-04-29 11:08:09,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 91 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:09,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:09,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-04-29 11:08:09,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:09,809 INFO L116 PetriNetUnfolderBase]: 15/151 cut-off events. [2025-04-29 11:08:09,809 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:08:09,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 151 events. 15/151 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 412 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 170. Up to 30 conditions per place. [2025-04-29 11:08:09,810 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/91 dead transitions. [2025-04-29 11:08:09,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 222 flow [2025-04-29 11:08:09,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:09,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:09,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-04-29 11:08:09,812 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-04-29 11:08:09,812 INFO L175 Difference]: Start difference. First operand has 93 places, 91 transitions, 198 flow. Second operand 3 states and 251 transitions. [2025-04-29 11:08:09,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 222 flow [2025-04-29 11:08:09,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 91 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:09,814 INFO L231 Difference]: Finished difference. Result has 92 places, 89 transitions, 194 flow [2025-04-29 11:08:09,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=92, PETRI_TRANSITIONS=89} [2025-04-29 11:08:09,815 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-04-29 11:08:09,815 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 89 transitions, 194 flow [2025-04-29 11:08:09,815 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:09,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:09,815 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] [2025-04-29 11:08:09,822 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-29 11:08:10,016 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:10,017 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:10,018 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:10,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1173028120, now seen corresponding path program 1 times [2025-04-29 11:08:10,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:10,019 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29221573] [2025-04-29 11:08:10,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:10,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:08:10,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:08:10,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,035 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:10,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:10,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29221573] [2025-04-29 11:08:10,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29221573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:10,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597533502] [2025-04-29 11:08:10,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:10,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:10,100 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:10,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:08:10,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:08:10,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:08:10,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:10,151 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:10,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:10,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:10,160 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:10,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597533502] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:10,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:10,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:10,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229209414] [2025-04-29 11:08:10,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:10,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:10,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:10,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:10,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:10,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 91 [2025-04-29 11:08:10,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 89 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:10,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:10,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 91 [2025-04-29 11:08:10,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:10,213 INFO L116 PetriNetUnfolderBase]: 15/153 cut-off events. [2025-04-29 11:08:10,214 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:10,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 153 events. 15/153 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 413 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 145. Up to 30 conditions per place. [2025-04-29 11:08:10,215 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 11 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-04-29 11:08:10,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 89 transitions, 218 flow [2025-04-29 11:08:10,215 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:10,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:10,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-04-29 11:08:10,217 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-04-29 11:08:10,217 INFO L175 Difference]: Start difference. First operand has 92 places, 89 transitions, 194 flow. Second operand 3 states and 251 transitions. [2025-04-29 11:08:10,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 89 transitions, 218 flow [2025-04-29 11:08:10,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 89 transitions, 217 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:10,218 INFO L231 Difference]: Finished difference. Result has 91 places, 87 transitions, 191 flow [2025-04-29 11:08:10,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=91, PETRI_TRANSITIONS=87} [2025-04-29 11:08:10,219 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 0 predicate places. [2025-04-29 11:08:10,219 INFO L485 AbstractCegarLoop]: Abstraction has has 91 places, 87 transitions, 191 flow [2025-04-29 11:08:10,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:10,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:10,220 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:10,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:08:10,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-29 11:08:10,420 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:10,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:10,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1904502736, now seen corresponding path program 1 times [2025-04-29 11:08:10,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:10,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043452177] [2025-04-29 11:08:10,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:10,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:08:10,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:08:10,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:10,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:10,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:10,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043452177] [2025-04-29 11:08:10,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043452177] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:10,499 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387227311] [2025-04-29 11:08:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:10,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:10,502 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:10,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:08:10,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:08:10,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:08:10,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:10,551 INFO L256 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:10,552 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:10,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-29 11:08:10,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:10,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387227311] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332034114] [2025-04-29 11:08:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:10,562 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:10,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:10,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:10,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:10,577 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-29 11:08:10,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 87 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:10,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:10,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-29 11:08:10,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:10,620 INFO L116 PetriNetUnfolderBase]: 18/201 cut-off events. [2025-04-29 11:08:10,620 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:08:10,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 266 conditions, 201 events. 18/201 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 659 event pairs, 10 based on Foata normal form. 0/187 useless extension candidates. Maximal degree in co-relation 146. Up to 35 conditions per place. [2025-04-29 11:08:10,621 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 14 selfloop transitions, 3 changer transitions 0/91 dead transitions. [2025-04-29 11:08:10,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 91 transitions, 237 flow [2025-04-29 11:08:10,622 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-04-29 11:08:10,625 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-04-29 11:08:10,625 INFO L175 Difference]: Start difference. First operand has 91 places, 87 transitions, 191 flow. Second operand 3 states and 252 transitions. [2025-04-29 11:08:10,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 91 transitions, 237 flow [2025-04-29 11:08:10,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:10,627 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 206 flow [2025-04-29 11:08:10,627 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=206, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-04-29 11:08:10,627 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 1 predicate places. [2025-04-29 11:08:10,627 INFO L485 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 206 flow [2025-04-29 11:08:10,628 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:10,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:10,628 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:10,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:10,828 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:10,829 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:10,829 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1023994406, now seen corresponding path program 1 times [2025-04-29 11:08:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:10,829 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171429481] [2025-04-29 11:08:10,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:10,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:08:10,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:08:10,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:10,890 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:10,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:10,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171429481] [2025-04-29 11:08:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171429481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:10,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427101553] [2025-04-29 11:08:10,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:10,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:10,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:10,893 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:10,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:08:10,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:08:10,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:08:10,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:10,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:10,947 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:10,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:10,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-04-29 11:08:10,959 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:10,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427101553] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:10,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:10,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:10,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123622512] [2025-04-29 11:08:10,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:10,959 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:10,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:10,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:10,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:10,975 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-29 11:08:10,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 206 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:10,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:10,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-29 11:08:10,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:11,014 INFO L116 PetriNetUnfolderBase]: 28/293 cut-off events. [2025-04-29 11:08:11,015 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:11,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 406 conditions, 293 events. 28/293 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1228 event pairs, 13 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 286. Up to 48 conditions per place. [2025-04-29 11:08:11,018 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 14 selfloop transitions, 4 changer transitions 0/93 dead transitions. [2025-04-29 11:08:11,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 93 transitions, 255 flow [2025-04-29 11:08:11,019 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:11,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2025-04-29 11:08:11,020 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9267399267399268 [2025-04-29 11:08:11,020 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 206 flow. Second operand 3 states and 253 transitions. [2025-04-29 11:08:11,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 93 transitions, 255 flow [2025-04-29 11:08:11,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 93 transitions, 252 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:11,022 INFO L231 Difference]: Finished difference. Result has 93 places, 90 transitions, 226 flow [2025-04-29 11:08:11,022 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=93, PETRI_TRANSITIONS=90} [2025-04-29 11:08:11,024 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 2 predicate places. [2025-04-29 11:08:11,025 INFO L485 AbstractCegarLoop]: Abstraction has has 93 places, 90 transitions, 226 flow [2025-04-29 11:08:11,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:11,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:11,026 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:11,032 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:11,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:11,226 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting fErr1ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:11,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:11,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1584727935, now seen corresponding path program 1 times [2025-04-29 11:08:11,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:11,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995612112] [2025-04-29 11:08:11,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:11,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:11,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:08:11,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:08:11,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:11,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:11,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:11,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995612112] [2025-04-29 11:08:11,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995612112] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:11,272 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574614715] [2025-04-29 11:08:11,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:11,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:11,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:11,274 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:11,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:08:11,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-04-29 11:08:11,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-04-29 11:08:11,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:11,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:11,316 INFO L256 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:11,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:11,326 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:11,326 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:11,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574614715] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:11,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:11,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:11,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377083578] [2025-04-29 11:08:11,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:11,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:11,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:11,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:11,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:11,339 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-29 11:08:11,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 90 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:11,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:11,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-29 11:08:11,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:11,379 INFO L116 PetriNetUnfolderBase]: 46/395 cut-off events. [2025-04-29 11:08:11,379 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:08:11,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 395 events. 46/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2017 event pairs, 15 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 440. Up to 56 conditions per place. [2025-04-29 11:08:11,380 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 17 selfloop transitions, 6 changer transitions 0/100 dead transitions. [2025-04-29 11:08:11,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 100 transitions, 292 flow [2025-04-29 11:08:11,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:11,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:11,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 259 transitions. [2025-04-29 11:08:11,381 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9487179487179487 [2025-04-29 11:08:11,381 INFO L175 Difference]: Start difference. First operand has 93 places, 90 transitions, 226 flow. Second operand 3 states and 259 transitions. [2025-04-29 11:08:11,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 100 transitions, 292 flow [2025-04-29 11:08:11,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 100 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:11,383 INFO L231 Difference]: Finished difference. Result has 96 places, 96 transitions, 274 flow [2025-04-29 11:08:11,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=96, PETRI_TRANSITIONS=96} [2025-04-29 11:08:11,384 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-04-29 11:08:11,384 INFO L485 AbstractCegarLoop]: Abstraction has has 96 places, 96 transitions, 274 flow [2025-04-29 11:08:11,384 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:11,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:11,384 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:08:11,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:11,588 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:11,588 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting fErr2ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:11,589 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:11,589 INFO L85 PathProgramCache]: Analyzing trace with hash -522485989, now seen corresponding path program 1 times [2025-04-29 11:08:11,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:11,589 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418322167] [2025-04-29 11:08:11,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:11,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:11,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:08:11,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:08:11,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:11,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:11,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:11,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418322167] [2025-04-29 11:08:11,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418322167] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:11,636 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1898397083] [2025-04-29 11:08:11,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:11,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:11,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:11,638 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:11,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:08:11,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:08:11,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:08:11,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:11,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:11,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:11,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:11,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:11,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:11,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1898397083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:11,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:11,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:11,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333670776] [2025-04-29 11:08:11,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:11,699 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:11,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:11,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:11,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:11,721 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 91 [2025-04-29 11:08:11,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 96 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:11,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:11,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 91 [2025-04-29 11:08:11,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:11,788 INFO L116 PetriNetUnfolderBase]: 61/460 cut-off events. [2025-04-29 11:08:11,788 INFO L117 PetriNetUnfolderBase]: For 103/108 co-relation queries the response was YES. [2025-04-29 11:08:11,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 460 events. 61/460 cut-off events. For 103/108 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2572 event pairs, 23 based on Foata normal form. 3/442 useless extension candidates. Maximal degree in co-relation 524. Up to 103 conditions per place. [2025-04-29 11:08:11,790 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 16 selfloop transitions, 7 changer transitions 2/103 dead transitions. [2025-04-29 11:08:11,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 103 transitions, 346 flow [2025-04-29 11:08:11,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:11,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 254 transitions. [2025-04-29 11:08:11,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9304029304029304 [2025-04-29 11:08:11,792 INFO L175 Difference]: Start difference. First operand has 96 places, 96 transitions, 274 flow. Second operand 3 states and 254 transitions. [2025-04-29 11:08:11,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 103 transitions, 346 flow [2025-04-29 11:08:11,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 103 transitions, 330 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:11,796 INFO L231 Difference]: Finished difference. Result has 98 places, 100 transitions, 314 flow [2025-04-29 11:08:11,796 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=314, PETRI_PLACES=98, PETRI_TRANSITIONS=100} [2025-04-29 11:08:11,797 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 7 predicate places. [2025-04-29 11:08:11,798 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 100 transitions, 314 flow [2025-04-29 11:08:11,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:11,798 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:11,798 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:11,804 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-29 11:08:12,003 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:12,003 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:12,004 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:12,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2000033621, now seen corresponding path program 1 times [2025-04-29 11:08:12,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:12,004 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486914908] [2025-04-29 11:08:12,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:12,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:12,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:12,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:12,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:12,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:12,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:12,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486914908] [2025-04-29 11:08:12,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486914908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:12,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131233188] [2025-04-29 11:08:12,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:12,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:12,051 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:12,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:08:12,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:08:12,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:08:12,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:12,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:12,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-29 11:08:12,093 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:08:12,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:08:12,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131233188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:12,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:08:12,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-04-29 11:08:12,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814476426] [2025-04-29 11:08:12,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:12,107 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:08:12,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:12,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:08:12,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:08:12,127 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-29 11:08:12,128 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 100 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:12,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:12,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-29 11:08:12,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:12,170 INFO L116 PetriNetUnfolderBase]: 79/520 cut-off events. [2025-04-29 11:08:12,171 INFO L117 PetriNetUnfolderBase]: For 221/228 co-relation queries the response was YES. [2025-04-29 11:08:12,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962 conditions, 520 events. 79/520 cut-off events. For 221/228 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3035 event pairs, 27 based on Foata normal form. 2/503 useless extension candidates. Maximal degree in co-relation 718. Up to 128 conditions per place. [2025-04-29 11:08:12,172 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 17 selfloop transitions, 7 changer transitions 7/107 dead transitions. [2025-04-29 11:08:12,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 107 transitions, 400 flow [2025-04-29 11:08:12,173 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:08:12,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:08:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 250 transitions. [2025-04-29 11:08:12,174 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9157509157509157 [2025-04-29 11:08:12,174 INFO L175 Difference]: Start difference. First operand has 98 places, 100 transitions, 314 flow. Second operand 3 states and 250 transitions. [2025-04-29 11:08:12,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 107 transitions, 400 flow [2025-04-29 11:08:12,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 107 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:12,181 INFO L231 Difference]: Finished difference. Result has 100 places, 99 transitions, 332 flow [2025-04-29 11:08:12,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=100, PETRI_TRANSITIONS=99} [2025-04-29 11:08:12,182 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-04-29 11:08:12,182 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 99 transitions, 332 flow [2025-04-29 11:08:12,182 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:12,182 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:12,182 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] [2025-04-29 11:08:12,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-29 11:08:12,388 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:12,388 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:12,388 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:12,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1010959019, now seen corresponding path program 1 times [2025-04-29 11:08:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:12,389 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413289708] [2025-04-29 11:08:12,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:12,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:08:12,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:08:12,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:12,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:12,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:12,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:12,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413289708] [2025-04-29 11:08:12,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413289708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:12,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893184849] [2025-04-29 11:08:12,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:12,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:12,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:12,426 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:12,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:08:12,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:08:12,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:08:12,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:12,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:12,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-29 11:08:12,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:12,504 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:12,504 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:12,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:08:12,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893184849] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:12,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:12,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-29 11:08:12,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148335182] [2025-04-29 11:08:12,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:12,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:08:12,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:12,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:08:12,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:08:12,558 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-04-29 11:08:12,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 99 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:12,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:12,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-04-29 11:08:12,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:12,675 INFO L116 PetriNetUnfolderBase]: 40/464 cut-off events. [2025-04-29 11:08:12,675 INFO L117 PetriNetUnfolderBase]: For 164/164 co-relation queries the response was YES. [2025-04-29 11:08:12,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 838 conditions, 464 events. 40/464 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2383 event pairs, 12 based on Foata normal form. 7/458 useless extension candidates. Maximal degree in co-relation 508. Up to 54 conditions per place. [2025-04-29 11:08:12,677 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 15 selfloop transitions, 13 changer transitions 0/110 dead transitions. [2025-04-29 11:08:12,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 110 transitions, 416 flow [2025-04-29 11:08:12,677 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:08:12,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:08:12,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 857 transitions. [2025-04-29 11:08:12,679 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8561438561438561 [2025-04-29 11:08:12,679 INFO L175 Difference]: Start difference. First operand has 100 places, 99 transitions, 332 flow. Second operand 11 states and 857 transitions. [2025-04-29 11:08:12,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 110 transitions, 416 flow [2025-04-29 11:08:12,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 110 transitions, 402 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:08:12,681 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 392 flow [2025-04-29 11:08:12,681 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=392, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-04-29 11:08:12,682 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 20 predicate places. [2025-04-29 11:08:12,682 INFO L485 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 392 flow [2025-04-29 11:08:12,682 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 77.1) internal successors, (771), 10 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:12,682 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:12,683 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:12,689 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:12,883 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-29 11:08:12,883 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:12,884 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:12,884 INFO L85 PathProgramCache]: Analyzing trace with hash 331826825, now seen corresponding path program 2 times [2025-04-29 11:08:12,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:12,884 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189315897] [2025-04-29 11:08:12,884 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:12,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:12,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-29 11:08:12,892 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 36 of 66 statements. [2025-04-29 11:08:12,892 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:08:12,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:12,956 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:08:12,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:12,957 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189315897] [2025-04-29 11:08:12,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189315897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:08:12,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:08:12,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:08:12,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906585088] [2025-04-29 11:08:12,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:08:12,957 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:08:12,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:12,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:08:12,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:08:12,964 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 91 [2025-04-29 11:08:12,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 392 flow. Second operand has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:12,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:12,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 91 [2025-04-29 11:08:12,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:13,070 INFO L116 PetriNetUnfolderBase]: 58/797 cut-off events. [2025-04-29 11:08:13,070 INFO L117 PetriNetUnfolderBase]: For 217/217 co-relation queries the response was YES. [2025-04-29 11:08:13,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 797 events. 58/797 cut-off events. For 217/217 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 5324 event pairs, 13 based on Foata normal form. 2/780 useless extension candidates. Maximal degree in co-relation 487. Up to 74 conditions per place. [2025-04-29 11:08:13,072 INFO L140 encePairwiseOnDemand]: 83/91 looper letters, 13 selfloop transitions, 11 changer transitions 8/130 dead transitions. [2025-04-29 11:08:13,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 504 flow [2025-04-29 11:08:13,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:08:13,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:08:13,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 601 transitions. [2025-04-29 11:08:13,074 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9434850863422292 [2025-04-29 11:08:13,074 INFO L175 Difference]: Start difference. First operand has 111 places, 108 transitions, 392 flow. Second operand 7 states and 601 transitions. [2025-04-29 11:08:13,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 504 flow [2025-04-29 11:08:13,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 130 transitions, 492 flow, removed 5 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:13,077 INFO L231 Difference]: Finished difference. Result has 118 places, 115 transitions, 429 flow [2025-04-29 11:08:13,077 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=380, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=429, PETRI_PLACES=118, PETRI_TRANSITIONS=115} [2025-04-29 11:08:13,077 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 27 predicate places. [2025-04-29 11:08:13,077 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 115 transitions, 429 flow [2025-04-29 11:08:13,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.2) internal successors, (411), 5 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:13,078 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:13,078 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:13,078 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:08:13,078 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:13,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:13,078 INFO L85 PathProgramCache]: Analyzing trace with hash -637298949, now seen corresponding path program 1 times [2025-04-29 11:08:13,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:13,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488768157] [2025-04-29 11:08:13,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:13,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:13,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-29 11:08:13,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-29 11:08:13,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:13,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:13,176 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:08:13,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:13,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488768157] [2025-04-29 11:08:13,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488768157] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:13,176 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1349819355] [2025-04-29 11:08:13,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:13,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:13,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:13,179 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:13,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:08:13,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-29 11:08:13,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-29 11:08:13,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:13,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:13,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-29 11:08:13,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:13,282 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:08:13,282 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:13,344 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:08:13,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1349819355] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:13,344 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:13,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-04-29 11:08:13,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642127532] [2025-04-29 11:08:13,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:13,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-29 11:08:13,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:13,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-29 11:08:13,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-04-29 11:08:13,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-29 11:08:13,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 115 transitions, 429 flow. Second operand has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:13,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:13,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-29 11:08:13,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:13,548 INFO L116 PetriNetUnfolderBase]: 58/761 cut-off events. [2025-04-29 11:08:13,548 INFO L117 PetriNetUnfolderBase]: For 311/317 co-relation queries the response was YES. [2025-04-29 11:08:13,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1459 conditions, 761 events. 58/761 cut-off events. For 311/317 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4466 event pairs, 14 based on Foata normal form. 14/754 useless extension candidates. Maximal degree in co-relation 594. Up to 94 conditions per place. [2025-04-29 11:08:13,551 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 21 selfloop transitions, 20 changer transitions 0/128 dead transitions. [2025-04-29 11:08:13,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 128 transitions, 569 flow [2025-04-29 11:08:13,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-29 11:08:13,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-29 11:08:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1332 transitions. [2025-04-29 11:08:13,553 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.861021331609567 [2025-04-29 11:08:13,553 INFO L175 Difference]: Start difference. First operand has 118 places, 115 transitions, 429 flow. Second operand 17 states and 1332 transitions. [2025-04-29 11:08:13,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 128 transitions, 569 flow [2025-04-29 11:08:13,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 128 transitions, 567 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-04-29 11:08:13,556 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 560 flow [2025-04-29 11:08:13,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=560, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2025-04-29 11:08:13,557 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 46 predicate places. [2025-04-29 11:08:13,557 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 560 flow [2025-04-29 11:08:13,557 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 78.0) internal successors, (1092), 14 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:13,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:13,558 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:13,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:13,762 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:13,762 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:13,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:13,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1725811209, now seen corresponding path program 1 times [2025-04-29 11:08:13,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:13,763 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813541547] [2025-04-29 11:08:13,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:13,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:13,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-29 11:08:13,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-29 11:08:13,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:13,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:08:13,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:13,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813541547] [2025-04-29 11:08:13,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813541547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:13,871 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992022889] [2025-04-29 11:08:13,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:13,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:13,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:13,873 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:13,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:08:13,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-04-29 11:08:13,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-04-29 11:08:13,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:13,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:13,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-29 11:08:13,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:08:13,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 88 proven. 20 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-04-29 11:08:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992022889] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:14,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 15 [2025-04-29 11:08:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499445430] [2025-04-29 11:08:14,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:14,083 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-29 11:08:14,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:14,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-29 11:08:14,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-04-29 11:08:14,129 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2025-04-29 11:08:14,130 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 560 flow. Second operand has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:14,130 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:14,130 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2025-04-29 11:08:14,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:14,360 INFO L116 PetriNetUnfolderBase]: 64/772 cut-off events. [2025-04-29 11:08:14,360 INFO L117 PetriNetUnfolderBase]: For 551/557 co-relation queries the response was YES. [2025-04-29 11:08:14,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1656 conditions, 772 events. 64/772 cut-off events. For 551/557 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3611 event pairs, 13 based on Foata normal form. 9/761 useless extension candidates. Maximal degree in co-relation 820. Up to 66 conditions per place. [2025-04-29 11:08:14,363 INFO L140 encePairwiseOnDemand]: 82/91 looper letters, 29 selfloop transitions, 45 changer transitions 1/158 dead transitions. [2025-04-29 11:08:14,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 158 transitions, 906 flow [2025-04-29 11:08:14,364 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:14,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:14,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1613 transitions. [2025-04-29 11:08:14,367 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8440607012035584 [2025-04-29 11:08:14,367 INFO L175 Difference]: Start difference. First operand has 137 places, 127 transitions, 560 flow. Second operand 21 states and 1613 transitions. [2025-04-29 11:08:14,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 158 transitions, 906 flow [2025-04-29 11:08:14,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 158 transitions, 888 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-04-29 11:08:14,372 INFO L231 Difference]: Finished difference. Result has 156 places, 146 transitions, 823 flow [2025-04-29 11:08:14,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=823, PETRI_PLACES=156, PETRI_TRANSITIONS=146} [2025-04-29 11:08:14,373 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 65 predicate places. [2025-04-29 11:08:14,374 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 146 transitions, 823 flow [2025-04-29 11:08:14,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 76.86666666666666) internal successors, (1153), 15 states have internal predecessors, (1153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:14,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:14,375 INFO L206 CegarLoopForPetriNet]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:14,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-29 11:08:14,575 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-29 11:08:14,575 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:14,576 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash -560500165, now seen corresponding path program 2 times [2025-04-29 11:08:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:14,576 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046220279] [2025-04-29 11:08:14,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:14,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:14,587 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-04-29 11:08:14,595 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:08:14,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:08:14,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:08:14,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:08:14,796 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046220279] [2025-04-29 11:08:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046220279] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:08:14,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226382841] [2025-04-29 11:08:14,797 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:08:14,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:08:14,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:08:14,799 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:08:14,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:08:14,848 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 120 statements into 2 equivalence classes. [2025-04-29 11:08:14,877 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 120 of 120 statements. [2025-04-29 11:08:14,877 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:08:14,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:08:14,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-29 11:08:14,881 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:08:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:08:14,976 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:08:15,119 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 135 proven. 135 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-29 11:08:15,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226382841] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:08:15,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:08:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 17 [2025-04-29 11:08:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502884147] [2025-04-29 11:08:15,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:08:15,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-29 11:08:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:08:15,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-29 11:08:15,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2025-04-29 11:08:15,157 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-04-29 11:08:15,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 146 transitions, 823 flow. Second operand has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:15,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:15,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-04-29 11:08:15,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:15,366 INFO L116 PetriNetUnfolderBase]: 37/455 cut-off events. [2025-04-29 11:08:15,367 INFO L117 PetriNetUnfolderBase]: For 500/502 co-relation queries the response was YES. [2025-04-29 11:08:15,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 455 events. 37/455 cut-off events. For 500/502 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1575 event pairs, 5 based on Foata normal form. 1/446 useless extension candidates. Maximal degree in co-relation 752. Up to 53 conditions per place. [2025-04-29 11:08:15,368 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 35 selfloop transitions, 34 changer transitions 0/153 dead transitions. [2025-04-29 11:08:15,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 153 transitions, 1011 flow [2025-04-29 11:08:15,369 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-29 11:08:15,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-29 11:08:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1623 transitions. [2025-04-29 11:08:15,373 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8492935635792779 [2025-04-29 11:08:15,373 INFO L175 Difference]: Start difference. First operand has 156 places, 146 transitions, 823 flow. Second operand 21 states and 1623 transitions. [2025-04-29 11:08:15,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 153 transitions, 1011 flow [2025-04-29 11:08:15,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 153 transitions, 911 flow, removed 32 selfloop flow, removed 7 redundant places. [2025-04-29 11:08:15,380 INFO L231 Difference]: Finished difference. Result has 172 places, 146 transitions, 860 flow [2025-04-29 11:08:15,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=705, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=860, PETRI_PLACES=172, PETRI_TRANSITIONS=146} [2025-04-29 11:08:15,381 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 81 predicate places. [2025-04-29 11:08:15,381 INFO L485 AbstractCegarLoop]: Abstraction has has 172 places, 146 transitions, 860 flow [2025-04-29 11:08:15,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 77.52941176470588) internal successors, (1318), 17 states have internal predecessors, (1318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:08:15,382 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:15,382 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:15,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:08:15,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-29 11:08:15,583 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr0ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr3ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:15,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1432740189, now seen corresponding path program 1 times [2025-04-29 11:08:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:15,584 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548888564] [2025-04-29 11:08:15,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:15,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-29 11:08:15,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-29 11:08:15,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:15,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:15,615 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:15,618 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-04-29 11:08:15,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-04-29 11:08:15,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:15,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:15,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:15,662 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:15,663 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-29 11:08:15,664 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-29 11:08:15,665 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location fErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-29 11:08:15,665 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:08:15,665 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:15,751 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:15,751 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:15,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:15 BasicIcfg [2025-04-29 11:08:15,755 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:15,755 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:15,755 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:15,755 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:15,756 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:08:09" (3/4) ... [2025-04-29 11:08:15,757 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:15,824 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 32. [2025-04-29 11:08:15,872 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:15,872 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:15,872 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:15,873 INFO L158 Benchmark]: Toolchain (without parser) took 7297.47ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 111.8MB in the beginning and 191.2MB in the end (delta: -79.4MB). Peak memory consumption was 80.6MB. Max. memory is 16.1GB. [2025-04-29 11:08:15,873 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:15,873 INFO L158 Benchmark]: CACSL2BoogieTranslator took 192.25ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:15,873 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.12ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:15,874 INFO L158 Benchmark]: Boogie Preprocessor took 16.64ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:15,874 INFO L158 Benchmark]: RCFGBuilder took 270.63ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 82.2MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:15,874 INFO L158 Benchmark]: TraceAbstraction took 6675.20ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.0MB in the beginning and 211.2MB in the end (delta: -130.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2025-04-29 11:08:15,874 INFO L158 Benchmark]: Witness Printer took 116.87ms. Allocated memory is still 302.0MB. Free memory was 208.0MB in the beginning and 191.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:15,875 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.20ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 192.25ms. Allocated memory is still 142.6MB. Free memory was 111.8MB in the beginning and 97.7MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.12ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 96.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 16.64ms. Allocated memory is still 142.6MB. Free memory was 96.7MB in the beginning and 95.6MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 270.63ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 82.2MB in the end (delta: 13.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 6675.20ms. Allocated memory was 142.6MB in the beginning and 302.0MB in the end (delta: 159.4MB). Free memory was 81.0MB in the beginning and 211.2MB in the end (delta: -130.2MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 116.87ms. Allocated memory is still 302.0MB. Free memory was 208.0MB in the beginning and 191.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 40]: Data race detected Data race detected The following path leads to a data race: [L11] 0 int glob; VAL [glob=0] [L12] 0 pthread_mutex_t *p, *q; VAL [glob=0, p={0:0}, q={0:0}] [L24] 0 pthread_t t1, t2; VAL [glob=0, p={0:0}, q={0:0}] [L25] 0 int i; VAL [glob=0, p={0:0}, q={0:0}] [L26] 0 pthread_mutex_t *a; VAL [glob=0, p={0:0}, q={0:0}] [L28] 0 i=0 VAL [glob=0, i=0, p={0:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-2:0}, glob=0, i=0, p={0:0}, q={0:0}] [L28] 0 i++ VAL [a={-2:0}, glob=0, i=1, p={0:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-3:0}, glob=0, i=1, p={0:0}, q={0:0}] [L28] 0 i++ VAL [a={-3:0}, glob=0, i=2, p={0:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-4:0}, glob=0, i=2, p={0:0}, q={0:0}] [L28] 0 i++ VAL [a={-4:0}, glob=0, i=3, p={0:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={0:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L31] COND TRUE 0 i==3 VAL [a={-5:0}, glob=0, i=3, p={0:0}, q={0:0}] [L32] 0 p = a VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-5:0}, glob=0, i=3, p={-5:0}, q={0:0}] [L28] 0 i++ VAL [a={-5:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-6:0}, glob=0, i=4, p={-5:0}, q={0:0}] [L28] 0 i++ VAL [a={-6:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-7:0}, glob=0, i=5, p={-5:0}, q={0:0}] [L28] 0 i++ VAL [a={-7:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-8:0}, glob=0, i=6, p={-5:0}, q={0:0}] [L28] 0 i++ VAL [a={-8:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={0:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L33] COND TRUE 0 i==7 VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={0:0}] [L34] 0 q = a VAL [a={-9:0}, glob=0, i=7, p={-5:0}, q={-9:0}] [L28] 0 i++ VAL [a={-9:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-10:0}, glob=0, i=8, p={-5:0}, q={-9:0}] [L28] 0 i++ VAL [a={-10:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L28] COND TRUE 0 i < 10 VAL [glob=0, p={-5:0}, q={-9:0}] [L29] 0 a = malloc(sizeof(pthread_mutex_t)) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L31] COND FALSE 0 !(i==3) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L33] COND FALSE 0 !(i==7) VAL [a={-11:0}, glob=0, i=9, p={-5:0}, q={-9:0}] [L28] 0 i++ VAL [a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}] [L28] COND FALSE 0 !(i < 10) VAL [glob=0, p={-5:0}, q={-9:0}] [L37] FCALL, FORK 0 pthread_create(&t1, 0, f, 0) VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L39] 0 pthread_mutex_lock(p) VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1] [L16] 1 pthread_mutex_lock(q) VAL [\at(x, Pre)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L17] 1 glob++ VAL [\at(x, Pre)={0:0}, glob=0, p={-5:0}, q={-9:0}, x={0:0}] [L40] 0 glob++ VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=0, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] [L17] 1 glob++ VAL [\at(x, Pre)={0:0}, glob=1, p={-5:0}, q={-9:0}, x={0:0}] [L40] 0 glob++ VAL [\at(x, Pre)={0:0}, a={-11:0}, glob=1, i=10, p={-5:0}, q={-9:0}, t1=-1, x={0:0}] Now there is a data race on ~glob~0 between C: glob++ [17] and C: glob++ [40] - UnprovableResult [Line: 16]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 39]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 32]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 40]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 41]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 115 locations, 116 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: 6.5s, OverallIterations: 14, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 399 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 232 mSDsluCounter, 256 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 881 IncrementalHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 102 mSDtfsCounter, 881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1034 GetRequests, 903 SyntacticMatches, 10 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=860occurred in iteration=13, InterpolantAutomatonStates: 101, 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.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 1400 NumberOfCodeBlocks, 1370 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1574 ConstructedInterpolants, 0 QuantifiedInterpolants, 2823 SizeOfPredicates, 22 NumberOfNonLiveVariables, 1509 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 28 InterpolantComputations, 9 PerfectInterpolantSequences, 1038/1596 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:08:15,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)