./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/time_var_mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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 ../sv-benchmarks/c/pthread-atomic/time_var_mutex.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 1985bb251db70a1c798d345be7e1671f9dcc6a359b969ca99d23e0003d9a3770 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 21:36:23,196 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 21:36:23,245 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 21:36:23,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 21:36:23,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 21:36:23,271 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 21:36:23,272 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 21:36:23,272 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 21:36:23,272 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 21:36:23,272 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 21:36:23,273 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 21:36:23,273 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 21:36:23,273 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 21:36:23,273 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 21:36:23,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 21:36:23,273 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 21:36:23,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 21:36:23,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 21:36:23,274 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 21:36:23,275 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 21:36:23,275 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 21:36:23,275 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 21:36:23,275 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 21:36:23,275 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:36:23,275 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 21:36:23,275 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 21:36:23,275 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 21:36:23,275 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 21:36:23,276 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 21:36:23,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 21:36:23,276 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 21:36:23,276 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 21:36:23,276 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 21:36:23,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 21:36:23,276 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 -> 1985bb251db70a1c798d345be7e1671f9dcc6a359b969ca99d23e0003d9a3770 [2025-03-08 21:36:23,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 21:36:23,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 21:36:23,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 21:36:23,499 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 21:36:23,500 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 21:36:23,500 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2025-03-08 21:36:24,591 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9286169d/8e1fd589e5054a2ab935e36b63cae674/FLAG3f5c7fc25 [2025-03-08 21:36:24,840 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 21:36:24,840 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2025-03-08 21:36:24,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9286169d/8e1fd589e5054a2ab935e36b63cae674/FLAG3f5c7fc25 [2025-03-08 21:36:25,156 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d9286169d/8e1fd589e5054a2ab935e36b63cae674 [2025-03-08 21:36:25,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 21:36:25,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 21:36:25,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:25,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 21:36:25,162 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 21:36:25,163 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53b94d1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25, skipping insertion in model container [2025-03-08 21:36:25,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,188 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 21:36:25,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:25,450 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 21:36:25,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 21:36:25,526 INFO L204 MainTranslator]: Completed translation [2025-03-08 21:36:25,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25 WrapperNode [2025-03-08 21:36:25,528 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 21:36:25,529 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:25,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 21:36:25,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 21:36:25,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,546 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,560 INFO L138 Inliner]: procedures = 169, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2025-03-08 21:36:25,560 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 21:36:25,560 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 21:36:25,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 21:36:25,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 21:36:25,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,566 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,569 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,573 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,574 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 21:36:25,581 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 21:36:25,581 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 21:36:25,581 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 21:36:25,582 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (1/1) ... [2025-03-08 21:36:25,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 21:36:25,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 21:36:25,604 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-03-08 21:36:25,606 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-03-08 21:36:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure allocator [2025-03-08 21:36:25,622 INFO L138 BoogieDeclarations]: Found implementation of procedure allocator [2025-03-08 21:36:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure de_allocator [2025-03-08 21:36:25,622 INFO L138 BoogieDeclarations]: Found implementation of procedure de_allocator [2025-03-08 21:36:25,622 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 21:36:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 21:36:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 21:36:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 21:36:25,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 21:36:25,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 21:36:25,624 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 21:36:25,716 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 21:36:25,717 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 21:36:25,897 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 21:36:25,897 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 21:36:25,923 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 21:36:25,924 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 21:36:25,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:25 BoogieIcfgContainer [2025-03-08 21:36:25,924 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 21:36:25,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 21:36:25,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 21:36:25,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 21:36:25,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 09:36:25" (1/3) ... [2025-03-08 21:36:25,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:25, skipping insertion in model container [2025-03-08 21:36:25,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 09:36:25" (2/3) ... [2025-03-08 21:36:25,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62c775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 09:36:25, skipping insertion in model container [2025-03-08 21:36:25,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:25" (3/3) ... [2025-03-08 21:36:25,930 INFO L128 eAbstractionObserver]: Analyzing ICFG time_var_mutex.i [2025-03-08 21:36:25,940 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 21:36:25,941 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG time_var_mutex.i that has 3 procedures, 131 locations, 1 initial locations, 0 loop locations, and 10 error locations. [2025-03-08 21:36:25,942 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 21:36:25,990 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 21:36:26,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 288 flow [2025-03-08 21:36:26,058 INFO L124 PetriNetUnfolderBase]: 7/135 cut-off events. [2025-03-08 21:36:26,060 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-08 21:36:26,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 135 events. 7/135 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 238 event pairs, 0 based on Foata normal form. 0/118 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2025-03-08 21:36:26,064 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 288 flow [2025-03-08 21:36:26,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 130 transitions, 269 flow [2025-03-08 21:36:26,075 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 21:36:26,086 INFO L333 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;@34655dd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 21:36:26,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-08 21:36:26,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 21:36:26,094 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-03-08 21:36:26,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 21:36:26,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:26,095 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:26,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:26,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:26,099 INFO L85 PathProgramCache]: Analyzing trace with hash -251608647, now seen corresponding path program 1 times [2025-03-08 21:36:26,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:26,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860479042] [2025-03-08 21:36:26,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:26,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:26,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 21:36:26,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 21:36:26,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:26,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:26,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-03-08 21:36:26,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:26,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860479042] [2025-03-08 21:36:26,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860479042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:26,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:26,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:26,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954502785] [2025-03-08 21:36:26,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:26,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:26,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:26,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:26,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:26,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-03-08 21:36:26,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 130 transitions, 269 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-03-08 21:36:26,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:26,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-03-08 21:36:26,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:26,421 INFO L124 PetriNetUnfolderBase]: 29/337 cut-off events. [2025-03-08 21:36:26,421 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-08 21:36:26,422 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 337 events. 29/337 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1515 event pairs, 20 based on Foata normal form. 30/320 useless extension candidates. Maximal degree in co-relation 359. Up to 53 conditions per place. [2025-03-08 21:36:26,424 INFO L140 encePairwiseOnDemand]: 128/137 looper letters, 17 selfloop transitions, 2 changer transitions 1/124 dead transitions. [2025-03-08 21:36:26,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 301 flow [2025-03-08 21:36:26,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-03-08 21:36:26,434 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8978102189781022 [2025-03-08 21:36:26,435 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 269 flow. Second operand 3 states and 369 transitions. [2025-03-08 21:36:26,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 301 flow [2025-03-08 21:36:26,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 293 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:36:26,442 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 244 flow [2025-03-08 21:36:26,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-03-08 21:36:26,446 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-03-08 21:36:26,446 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 244 flow [2025-03-08 21:36:26,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-03-08 21:36:26,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:26,447 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-03-08 21:36:26,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 21:36:26,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:26,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:26,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1277733681, now seen corresponding path program 1 times [2025-03-08 21:36:26,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:26,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264901761] [2025-03-08 21:36:26,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:26,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:26,463 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 21:36:26,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 21:36:26,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:26,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:26,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:26,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:26,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264901761] [2025-03-08 21:36:26,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264901761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:26,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:26,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:26,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695464957] [2025-03-08 21:36:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:26,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:26,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:26,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:26,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:26,533 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-03-08 21:36:26,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-03-08 21:36:26,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:26,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-03-08 21:36:26,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:26,622 INFO L124 PetriNetUnfolderBase]: 53/556 cut-off events. [2025-03-08 21:36:26,623 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-08 21:36:26,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 556 events. 53/556 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3189 event pairs, 24 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 550. Up to 75 conditions per place. [2025-03-08 21:36:26,626 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-03-08 21:36:26,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 307 flow [2025-03-08 21:36:26,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:26,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-08 21:36:26,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856447688564477 [2025-03-08 21:36:26,630 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 244 flow. Second operand 3 states and 364 transitions. [2025-03-08 21:36:26,630 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 307 flow [2025-03-08 21:36:26,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:26,633 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 264 flow [2025-03-08 21:36:26,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=123, PETRI_TRANSITIONS=119} [2025-03-08 21:36:26,634 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-03-08 21:36:26,634 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 264 flow [2025-03-08 21:36:26,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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-03-08 21:36:26,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:26,634 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] [2025-03-08 21:36:26,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 21:36:26,635 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting allocatorErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:26,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1450695756, now seen corresponding path program 1 times [2025-03-08 21:36:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742020238] [2025-03-08 21:36:26,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:26,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:26,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 21:36:26,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 21:36:26,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:26,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:26,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:26,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742020238] [2025-03-08 21:36:26,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742020238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:26,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:26,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:26,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021133868] [2025-03-08 21:36:26,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:26,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:26,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:26,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:26,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:26,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-03-08 21:36:26,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 119 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-03-08 21:36:26,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:26,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-03-08 21:36:26,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:26,787 INFO L124 PetriNetUnfolderBase]: 27/364 cut-off events. [2025-03-08 21:36:26,787 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-08 21:36:26,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 474 conditions, 364 events. 27/364 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1638 event pairs, 13 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 343. Up to 38 conditions per place. [2025-03-08 21:36:26,790 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 13 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-03-08 21:36:26,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 300 flow [2025-03-08 21:36:26,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:26,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-03-08 21:36:26,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856447688564477 [2025-03-08 21:36:26,794 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 264 flow. Second operand 3 states and 364 transitions. [2025-03-08 21:36:26,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 300 flow [2025-03-08 21:36:26,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 121 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:26,797 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 258 flow [2025-03-08 21:36:26,797 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=258, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-03-08 21:36:26,798 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-03-08 21:36:26,798 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 258 flow [2025-03-08 21:36:26,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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-03-08 21:36:26,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:26,799 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] [2025-03-08 21:36:26,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 21:36:26,799 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting allocatorErr3ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:26,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:26,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1632139533, now seen corresponding path program 1 times [2025-03-08 21:36:26,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:26,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001413505] [2025-03-08 21:36:26,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:26,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:26,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-08 21:36:26,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-08 21:36:26,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:26,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:26,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001413505] [2025-03-08 21:36:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001413505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:26,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:26,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:26,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633230459] [2025-03-08 21:36:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:26,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:26,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:26,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:26,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-03-08 21:36:26,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 258 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-03-08 21:36:26,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:26,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-03-08 21:36:26,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:26,972 INFO L124 PetriNetUnfolderBase]: 55/506 cut-off events. [2025-03-08 21:36:26,972 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-08 21:36:26,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 506 events. 55/506 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2595 event pairs, 31 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 543. Up to 97 conditions per place. [2025-03-08 21:36:26,974 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 19 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-03-08 21:36:26,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 320 flow [2025-03-08 21:36:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:26,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:26,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-03-08 21:36:26,976 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2025-03-08 21:36:26,976 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 258 flow. Second operand 3 states and 362 transitions. [2025-03-08 21:36:26,976 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 320 flow [2025-03-08 21:36:26,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:26,978 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 286 flow [2025-03-08 21:36:26,979 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=125, PETRI_TRANSITIONS=121} [2025-03-08 21:36:26,979 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-03-08 21:36:26,979 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 286 flow [2025-03-08 21:36:26,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 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-03-08 21:36:26,980 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:26,980 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] [2025-03-08 21:36:26,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 21:36:26,980 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting de_allocatorErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:26,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:26,981 INFO L85 PathProgramCache]: Analyzing trace with hash -557626167, now seen corresponding path program 1 times [2025-03-08 21:36:26,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:26,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-08 21:36:26,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:26,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:26,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-08 21:36:26,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-08 21:36:27,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:27,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:27,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:27,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038127040] [2025-03-08 21:36:27,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038127040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:27,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:27,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382358825] [2025-03-08 21:36:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:27,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:27,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:27,047 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:27,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:27,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2025-03-08 21:36:27,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 121 transitions, 286 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-03-08 21:36:27,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:27,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2025-03-08 21:36:27,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:27,168 INFO L124 PetriNetUnfolderBase]: 138/781 cut-off events. [2025-03-08 21:36:27,169 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-03-08 21:36:27,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1155 conditions, 781 events. 138/781 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4879 event pairs, 65 based on Foata normal form. 0/653 useless extension candidates. Maximal degree in co-relation 1022. Up to 231 conditions per place. [2025-03-08 21:36:27,173 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-03-08 21:36:27,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 130 transitions, 357 flow [2025-03-08 21:36:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:27,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:27,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-03-08 21:36:27,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2025-03-08 21:36:27,196 INFO L175 Difference]: Start difference. First operand has 125 places, 121 transitions, 286 flow. Second operand 3 states and 363 transitions. [2025-03-08 21:36:27,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 130 transitions, 357 flow [2025-03-08 21:36:27,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:27,198 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 316 flow [2025-03-08 21:36:27,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=316, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2025-03-08 21:36:27,199 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-08 21:36:27,199 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 316 flow [2025-03-08 21:36:27,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-03-08 21:36:27,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:27,201 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] [2025-03-08 21:36:27,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 21:36:27,201 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting de_allocatorErr0ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:27,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:27,202 INFO L85 PathProgramCache]: Analyzing trace with hash 692684575, now seen corresponding path program 1 times [2025-03-08 21:36:27,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:27,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547990942] [2025-03-08 21:36:27,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:27,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:27,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 21:36:27,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 21:36:27,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:27,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:27,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:27,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547990942] [2025-03-08 21:36:27,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547990942] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:27,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:27,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:27,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213141392] [2025-03-08 21:36:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:27,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:27,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:27,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:27,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:27,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2025-03-08 21:36:27,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 316 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-03-08 21:36:27,276 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:27,276 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2025-03-08 21:36:27,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:27,359 INFO L124 PetriNetUnfolderBase]: 134/884 cut-off events. [2025-03-08 21:36:27,360 INFO L125 PetriNetUnfolderBase]: For 154/166 co-relation queries the response was YES. [2025-03-08 21:36:27,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 884 events. 134/884 cut-off events. For 154/166 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 6044 event pairs, 28 based on Foata normal form. 2/789 useless extension candidates. Maximal degree in co-relation 1293. Up to 206 conditions per place. [2025-03-08 21:36:27,363 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 22 selfloop transitions, 6 changer transitions 5/139 dead transitions. [2025-03-08 21:36:27,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 139 transitions, 421 flow [2025-03-08 21:36:27,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:27,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:27,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-03-08 21:36:27,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8978102189781022 [2025-03-08 21:36:27,364 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 316 flow. Second operand 3 states and 369 transitions. [2025-03-08 21:36:27,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 139 transitions, 421 flow [2025-03-08 21:36:27,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 139 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:27,367 INFO L231 Difference]: Finished difference. Result has 129 places, 128 transitions, 352 flow [2025-03-08 21:36:27,367 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=129, PETRI_TRANSITIONS=128} [2025-03-08 21:36:27,368 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -1 predicate places. [2025-03-08 21:36:27,368 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 128 transitions, 352 flow [2025-03-08 21:36:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 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-03-08 21:36:27,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:27,368 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] [2025-03-08 21:36:27,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 21:36:27,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting allocatorErr2ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:27,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:27,369 INFO L85 PathProgramCache]: Analyzing trace with hash 537035004, now seen corresponding path program 1 times [2025-03-08 21:36:27,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:27,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216791434] [2025-03-08 21:36:27,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:27,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:27,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 21:36:27,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 21:36:27,381 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:27,382 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:27,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:27,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216791434] [2025-03-08 21:36:27,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216791434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:27,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:27,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:27,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339363847] [2025-03-08 21:36:27,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:27,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:27,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:27,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:27,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:27,421 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-03-08 21:36:27,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 128 transitions, 352 flow. Second operand has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-03-08 21:36:27,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:27,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-03-08 21:36:27,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:27,502 INFO L124 PetriNetUnfolderBase]: 107/770 cut-off events. [2025-03-08 21:36:27,503 INFO L125 PetriNetUnfolderBase]: For 155/165 co-relation queries the response was YES. [2025-03-08 21:36:27,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1289 conditions, 770 events. 107/770 cut-off events. For 155/165 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5242 event pairs, 43 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 1136. Up to 151 conditions per place. [2025-03-08 21:36:27,506 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 16 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2025-03-08 21:36:27,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 130 transitions, 394 flow [2025-03-08 21:36:27,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:27,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:27,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-03-08 21:36:27,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8710462287104623 [2025-03-08 21:36:27,507 INFO L175 Difference]: Start difference. First operand has 129 places, 128 transitions, 352 flow. Second operand 3 states and 358 transitions. [2025-03-08 21:36:27,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 130 transitions, 394 flow [2025-03-08 21:36:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 130 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 21:36:27,510 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 342 flow [2025-03-08 21:36:27,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-03-08 21:36:27,511 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-03-08 21:36:27,511 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 342 flow [2025-03-08 21:36:27,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 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-03-08 21:36:27,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:27,511 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] [2025-03-08 21:36:27,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 21:36:27,511 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting de_allocatorErr2ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:27,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash 2028143563, now seen corresponding path program 1 times [2025-03-08 21:36:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:27,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-03-08 21:36:27,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:27,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-08 21:36:27,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-08 21:36:27,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:27,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:27,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:27,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210561572] [2025-03-08 21:36:27,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210561572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:27,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:27,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 21:36:27,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968548857] [2025-03-08 21:36:27,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:27,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 21:36:27,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:27,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 21:36:27,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 21:36:27,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-03-08 21:36:27,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 342 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-03-08 21:36:27,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:27,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-03-08 21:36:27,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:27,897 INFO L124 PetriNetUnfolderBase]: 30/424 cut-off events. [2025-03-08 21:36:27,898 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2025-03-08 21:36:27,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 424 events. 30/424 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2075 event pairs, 10 based on Foata normal form. 2/392 useless extension candidates. Maximal degree in co-relation 517. Up to 38 conditions per place. [2025-03-08 21:36:27,900 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 9 selfloop transitions, 6 changer transitions 2/125 dead transitions. [2025-03-08 21:36:27,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 361 flow [2025-03-08 21:36:27,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 21:36:27,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-08 21:36:27,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2025-03-08 21:36:27,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744525547445255 [2025-03-08 21:36:27,903 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 342 flow. Second operand 5 states and 599 transitions. [2025-03-08 21:36:27,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 361 flow [2025-03-08 21:36:27,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 347 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-03-08 21:36:27,907 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 314 flow [2025-03-08 21:36:27,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=126, PETRI_TRANSITIONS=121} [2025-03-08 21:36:27,908 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-03-08 21:36:27,908 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 314 flow [2025-03-08 21:36:27,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 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-03-08 21:36:27,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:27,909 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] [2025-03-08 21:36:27,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 21:36:27,909 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting allocatorErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:27,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:27,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1122641987, now seen corresponding path program 1 times [2025-03-08 21:36:27,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:27,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-08 21:36:27,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:27,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:27,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-08 21:36:27,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-08 21:36:27,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:27,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:27,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:27,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107710774] [2025-03-08 21:36:27,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107710774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:27,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:27,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 21:36:27,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158342033] [2025-03-08 21:36:27,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:27,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:27,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:27,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:27,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:27,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2025-03-08 21:36:27,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 121 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-03-08 21:36:27,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:27,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2025-03-08 21:36:27,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:28,073 INFO L124 PetriNetUnfolderBase]: 71/529 cut-off events. [2025-03-08 21:36:28,074 INFO L125 PetriNetUnfolderBase]: For 142/168 co-relation queries the response was YES. [2025-03-08 21:36:28,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 529 events. 71/529 cut-off events. For 142/168 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2880 event pairs, 31 based on Foata normal form. 1/484 useless extension candidates. Maximal degree in co-relation 788. Up to 148 conditions per place. [2025-03-08 21:36:28,076 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 20 selfloop transitions, 7 changer transitions 3/128 dead transitions. [2025-03-08 21:36:28,076 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 396 flow [2025-03-08 21:36:28,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:28,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:28,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-03-08 21:36:28,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878345498783455 [2025-03-08 21:36:28,078 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 314 flow. Second operand 3 states and 361 transitions. [2025-03-08 21:36:28,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 396 flow [2025-03-08 21:36:28,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 387 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 21:36:28,082 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 351 flow [2025-03-08 21:36:28,082 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=351, PETRI_PLACES=127, PETRI_TRANSITIONS=123} [2025-03-08 21:36:28,083 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-03-08 21:36:28,083 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 351 flow [2025-03-08 21:36:28,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 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-03-08 21:36:28,083 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 21:36:28,084 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] [2025-03-08 21:36:28,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 21:36:28,084 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting de_allocatorErr1ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-08 21:36:28,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 21:36:28,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2100846991, now seen corresponding path program 1 times [2025-03-08 21:36:28,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 21:36:28,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134580648] [2025-03-08 21:36:28,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 21:36:28,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 21:36:28,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-08 21:36:28,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-08 21:36:28,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 21:36:28,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 21:36:28,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 21:36:28,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 21:36:28,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134580648] [2025-03-08 21:36:28,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134580648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 21:36:28,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 21:36:28,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 21:36:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017334542] [2025-03-08 21:36:28,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 21:36:28,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 21:36:28,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 21:36:28,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 21:36:28,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 21:36:28,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 137 [2025-03-08 21:36:28,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 123 transitions, 351 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-03-08 21:36:28,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 21:36:28,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 137 [2025-03-08 21:36:28,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 21:36:28,198 INFO L124 PetriNetUnfolderBase]: 10/166 cut-off events. [2025-03-08 21:36:28,198 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-08 21:36:28,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 166 events. 10/166 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 285 event pairs, 7 based on Foata normal form. 3/163 useless extension candidates. Maximal degree in co-relation 155. Up to 20 conditions per place. [2025-03-08 21:36:28,199 INFO L140 encePairwiseOnDemand]: 135/137 looper letters, 0 selfloop transitions, 0 changer transitions 99/99 dead transitions. [2025-03-08 21:36:28,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 262 flow [2025-03-08 21:36:28,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 21:36:28,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 21:36:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-03-08 21:36:28,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-03-08 21:36:28,201 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 351 flow. Second operand 3 states and 365 transitions. [2025-03-08 21:36:28,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 262 flow [2025-03-08 21:36:28,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 99 transitions, 239 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-08 21:36:28,203 INFO L231 Difference]: Finished difference. Result has 105 places, 0 transitions, 0 flow [2025-03-08 21:36:28,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=97, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=105, PETRI_TRANSITIONS=0} [2025-03-08 21:36:28,203 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -25 predicate places. [2025-03-08 21:36:28,204 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 0 transitions, 0 flow [2025-03-08 21:36:28,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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-03-08 21:36:28,206 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr4ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2025-03-08 21:36:28,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr1ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-03-08 21:36:28,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-03-08 21:36:28,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-03-08 21:36:28,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-03-08 21:36:28,207 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr2ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr4ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr1ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr3ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-03-08 21:36:28,208 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-03-08 21:36:28,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr2ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-03-08 21:36:28,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-03-08 21:36:28,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-03-08 21:36:28,209 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-03-08 21:36:28,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 21:36:28,209 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 21:36:28,215 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 21:36:28,216 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 21:36:28,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 09:36:28 BasicIcfg [2025-03-08 21:36:28,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 21:36:28,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 21:36:28,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 21:36:28,222 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 21:36:28,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 09:36:25" (3/4) ... [2025-03-08 21:36:28,224 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 21:36:28,226 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure allocator [2025-03-08 21:36:28,226 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure de_allocator [2025-03-08 21:36:28,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-03-08 21:36:28,228 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 21:36:28,229 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 21:36:28,229 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 21:36:28,285 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 21:36:28,286 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 21:36:28,286 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 21:36:28,286 INFO L158 Benchmark]: Toolchain (without parser) took 3127.47ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 105.5MB in the beginning and 221.9MB in the end (delta: -116.3MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2025-03-08 21:36:28,287 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:36:28,287 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.67ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 85.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:36:28,287 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.35ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:36:28,287 INFO L158 Benchmark]: Boogie Preprocessor took 19.91ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 83.1MB in the end (delta: 649.3kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 21:36:28,287 INFO L158 Benchmark]: IcfgBuilder took 343.11ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 65.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 21:36:28,288 INFO L158 Benchmark]: TraceAbstraction took 2295.83ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 65.3MB in the beginning and 227.8MB in the end (delta: -162.5MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2025-03-08 21:36:28,288 INFO L158 Benchmark]: Witness Printer took 64.04ms. Allocated memory is still 335.5MB. Free memory was 227.8MB in the beginning and 221.9MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 21:36:28,289 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.14ms. Allocated memory is still 201.3MB. Free memory is still 128.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.67ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 85.5MB in the end (delta: 20.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.35ms. Allocated memory is still 142.6MB. Free memory was 85.5MB in the beginning and 83.7MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.91ms. Allocated memory is still 142.6MB. Free memory was 83.7MB in the beginning and 83.1MB in the end (delta: 649.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 343.11ms. Allocated memory is still 142.6MB. Free memory was 82.4MB in the beginning and 65.9MB in the end (delta: 16.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2295.83ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 65.3MB in the beginning and 227.8MB in the end (delta: -162.5MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * Witness Printer took 64.04ms. Allocated memory is still 335.5MB. Free memory was 227.8MB in the beginning and 221.9MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 695]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 701]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 697]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 708]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 710]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 717]: 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, 203 locations, 215 edges, 20 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.2s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 267 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 427 IncrementalHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 57 mSDtfsCounter, 427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=352occurred in iteration=6, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 565 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 555 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 21:36:28,301 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