./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 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/time_var_mutex.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-48c9605-m [2025-02-08 05:09:51,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:09:51,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:09:51,305 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:09:51,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:09:51,318 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:09:51,319 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:09:51,319 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:09:51,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:09:51,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:09:51,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:09:51,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:09:51,320 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:09:51,321 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:51,321 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:09:51,321 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:09:51,322 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:09:51,322 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:09:51,322 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:09:51,322 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:09:51,322 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-jdk21/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-02-08 05:09:51,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:09:51,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:09:51,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:09:51,514 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:09:51,514 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:09:51,515 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2025-02-08 05:09:52,690 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e980beba1/582b4aec19784bdba66d7e676a625d27/FLAGf8e536617 [2025-02-08 05:09:53,025 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:09:53,026 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/time_var_mutex.i [2025-02-08 05:09:53,040 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e980beba1/582b4aec19784bdba66d7e676a625d27/FLAGf8e536617 [2025-02-08 05:09:53,256 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e980beba1/582b4aec19784bdba66d7e676a625d27 [2025-02-08 05:09:53,259 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:09:53,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:09:53,262 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:53,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:09:53,266 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:09:53,267 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,268 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5381d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53, skipping insertion in model container [2025-02-08 05:09:53,269 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,290 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:09:53,571 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:53,587 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:09:53,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:09:53,657 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:09:53,658 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53 WrapperNode [2025-02-08 05:09:53,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:09:53,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:53,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:09:53,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:09:53,665 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,673 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,688 INFO L138 Inliner]: procedures = 169, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 119 [2025-02-08 05:09:53,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:09:53,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:09:53,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:09:53,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:09:53,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,694 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,704 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,706 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,711 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:09:53,712 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:09:53,713 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:09:53,713 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:09:53,714 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (1/1) ... [2025-02-08 05:09:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:09:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:09:53,737 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:09:53,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:09:53,755 INFO L130 BoogieDeclarations]: Found specification of procedure allocator [2025-02-08 05:09:53,756 INFO L138 BoogieDeclarations]: Found implementation of procedure allocator [2025-02-08 05:09:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure de_allocator [2025-02-08 05:09:53,756 INFO L138 BoogieDeclarations]: Found implementation of procedure de_allocator [2025-02-08 05:09:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:09:53,756 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:09:53,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:09:53,757 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:09:53,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:09:53,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:09:53,758 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:09:53,861 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:09:53,862 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:09:54,099 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:09:54,099 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:09:54,121 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:09:54,121 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:09:54,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:54 BoogieIcfgContainer [2025-02-08 05:09:54,122 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:09:54,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:09:54,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:09:54,134 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:09:54,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:09:53" (1/3) ... [2025-02-08 05:09:54,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b98b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:54, skipping insertion in model container [2025-02-08 05:09:54,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:09:53" (2/3) ... [2025-02-08 05:09:54,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b98b15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:09:54, skipping insertion in model container [2025-02-08 05:09:54,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:54" (3/3) ... [2025-02-08 05:09:54,139 INFO L128 eAbstractionObserver]: Analyzing ICFG time_var_mutex.i [2025-02-08 05:09:54,148 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:09:54,150 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-02-08 05:09:54,150 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:09:54,201 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:09:54,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 137 transitions, 288 flow [2025-02-08 05:09:54,262 INFO L124 PetriNetUnfolderBase]: 7/135 cut-off events. [2025-02-08 05:09:54,263 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:09:54,267 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-02-08 05:09:54,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 137 transitions, 288 flow [2025-02-08 05:09:54,270 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 130 transitions, 269 flow [2025-02-08 05:09:54,275 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:09:54,282 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;@12786ad7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:09:54,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-02-08 05:09:54,288 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:09:54,288 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2025-02-08 05:09:54,289 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:09:54,289 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:54,290 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-02-08 05:09:54,291 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-02-08 05:09:54,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:54,295 INFO L85 PathProgramCache]: Analyzing trace with hash -2019293663, now seen corresponding path program 1 times [2025-02-08 05:09:54,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:54,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919149173] [2025-02-08 05:09:54,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:54,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:54,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-08 05:09:54,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-08 05:09:54,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:54,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:54,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:54,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919149173] [2025-02-08 05:09:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919149173] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:54,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:54,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:54,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367459572] [2025-02-08 05:09:54,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:54,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:54,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:54,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:54,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:54,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-02-08 05:09:54,462 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-02-08 05:09:54,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:54,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-02-08 05:09:54,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:54,576 INFO L124 PetriNetUnfolderBase]: 29/337 cut-off events. [2025-02-08 05:09:54,577 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-08 05:09:54,580 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 1510 event pairs, 20 based on Foata normal form. 30/319 useless extension candidates. Maximal degree in co-relation 359. Up to 53 conditions per place. [2025-02-08 05:09:54,582 INFO L140 encePairwiseOnDemand]: 128/137 looper letters, 17 selfloop transitions, 2 changer transitions 1/124 dead transitions. [2025-02-08 05:09:54,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 124 transitions, 301 flow [2025-02-08 05:09:54,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:54,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:54,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-02-08 05:09:54,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8978102189781022 [2025-02-08 05:09:54,597 INFO L175 Difference]: Start difference. First operand has 130 places, 130 transitions, 269 flow. Second operand 3 states and 369 transitions. [2025-02-08 05:09:54,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 124 transitions, 301 flow [2025-02-08 05:09:54,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 293 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:09:54,625 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 244 flow [2025-02-08 05:09:54,627 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-02-08 05:09:54,629 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-02-08 05:09:54,629 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 244 flow [2025-02-08 05:09:54,629 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-02-08 05:09:54,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:54,629 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-02-08 05:09:54,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:09:54,630 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-02-08 05:09:54,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 784015791, now seen corresponding path program 1 times [2025-02-08 05:09:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110941395] [2025-02-08 05:09:54,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:54,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 05:09:54,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 05:09:54,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:54,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:54,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:54,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:54,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110941395] [2025-02-08 05:09:54,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110941395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:54,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:54,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:54,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975734563] [2025-02-08 05:09:54,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:54,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:54,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:54,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:54,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:54,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-02-08 05:09:54,726 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-02-08 05:09:54,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:54,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-02-08 05:09:54,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:54,797 INFO L124 PetriNetUnfolderBase]: 53/556 cut-off events. [2025-02-08 05:09:54,797 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 05:09:54,798 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 3167 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-02-08 05:09:54,800 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 19 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-02-08 05:09:54,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 125 transitions, 307 flow [2025-02-08 05:09:54,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:54,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-02-08 05:09:54,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856447688564477 [2025-02-08 05:09:54,801 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 244 flow. Second operand 3 states and 364 transitions. [2025-02-08 05:09:54,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 125 transitions, 307 flow [2025-02-08 05:09:54,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 125 transitions, 303 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:54,804 INFO L231 Difference]: Finished difference. Result has 123 places, 119 transitions, 264 flow [2025-02-08 05:09:54,804 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-02-08 05:09:54,805 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-02-08 05:09:54,805 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 119 transitions, 264 flow [2025-02-08 05:09:54,805 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-02-08 05:09:54,805 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:54,805 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-02-08 05:09:54,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:09:54,806 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-02-08 05:09:54,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:54,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1390003027, now seen corresponding path program 1 times [2025-02-08 05:09:54,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:54,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860883804] [2025-02-08 05:09:54,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:54,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:54,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-08 05:09:54,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-08 05:09:54,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:54,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:54,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:54,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860883804] [2025-02-08 05:09:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860883804] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:54,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060637101] [2025-02-08 05:09:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:54,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:54,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:54,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:54,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-02-08 05:09:54,887 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-02-08 05:09:54,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:54,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-02-08 05:09:54,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:54,936 INFO L124 PetriNetUnfolderBase]: 27/364 cut-off events. [2025-02-08 05:09:54,937 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-02-08 05:09:54,937 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 1653 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-02-08 05:09:54,938 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 13 selfloop transitions, 2 changer transitions 0/121 dead transitions. [2025-02-08 05:09:54,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 121 transitions, 300 flow [2025-02-08 05:09:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2025-02-08 05:09:54,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8856447688564477 [2025-02-08 05:09:54,940 INFO L175 Difference]: Start difference. First operand has 123 places, 119 transitions, 264 flow. Second operand 3 states and 364 transitions. [2025-02-08 05:09:54,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 121 transitions, 300 flow [2025-02-08 05:09:54,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 121 transitions, 292 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:54,942 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 258 flow [2025-02-08 05:09:54,942 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-02-08 05:09:54,943 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -7 predicate places. [2025-02-08 05:09:54,943 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 258 flow [2025-02-08 05:09:54,943 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-02-08 05:09:54,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:54,944 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-02-08 05:09:54,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:09:54,944 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-02-08 05:09:54,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:54,944 INFO L85 PathProgramCache]: Analyzing trace with hash -975158002, now seen corresponding path program 1 times [2025-02-08 05:09:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050920027] [2025-02-08 05:09:54,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:54,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:54,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-08 05:09:54,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-08 05:09:54,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:54,960 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:54,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050920027] [2025-02-08 05:09:54,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050920027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:54,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:54,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:54,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876335917] [2025-02-08 05:09:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:54,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:54,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:54,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:54,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:55,015 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-02-08 05:09:55,016 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-02-08 05:09:55,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:55,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-02-08 05:09:55,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:55,100 INFO L124 PetriNetUnfolderBase]: 55/506 cut-off events. [2025-02-08 05:09:55,100 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-02-08 05:09:55,101 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 2607 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-02-08 05:09:55,103 INFO L140 encePairwiseOnDemand]: 132/137 looper letters, 19 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-02-08 05:09:55,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 124 transitions, 320 flow [2025-02-08 05:09:55,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2025-02-08 05:09:55,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8807785888077859 [2025-02-08 05:09:55,105 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 258 flow. Second operand 3 states and 362 transitions. [2025-02-08 05:09:55,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 124 transitions, 320 flow [2025-02-08 05:09:55,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 124 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:55,108 INFO L231 Difference]: Finished difference. Result has 125 places, 121 transitions, 286 flow [2025-02-08 05:09:55,110 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-02-08 05:09:55,111 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -5 predicate places. [2025-02-08 05:09:55,111 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 121 transitions, 286 flow [2025-02-08 05:09:55,111 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-02-08 05:09:55,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:55,111 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-02-08 05:09:55,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:09:55,112 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-02-08 05:09:55,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1695490635, now seen corresponding path program 1 times [2025-02-08 05:09:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:55,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507121177] [2025-02-08 05:09:55,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:55,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:55,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-08 05:09:55,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 05:09:55,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:55,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:55,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:55,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:55,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507121177] [2025-02-08 05:09:55,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507121177] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:55,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:55,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:55,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392802556] [2025-02-08 05:09:55,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:55,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:55,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:55,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:55,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:55,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2025-02-08 05:09:55,201 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-02-08 05:09:55,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:55,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2025-02-08 05:09:55,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:55,316 INFO L124 PetriNetUnfolderBase]: 138/781 cut-off events. [2025-02-08 05:09:55,316 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-02-08 05:09:55,318 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 4904 event pairs, 65 based on Foata normal form. 0/652 useless extension candidates. Maximal degree in co-relation 1022. Up to 231 conditions per place. [2025-02-08 05:09:55,321 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 21 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-02-08 05:09:55,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 130 transitions, 357 flow [2025-02-08 05:09:55,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:55,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-02-08 05:09:55,324 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8832116788321168 [2025-02-08 05:09:55,324 INFO L175 Difference]: Start difference. First operand has 125 places, 121 transitions, 286 flow. Second operand 3 states and 363 transitions. [2025-02-08 05:09:55,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 130 transitions, 357 flow [2025-02-08 05:09:55,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 130 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:55,328 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 316 flow [2025-02-08 05:09:55,328 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-02-08 05:09:55,329 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-02-08 05:09:55,331 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 316 flow [2025-02-08 05:09:55,331 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-02-08 05:09:55,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:55,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:55,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:09:55,331 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting allocatorErr2ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:09:55,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:55,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1417985594, now seen corresponding path program 1 times [2025-02-08 05:09:55,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:55,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845634336] [2025-02-08 05:09:55,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:55,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:55,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:09:55,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:09:55,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:55,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:55,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:55,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:55,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845634336] [2025-02-08 05:09:55,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845634336] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:55,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:55,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622146300] [2025-02-08 05:09:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:55,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:55,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:55,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:55,399 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 137 [2025-02-08 05:09:55,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 316 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-02-08 05:09:55,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:55,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 137 [2025-02-08 05:09:55,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:55,523 INFO L124 PetriNetUnfolderBase]: 82/570 cut-off events. [2025-02-08 05:09:55,523 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:09:55,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 878 conditions, 570 events. 82/570 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3286 event pairs, 32 based on Foata normal form. 0/493 useless extension candidates. Maximal degree in co-relation 729. Up to 106 conditions per place. [2025-02-08 05:09:55,529 INFO L140 encePairwiseOnDemand]: 134/137 looper letters, 16 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-02-08 05:09:55,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 358 flow [2025-02-08 05:09:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:55,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-02-08 05:09:55,535 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8710462287104623 [2025-02-08 05:09:55,535 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 316 flow. Second operand 3 states and 358 transitions. [2025-02-08 05:09:55,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 358 flow [2025-02-08 05:09:55,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 127 transitions, 348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:55,542 INFO L231 Difference]: Finished difference. Result has 126 places, 124 transitions, 308 flow [2025-02-08 05:09:55,542 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=308, PETRI_PLACES=126, PETRI_TRANSITIONS=124} [2025-02-08 05:09:55,542 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-02-08 05:09:55,543 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 124 transitions, 308 flow [2025-02-08 05:09:55,543 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-02-08 05:09:55,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:55,543 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-02-08 05:09:55,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:09:55,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting de_allocatorErr0ASSERT_VIOLATIONDATA_RACE === [allocatorErr4ASSERT_VIOLATIONDATA_RACE, allocatorErr1ASSERT_VIOLATIONDATA_RACE, allocatorErr3ASSERT_VIOLATIONDATA_RACE, allocatorErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-02-08 05:09:55,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:55,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1546430076, now seen corresponding path program 1 times [2025-02-08 05:09:55,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:55,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604118560] [2025-02-08 05:09:55,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:55,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:55,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:09:55,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:09:55,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:55,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:55,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:55,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:55,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604118560] [2025-02-08 05:09:55,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604118560] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:55,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:55,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:55,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672154802] [2025-02-08 05:09:55,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:55,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:55,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:55,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:55,631 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2025-02-08 05:09:55,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 124 transitions, 308 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-02-08 05:09:55,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:55,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2025-02-08 05:09:55,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:55,725 INFO L124 PetriNetUnfolderBase]: 134/875 cut-off events. [2025-02-08 05:09:55,725 INFO L125 PetriNetUnfolderBase]: For 98/110 co-relation queries the response was YES. [2025-02-08 05:09:55,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1386 conditions, 875 events. 134/875 cut-off events. For 98/110 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 5952 event pairs, 28 based on Foata normal form. 2/785 useless extension candidates. Maximal degree in co-relation 1247. Up to 206 conditions per place. [2025-02-08 05:09:55,729 INFO L140 encePairwiseOnDemand]: 129/137 looper letters, 22 selfloop transitions, 6 changer transitions 5/138 dead transitions. [2025-02-08 05:09:55,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 138 transitions, 411 flow [2025-02-08 05:09:55,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:55,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2025-02-08 05:09:55,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8978102189781022 [2025-02-08 05:09:55,731 INFO L175 Difference]: Start difference. First operand has 126 places, 124 transitions, 308 flow. Second operand 3 states and 369 transitions. [2025-02-08 05:09:55,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 138 transitions, 411 flow [2025-02-08 05:09:55,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 138 transitions, 407 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:09:55,734 INFO L231 Difference]: Finished difference. Result has 128 places, 127 transitions, 350 flow [2025-02-08 05:09:55,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=137, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=350, PETRI_PLACES=128, PETRI_TRANSITIONS=127} [2025-02-08 05:09:55,735 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -2 predicate places. [2025-02-08 05:09:55,736 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 127 transitions, 350 flow [2025-02-08 05:09:55,737 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-02-08 05:09:55,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:55,737 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-02-08 05:09:55,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:09:55,737 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-02-08 05:09:55,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:55,738 INFO L85 PathProgramCache]: Analyzing trace with hash 1164035949, now seen corresponding path program 1 times [2025-02-08 05:09:55,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:55,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890235269] [2025-02-08 05:09:55,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:55,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:55,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-08 05:09:55,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-08 05:09:55,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:55,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:55,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:55,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890235269] [2025-02-08 05:09:55,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890235269] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:55,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:55,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-08 05:09:55,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602876883] [2025-02-08 05:09:55,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:55,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:09:55,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:55,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:09:55,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:09:56,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 137 [2025-02-08 05:09:56,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 127 transitions, 350 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-02-08 05:09:56,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:56,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 137 [2025-02-08 05:09:56,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:56,102 INFO L124 PetriNetUnfolderBase]: 30/424 cut-off events. [2025-02-08 05:09:56,102 INFO L125 PetriNetUnfolderBase]: For 82/82 co-relation queries the response was YES. [2025-02-08 05:09:56,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 670 conditions, 424 events. 30/424 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2072 event pairs, 10 based on Foata normal form. 2/393 useless extension candidates. Maximal degree in co-relation 539. Up to 38 conditions per place. [2025-02-08 05:09:56,103 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 9 selfloop transitions, 6 changer transitions 2/125 dead transitions. [2025-02-08 05:09:56,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 125 transitions, 369 flow [2025-02-08 05:09:56,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:09:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:09:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 599 transitions. [2025-02-08 05:09:56,105 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8744525547445255 [2025-02-08 05:09:56,105 INFO L175 Difference]: Start difference. First operand has 128 places, 127 transitions, 350 flow. Second operand 5 states and 599 transitions. [2025-02-08 05:09:56,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 125 transitions, 369 flow [2025-02-08 05:09:56,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 347 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-08 05:09:56,108 INFO L231 Difference]: Finished difference. Result has 126 places, 121 transitions, 314 flow [2025-02-08 05:09:56,108 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-02-08 05:09:56,109 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2025-02-08 05:09:56,110 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 121 transitions, 314 flow [2025-02-08 05:09:56,110 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-02-08 05:09:56,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:56,111 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-02-08 05:09:56,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:09:56,111 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-02-08 05:09:56,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:56,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1959812738, now seen corresponding path program 1 times [2025-02-08 05:09:56,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:56,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377880995] [2025-02-08 05:09:56,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:56,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:56,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 05:09:56,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 05:09:56,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:56,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:56,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377880995] [2025-02-08 05:09:56,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377880995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:56,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:56,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:09:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406687194] [2025-02-08 05:09:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:56,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:56,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:56,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:56,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:56,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 137 [2025-02-08 05:09:56,172 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-02-08 05:09:56,172 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:56,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 137 [2025-02-08 05:09:56,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:56,222 INFO L124 PetriNetUnfolderBase]: 71/529 cut-off events. [2025-02-08 05:09:56,223 INFO L125 PetriNetUnfolderBase]: For 142/168 co-relation queries the response was YES. [2025-02-08 05:09:56,223 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 2884 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-02-08 05:09:56,224 INFO L140 encePairwiseOnDemand]: 131/137 looper letters, 20 selfloop transitions, 7 changer transitions 3/128 dead transitions. [2025-02-08 05:09:56,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 128 transitions, 396 flow [2025-02-08 05:09:56,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:56,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 361 transitions. [2025-02-08 05:09:56,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.878345498783455 [2025-02-08 05:09:56,225 INFO L175 Difference]: Start difference. First operand has 126 places, 121 transitions, 314 flow. Second operand 3 states and 361 transitions. [2025-02-08 05:09:56,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 128 transitions, 396 flow [2025-02-08 05:09:56,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 128 transitions, 387 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:09:56,229 INFO L231 Difference]: Finished difference. Result has 127 places, 123 transitions, 351 flow [2025-02-08 05:09:56,229 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-02-08 05:09:56,230 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -3 predicate places. [2025-02-08 05:09:56,230 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 123 transitions, 351 flow [2025-02-08 05:09:56,230 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-02-08 05:09:56,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:09:56,231 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-02-08 05:09:56,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:09:56,231 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-02-08 05:09:56,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:09:56,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1848515778, now seen corresponding path program 1 times [2025-02-08 05:09:56,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:09:56,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025758178] [2025-02-08 05:09:56,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:09:56,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:09:56,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-08 05:09:56,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-08 05:09:56,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:09:56,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:09:56,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:09:56,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:09:56,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025758178] [2025-02-08 05:09:56,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025758178] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:09:56,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:09:56,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:09:56,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718551382] [2025-02-08 05:09:56,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:09:56,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:09:56,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:09:56,297 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:09:56,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:09:56,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 137 [2025-02-08 05:09:56,302 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-02-08 05:09:56,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:09:56,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 137 [2025-02-08 05:09:56,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:09:56,327 INFO L124 PetriNetUnfolderBase]: 10/166 cut-off events. [2025-02-08 05:09:56,327 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:09:56,327 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 290 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-02-08 05:09:56,328 INFO L140 encePairwiseOnDemand]: 135/137 looper letters, 0 selfloop transitions, 0 changer transitions 99/99 dead transitions. [2025-02-08 05:09:56,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 262 flow [2025-02-08 05:09:56,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:09:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:09:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 365 transitions. [2025-02-08 05:09:56,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880778588807786 [2025-02-08 05:09:56,330 INFO L175 Difference]: Start difference. First operand has 127 places, 123 transitions, 351 flow. Second operand 3 states and 365 transitions. [2025-02-08 05:09:56,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 262 flow [2025-02-08 05:09:56,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 99 transitions, 239 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-08 05:09:56,331 INFO L231 Difference]: Finished difference. Result has 105 places, 0 transitions, 0 flow [2025-02-08 05:09:56,331 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-02-08 05:09:56,332 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -25 predicate places. [2025-02-08 05:09:56,332 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 0 transitions, 0 flow [2025-02-08 05:09:56,332 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-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr4ASSERT_VIOLATIONDATA_RACE (19 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr1ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr2ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr2ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-02-08 05:09:56,335 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-02-08 05:09:56,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-02-08 05:09:56,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 20 remaining) [2025-02-08 05:09:56,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 20 remaining) [2025-02-08 05:09:56,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr4ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-02-08 05:09:56,336 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr1ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-02-08 05:09:56,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr3ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-02-08 05:09:56,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-02-08 05:09:56,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location allocatorErr2ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-02-08 05:09:56,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-02-08 05:09:56,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr1ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-02-08 05:09:56,337 INFO L782 garLoopResultBuilder]: Registering result SAFE for location de_allocatorErr0ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-02-08 05:09:56,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:09:56,338 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:09:56,342 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:09:56,342 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:09:56,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:09:56 BasicIcfg [2025-02-08 05:09:56,348 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:09:56,348 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:09:56,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:09:56,350 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:09:56,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:09:54" (3/4) ... [2025-02-08 05:09:56,351 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:09:56,353 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure allocator [2025-02-08 05:09:56,354 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure de_allocator [2025-02-08 05:09:56,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2025-02-08 05:09:56,357 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:09:56,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:09:56,358 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:09:56,439 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:09:56,444 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:09:56,444 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:09:56,444 INFO L158 Benchmark]: Toolchain (without parser) took 3184.21ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 56.0MB in the end (delta: 72.2MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2025-02-08 05:09:56,444 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:56,444 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.88ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 107.9MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:09:56,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.45ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 106.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:56,445 INFO L158 Benchmark]: Boogie Preprocessor took 23.00ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 105.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:09:56,445 INFO L158 Benchmark]: IcfgBuilder took 409.68ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 87.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-08 05:09:56,445 INFO L158 Benchmark]: TraceAbstraction took 2217.45ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 61.7MB in the end (delta: 25.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2025-02-08 05:09:56,445 INFO L158 Benchmark]: Witness Printer took 95.18ms. Allocated memory is still 167.8MB. Free memory was 61.7MB in the beginning and 56.0MB in the end (delta: 5.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:09:56,446 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.18ms. Allocated memory is still 226.5MB. Free memory is still 150.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.88ms. Allocated memory is still 167.8MB. Free memory was 128.2MB in the beginning and 107.9MB in the end (delta: 20.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.45ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 106.6MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.00ms. Allocated memory is still 167.8MB. Free memory was 106.6MB in the beginning and 105.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 409.68ms. Allocated memory is still 167.8MB. Free memory was 105.2MB in the beginning and 87.7MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2217.45ms. Allocated memory is still 167.8MB. Free memory was 87.0MB in the beginning and 61.7MB in the end (delta: 25.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 95.18ms. Allocated memory is still 167.8MB. Free memory was 61.7MB in the beginning and 56.0MB in the end (delta: 5.7MB). 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, 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.1s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 68 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, 67 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=351occurred in iteration=9, 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, 872 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-02-08 05:09:56,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE