./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread/sync01.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/sync01.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8f929a317f167560539ae4b4d441a695b43dc484839e0d977f902275d758b932 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:32:11,437 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:32:11,479 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:32:11,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:32:11,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:32:11,509 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:32:11,509 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:32:11,509 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:32:11,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:32:11,510 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:32:11,510 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:32:11,510 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:32:11,511 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:11,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:11,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:32:11,511 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:32:11,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:32:11,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:32:11,512 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 -> 8f929a317f167560539ae4b4d441a695b43dc484839e0d977f902275d758b932 [2025-04-30 10:32:11,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:32:11,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:32:11,752 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:32:11,753 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:32:11,753 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:32:11,754 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/sync01.i [2025-04-30 10:32:13,053 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511f18b31/af0e5b3c92ae49ee9e8b65973ce9efe8/FLAGab3cd772d [2025-04-30 10:32:13,310 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:32:13,310 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/sync01.i [2025-04-30 10:32:13,326 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511f18b31/af0e5b3c92ae49ee9e8b65973ce9efe8/FLAGab3cd772d [2025-04-30 10:32:14,103 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/511f18b31/af0e5b3c92ae49ee9e8b65973ce9efe8 [2025-04-30 10:32:14,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:32:14,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:32:14,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:32:14,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:32:14,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:32:14,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,110 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d3ca17d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14, skipping insertion in model container [2025-04-30 10:32:14,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:32:14,485 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:32:14,508 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:32:14,579 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:32:14,630 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:32:14,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14 WrapperNode [2025-04-30 10:32:14,632 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:32:14,633 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:32:14,633 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:32:14,633 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:32:14,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,668 INFO L138 Inliner]: procedures = 268, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 260 [2025-04-30 10:32:14,668 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:32:14,669 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:32:14,669 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:32:14,669 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:32:14,673 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,677 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,677 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,688 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,693 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,699 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,700 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,701 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:32:14,709 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:32:14,709 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:32:14,709 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:32:14,710 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (1/1) ... [2025-04-30 10:32:14,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:32:14,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:32:14,732 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:32:14,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:32:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:32:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-30 10:32:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-30 10:32:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-30 10:32:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-30 10:32:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:32:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:32:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:32:14,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:32:14,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:32:14,749 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:32:14,868 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:32:14,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:32:15,134 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:32:15,134 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:32:15,157 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:32:15,158 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-30 10:32:15,158 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:32:15 BoogieIcfgContainer [2025-04-30 10:32:15,158 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:32:15,159 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:32:15,159 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:32:15,162 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:32:15,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:32:14" (1/3) ... [2025-04-30 10:32:15,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee16ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:32:15, skipping insertion in model container [2025-04-30 10:32:15,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:32:14" (2/3) ... [2025-04-30 10:32:15,163 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ee16ec4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:32:15, skipping insertion in model container [2025-04-30 10:32:15,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:32:15" (3/3) ... [2025-04-30 10:32:15,166 INFO L128 eAbstractionObserver]: Analyzing ICFG sync01.i [2025-04-30 10:32:15,174 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:32:15,175 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sync01.i that has 3 procedures, 317 locations, 320 edges, 1 initial locations, 2 loop locations, and 8 error locations. [2025-04-30 10:32:15,176 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:32:15,238 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:32:15,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 323 places, 322 transitions, 658 flow [2025-04-30 10:32:15,355 INFO L116 PetriNetUnfolderBase]: 6/320 cut-off events. [2025-04-30 10:32:15,357 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:32:15,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 329 conditions, 320 events. 6/320 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 129 event pairs, 0 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2025-04-30 10:32:15,360 INFO L82 GeneralOperation]: Start removeDead. Operand has 323 places, 322 transitions, 658 flow [2025-04-30 10:32:15,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 310 places, 307 transitions, 626 flow [2025-04-30 10:32:15,374 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:32:15,384 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;@18f3f3a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:32:15,384 INFO L341 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-04-30 10:32:15,424 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:32:15,426 INFO L116 PetriNetUnfolderBase]: 0/235 cut-off events. [2025-04-30 10:32:15,426 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:32:15,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:15,426 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:15,427 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-30 10:32:15,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:15,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2124819626, now seen corresponding path program 1 times [2025-04-30 10:32:15,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:15,436 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854817550] [2025-04-30 10:32:15,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:15,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:15,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-04-30 10:32:15,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-04-30 10:32:15,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:15,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:15,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:15,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:15,775 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854817550] [2025-04-30 10:32:15,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854817550] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:15,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032304089] [2025-04-30 10:32:15,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:15,783 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:15,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:15,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:15,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:15,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 322 [2025-04-30 10:32:15,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 307 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:15,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:15,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 322 [2025-04-30 10:32:15,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:15,995 INFO L116 PetriNetUnfolderBase]: 72/549 cut-off events. [2025-04-30 10:32:15,995 INFO L117 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-04-30 10:32:15,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 728 conditions, 549 events. 72/549 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1552 event pairs, 54 based on Foata normal form. 0/501 useless extension candidates. Maximal degree in co-relation 428. Up to 149 conditions per place. [2025-04-30 10:32:16,002 INFO L140 encePairwiseOnDemand]: 317/322 looper letters, 22 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-04-30 10:32:16,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 311 places, 304 transitions, 668 flow [2025-04-30 10:32:16,003 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:16,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:16,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 900 transitions. [2025-04-30 10:32:16,015 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9316770186335404 [2025-04-30 10:32:16,018 INFO L175 Difference]: Start difference. First operand has 310 places, 307 transitions, 626 flow. Second operand 3 states and 900 transitions. [2025-04-30 10:32:16,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 311 places, 304 transitions, 668 flow [2025-04-30 10:32:16,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 304 transitions, 660 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-30 10:32:16,029 INFO L231 Difference]: Finished difference. Result has 307 places, 304 transitions, 616 flow [2025-04-30 10:32:16,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=307, PETRI_TRANSITIONS=304} [2025-04-30 10:32:16,034 INFO L279 CegarLoopForPetriNet]: 310 programPoint places, -3 predicate places. [2025-04-30 10:32:16,035 INFO L485 AbstractCegarLoop]: Abstraction has has 307 places, 304 transitions, 616 flow [2025-04-30 10:32:16,035 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:16,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:16,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:16,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:32:16,036 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-30 10:32:16,037 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:16,038 INFO L85 PathProgramCache]: Analyzing trace with hash -663787489, now seen corresponding path program 1 times [2025-04-30 10:32:16,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:16,038 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427622438] [2025-04-30 10:32:16,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:16,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:16,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-04-30 10:32:16,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-04-30 10:32:16,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:16,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:16,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:16,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:16,173 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427622438] [2025-04-30 10:32:16,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427622438] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:16,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:16,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:16,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847118468] [2025-04-30 10:32:16,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:16,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:16,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:16,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:16,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:16,201 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 287 out of 322 [2025-04-30 10:32:16,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 288.6666666666667) internal successors, (866), 3 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:16,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:16,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 287 of 322 [2025-04-30 10:32:16,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:16,302 INFO L116 PetriNetUnfolderBase]: 149/764 cut-off events. [2025-04-30 10:32:16,302 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-30 10:32:16,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1090 conditions, 764 events. 149/764 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 3084 event pairs, 51 based on Foata normal form. 1/710 useless extension candidates. Maximal degree in co-relation 847. Up to 209 conditions per place. [2025-04-30 10:32:16,305 INFO L140 encePairwiseOnDemand]: 306/322 looper letters, 36 selfloop transitions, 10 changer transitions 2/323 dead transitions. [2025-04-30 10:32:16,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 323 transitions, 752 flow [2025-04-30 10:32:16,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:16,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:16,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 914 transitions. [2025-04-30 10:32:16,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9461697722567288 [2025-04-30 10:32:16,308 INFO L175 Difference]: Start difference. First operand has 307 places, 304 transitions, 616 flow. Second operand 3 states and 914 transitions. [2025-04-30 10:32:16,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 323 transitions, 752 flow [2025-04-30 10:32:16,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 323 transitions, 748 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:16,312 INFO L231 Difference]: Finished difference. Result has 308 places, 311 transitions, 693 flow [2025-04-30 10:32:16,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=693, PETRI_PLACES=308, PETRI_TRANSITIONS=311} [2025-04-30 10:32:16,313 INFO L279 CegarLoopForPetriNet]: 310 programPoint places, -2 predicate places. [2025-04-30 10:32:16,313 INFO L485 AbstractCegarLoop]: Abstraction has has 308 places, 311 transitions, 693 flow [2025-04-30 10:32:16,314 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 288.6666666666667) internal successors, (866), 3 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:16,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:16,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:16,314 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:32:16,314 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-30 10:32:16,315 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash 6922112, now seen corresponding path program 1 times [2025-04-30 10:32:16,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:16,315 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095047397] [2025-04-30 10:32:16,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:16,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:16,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-04-30 10:32:16,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-04-30 10:32:16,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:16,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:16,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:16,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:16,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095047397] [2025-04-30 10:32:16,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095047397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:16,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:16,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:32:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086444229] [2025-04-30 10:32:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:16,496 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:16,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:16,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:16,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:16,513 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 297 out of 322 [2025-04-30 10:32:16,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 311 transitions, 693 flow. Second operand has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:16,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:16,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 297 of 322 [2025-04-30 10:32:16,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:16,578 INFO L116 PetriNetUnfolderBase]: 46/489 cut-off events. [2025-04-30 10:32:16,579 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-30 10:32:16,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 652 conditions, 489 events. 46/489 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1100 event pairs, 18 based on Foata normal form. 6/477 useless extension candidates. Maximal degree in co-relation 360. Up to 50 conditions per place. [2025-04-30 10:32:16,581 INFO L140 encePairwiseOnDemand]: 318/322 looper letters, 15 selfloop transitions, 2 changer transitions 0/306 dead transitions. [2025-04-30 10:32:16,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 306 transitions, 701 flow [2025-04-30 10:32:16,582 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:16,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:16,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-04-30 10:32:16,586 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2025-04-30 10:32:16,586 INFO L175 Difference]: Start difference. First operand has 308 places, 311 transitions, 693 flow. Second operand 3 states and 910 transitions. [2025-04-30 10:32:16,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 306 transitions, 701 flow [2025-04-30 10:32:16,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 306 transitions, 687 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:16,593 INFO L231 Difference]: Finished difference. Result has 303 places, 303 transitions, 655 flow [2025-04-30 10:32:16,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=303} [2025-04-30 10:32:16,594 INFO L279 CegarLoopForPetriNet]: 310 programPoint places, -7 predicate places. [2025-04-30 10:32:16,594 INFO L485 AbstractCegarLoop]: Abstraction has has 303 places, 303 transitions, 655 flow [2025-04-30 10:32:16,594 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 299.0) internal successors, (897), 3 states have internal predecessors, (897), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:16,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:16,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:16,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:32:16,595 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-30 10:32:16,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:16,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1632736794, now seen corresponding path program 1 times [2025-04-30 10:32:16,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:16,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664683008] [2025-04-30 10:32:16,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:16,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:16,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-04-30 10:32:16,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-04-30 10:32:16,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:16,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:16,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:16,700 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664683008] [2025-04-30 10:32:16,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664683008] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:16,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:16,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:16,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470954714] [2025-04-30 10:32:16,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:16,702 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:16,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:16,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:16,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:16,740 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 322 [2025-04-30 10:32:16,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 303 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:16,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:16,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 322 [2025-04-30 10:32:16,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:16,822 INFO L116 PetriNetUnfolderBase]: 115/636 cut-off events. [2025-04-30 10:32:16,822 INFO L117 PetriNetUnfolderBase]: For 67/76 co-relation queries the response was YES. [2025-04-30 10:32:16,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 636 events. 115/636 cut-off events. For 67/76 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1893 event pairs, 41 based on Foata normal form. 4/602 useless extension candidates. Maximal degree in co-relation 667. Up to 185 conditions per place. [2025-04-30 10:32:16,825 INFO L140 encePairwiseOnDemand]: 315/322 looper letters, 26 selfloop transitions, 10 changer transitions 2/316 dead transitions. [2025-04-30 10:32:16,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 316 transitions, 770 flow [2025-04-30 10:32:16,825 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 910 transitions. [2025-04-30 10:32:16,827 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9420289855072463 [2025-04-30 10:32:16,827 INFO L175 Difference]: Start difference. First operand has 303 places, 303 transitions, 655 flow. Second operand 3 states and 910 transitions. [2025-04-30 10:32:16,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 316 transitions, 770 flow [2025-04-30 10:32:16,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 316 transitions, 766 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:32:16,832 INFO L231 Difference]: Finished difference. Result has 305 places, 311 transitions, 737 flow [2025-04-30 10:32:16,833 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=737, PETRI_PLACES=305, PETRI_TRANSITIONS=311} [2025-04-30 10:32:16,833 INFO L279 CegarLoopForPetriNet]: 310 programPoint places, -5 predicate places. [2025-04-30 10:32:16,833 INFO L485 AbstractCegarLoop]: Abstraction has has 305 places, 311 transitions, 737 flow [2025-04-30 10:32:16,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 296.0) internal successors, (888), 3 states have internal predecessors, (888), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:16,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:16,834 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:16,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:32:16,834 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-30 10:32:16,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash 779923869, now seen corresponding path program 1 times [2025-04-30 10:32:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:16,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151159675] [2025-04-30 10:32:16,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:16,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 265 statements into 1 equivalence classes. [2025-04-30 10:32:16,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 265 of 265 statements. [2025-04-30 10:32:16,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:16,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:17,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:17,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:17,085 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151159675] [2025-04-30 10:32:17,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151159675] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:17,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:17,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:32:17,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860808897] [2025-04-30 10:32:17,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:17,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:17,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:17,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:17,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:17,099 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 322 [2025-04-30 10:32:17,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 311 transitions, 737 flow. Second operand has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:17,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:17,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 322 [2025-04-30 10:32:17,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:17,147 INFO L116 PetriNetUnfolderBase]: 6/333 cut-off events. [2025-04-30 10:32:17,147 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:32:17,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 405 conditions, 333 events. 6/333 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 146 event pairs, 1 based on Foata normal form. 4/336 useless extension candidates. Maximal degree in co-relation 327. Up to 16 conditions per place. [2025-04-30 10:32:17,148 INFO L140 encePairwiseOnDemand]: 316/322 looper letters, 5 selfloop transitions, 5 changer transitions 8/296 dead transitions. [2025-04-30 10:32:17,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 666 flow [2025-04-30 10:32:17,148 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:17,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:17,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 924 transitions. [2025-04-30 10:32:17,150 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9565217391304348 [2025-04-30 10:32:17,150 INFO L175 Difference]: Start difference. First operand has 305 places, 311 transitions, 737 flow. Second operand 3 states and 924 transitions. [2025-04-30 10:32:17,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 666 flow [2025-04-30 10:32:17,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 296 transitions, 636 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-30 10:32:17,155 INFO L231 Difference]: Finished difference. Result has 300 places, 287 transitions, 602 flow [2025-04-30 10:32:17,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=300, PETRI_TRANSITIONS=287} [2025-04-30 10:32:17,157 INFO L279 CegarLoopForPetriNet]: 310 programPoint places, -10 predicate places. [2025-04-30 10:32:17,157 INFO L485 AbstractCegarLoop]: Abstraction has has 300 places, 287 transitions, 602 flow [2025-04-30 10:32:17,158 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 305.0) internal successors, (915), 3 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:17,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:32:17,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:32:17,159 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:32:17,159 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread2Err0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-30 10:32:17,159 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:32:17,161 INFO L85 PathProgramCache]: Analyzing trace with hash 577931260, now seen corresponding path program 1 times [2025-04-30 10:32:17,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:32:17,162 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277338803] [2025-04-30 10:32:17,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:32:17,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:32:17,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-04-30 10:32:17,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-04-30 10:32:17,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:32:17,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:32:17,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:32:17,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:32:17,254 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277338803] [2025-04-30 10:32:17,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277338803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:32:17,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:32:17,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:32:17,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58726651] [2025-04-30 10:32:17,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:32:17,254 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:32:17,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:32:17,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:32:17,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:32:17,289 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 322 [2025-04-30 10:32:17,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 287 transitions, 602 flow. Second operand has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:17,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:32:17,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 322 [2025-04-30 10:32:17,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:32:17,321 INFO L116 PetriNetUnfolderBase]: 8/324 cut-off events. [2025-04-30 10:32:17,321 INFO L117 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-04-30 10:32:17,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 324 events. 8/324 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 157 event pairs, 4 based on Foata normal form. 1/323 useless extension candidates. Maximal degree in co-relation 272. Up to 36 conditions per place. [2025-04-30 10:32:17,322 INFO L140 encePairwiseOnDemand]: 320/322 looper letters, 0 selfloop transitions, 0 changer transitions 286/286 dead transitions. [2025-04-30 10:32:17,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 286 transitions, 634 flow [2025-04-30 10:32:17,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:32:17,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:32:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 895 transitions. [2025-04-30 10:32:17,332 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9265010351966874 [2025-04-30 10:32:17,332 INFO L175 Difference]: Start difference. First operand has 300 places, 287 transitions, 602 flow. Second operand 3 states and 895 transitions. [2025-04-30 10:32:17,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 286 transitions, 634 flow [2025-04-30 10:32:17,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 286 transitions, 629 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-30 10:32:17,336 INFO L231 Difference]: Finished difference. Result has 292 places, 0 transitions, 0 flow [2025-04-30 10:32:17,336 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=322, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=286, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=286, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=292, PETRI_TRANSITIONS=0} [2025-04-30 10:32:17,337 INFO L279 CegarLoopForPetriNet]: 310 programPoint places, -18 predicate places. [2025-04-30 10:32:17,338 INFO L485 AbstractCegarLoop]: Abstraction has has 292 places, 0 transitions, 0 flow [2025-04-30 10:32:17,338 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 297.6666666666667) internal successors, (893), 3 states have internal predecessors, (893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-04-30 10:32:17,340 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2025-04-30 10:32:17,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2025-04-30 10:32:17,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-04-30 10:32:17,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-04-30 10:32:17,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-04-30 10:32:17,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-04-30 10:32:17,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-04-30 10:32:17,341 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-04-30 10:32:17,342 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:32:17,342 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-30 10:32:17,345 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:32:17,345 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:32:17,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:32:17 BasicIcfg [2025-04-30 10:32:17,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:32:17,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:32:17,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:32:17,350 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:32:17,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:32:15" (3/4) ... [2025-04-30 10:32:17,351 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:32:17,353 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-04-30 10:32:17,354 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-04-30 10:32:17,359 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2025-04-30 10:32:17,360 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-04-30 10:32:17,361 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:32:17,361 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:32:17,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:32:17,428 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:32:17,428 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:32:17,429 INFO L158 Benchmark]: Toolchain (without parser) took 3322.36ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 127.1MB in the beginning and 149.3MB in the end (delta: -22.2MB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2025-04-30 10:32:17,430 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 192.9MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:32:17,430 INFO L158 Benchmark]: CACSL2BoogieTranslator took 525.03ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 94.0MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-30 10:32:17,431 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.69ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 91.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:32:17,431 INFO L158 Benchmark]: Boogie Preprocessor took 39.75ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 88.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:32:17,432 INFO L158 Benchmark]: RCFGBuilder took 449.02ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 63.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:32:17,432 INFO L158 Benchmark]: TraceAbstraction took 2189.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 63.1MB in the beginning and 156.0MB in the end (delta: -92.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. [2025-04-30 10:32:17,432 INFO L158 Benchmark]: Witness Printer took 78.20ms. Allocated memory is still 201.3MB. Free memory was 156.0MB in the beginning and 149.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:32:17,433 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.15ms. Allocated memory is still 192.9MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 525.03ms. Allocated memory is still 167.8MB. Free memory was 126.8MB in the beginning and 94.0MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.69ms. Allocated memory is still 167.8MB. Free memory was 94.0MB in the beginning and 91.1MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.75ms. Allocated memory is still 167.8MB. Free memory was 91.1MB in the beginning and 88.6MB in the end (delta: 2.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 449.02ms. Allocated memory is still 167.8MB. Free memory was 88.6MB in the beginning and 63.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2189.23ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 63.1MB in the beginning and 156.0MB in the end (delta: -92.9MB). Peak memory consumption was 47.7MB. Max. memory is 16.1GB. * Witness Printer took 78.20ms. Allocated memory is still 201.3MB. Free memory was 156.0MB in the beginning and 149.3MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 936]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 938]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 938]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 946]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 948]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 956]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 964]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 369 locations, 378 edges, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 320 IncrementalHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 62 mSDtfsCounter, 320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=737occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1535 ConstructedInterpolants, 0 QuantifiedInterpolants, 1585 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-30 10:32:17,446 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 Result: TRUE