./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:24:58,344 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:24:58,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:24:58,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:24:58,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:24:58,424 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:24:58,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:24:58,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:24:58,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:24:58,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:24:58,425 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:24:58,425 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:24:58,425 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:24:58,426 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:24:58,426 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:24:58,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:24:58,427 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:24:58,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d41b1dc1d5d7eec1f1fd4e3cbbef0194aa2dded6486a15b383e9bb8fe1468a3 [2025-03-13 22:24:58,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:24:58,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:24:58,639 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:24:58,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:24:58,640 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:24:58,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-13 22:24:59,778 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a9caa64/5b1cc459bed54baa97ace78088b495ac/FLAG3cb3d03b8 [2025-03-13 22:24:59,985 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:24:59,986 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-equiv.wvr.c [2025-03-13 22:25:00,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a9caa64/5b1cc459bed54baa97ace78088b495ac/FLAG3cb3d03b8 [2025-03-13 22:25:00,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e9a9caa64/5b1cc459bed54baa97ace78088b495ac [2025-03-13 22:25:00,339 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:25:00,340 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:25:00,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:00,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:25:00,344 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:25:00,344 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,345 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e6e5498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00, skipping insertion in model container [2025-03-13 22:25:00,345 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:25:00,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:00,512 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:25:00,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:25:00,560 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:25:00,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00 WrapperNode [2025-03-13 22:25:00,560 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:25:00,561 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:00,561 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:25:00,561 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:25:00,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,570 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,594 INFO L138 Inliner]: procedures = 26, calls = 54, calls flagged for inlining = 19, calls inlined = 23, statements flattened = 411 [2025-03-13 22:25:00,594 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:25:00,595 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:25:00,595 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:25:00,595 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:25:00,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,601 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,612 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,614 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:25:00,618 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:25:00,618 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:25:00,618 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:25:00,619 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (1/1) ... [2025-03-13 22:25:00,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:25:00,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:25:00,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:25:00,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:25:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:25:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:25:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:25:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-13 22:25:00,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-13 22:25:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-13 22:25:00,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-13 22:25:00,667 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-13 22:25:00,667 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-13 22:25:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-03-13 22:25:00,668 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-03-13 22:25:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:25:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:25:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:25:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:25:00,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:25:00,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:25:00,669 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:25:00,746 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:25:00,749 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:25:01,180 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:25:01,181 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:25:01,181 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:25:01,424 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:25:01,425 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:01 BoogieIcfgContainer [2025-03-13 22:25:01,425 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:25:01,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:25:01,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:25:01,429 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:25:01,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:25:00" (1/3) ... [2025-03-13 22:25:01,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230c9739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:01, skipping insertion in model container [2025-03-13 22:25:01,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:25:00" (2/3) ... [2025-03-13 22:25:01,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230c9739 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:25:01, skipping insertion in model container [2025-03-13 22:25:01,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:01" (3/3) ... [2025-03-13 22:25:01,431 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-equiv.wvr.c [2025-03-13 22:25:01,442 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:25:01,443 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-parallel-sum-equiv.wvr.c that has 5 procedures, 291 locations, 1 initial locations, 4 loop locations, and 57 error locations. [2025-03-13 22:25:01,444 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:25:01,507 INFO L143 ThreadInstanceAdder]: Constructed 10 joinOtherThreadTransitions. [2025-03-13 22:25:01,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 307 transitions, 654 flow [2025-03-13 22:25:01,601 INFO L124 PetriNetUnfolderBase]: 13/299 cut-off events. [2025-03-13 22:25:01,603 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:25:01,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 318 conditions, 299 events. 13/299 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 475 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 253. Up to 3 conditions per place. [2025-03-13 22:25:01,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 307 transitions, 654 flow [2025-03-13 22:25:01,617 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 283 places, 282 transitions, 594 flow [2025-03-13 22:25:01,627 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:25:01,637 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;@15e6fcf4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:25:01,637 INFO L334 AbstractCegarLoop]: Starting to check reachability of 106 error locations. [2025-03-13 22:25:01,644 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:25:01,646 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-13 22:25:01,646 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:25:01,646 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:01,647 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] [2025-03-13 22:25:01,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:01,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:01,653 INFO L85 PathProgramCache]: Analyzing trace with hash 688761645, now seen corresponding path program 1 times [2025-03-13 22:25:01,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:01,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772031210] [2025-03-13 22:25:01,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:01,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:01,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 22:25:01,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 22:25:01,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:01,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:01,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:01,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772031210] [2025-03-13 22:25:01,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772031210] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:01,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:01,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198705995] [2025-03-13 22:25:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:01,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:01,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:01,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:01,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:01,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 309 [2025-03-13 22:25:01,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 282 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:01,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:01,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 309 [2025-03-13 22:25:01,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:02,126 INFO L124 PetriNetUnfolderBase]: 301/1001 cut-off events. [2025-03-13 22:25:02,126 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2025-03-13 22:25:02,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1591 conditions, 1001 events. 301/1001 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5049 event pairs, 159 based on Foata normal form. 114/1010 useless extension candidates. Maximal degree in co-relation 1389. Up to 436 conditions per place. [2025-03-13 22:25:02,138 INFO L140 encePairwiseOnDemand]: 257/309 looper letters, 26 selfloop transitions, 2 changer transitions 3/232 dead transitions. [2025-03-13 22:25:02,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 232 transitions, 550 flow [2025-03-13 22:25:02,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:02,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 750 transitions. [2025-03-13 22:25:02,155 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8090614886731392 [2025-03-13 22:25:02,157 INFO L175 Difference]: Start difference. First operand has 283 places, 282 transitions, 594 flow. Second operand 3 states and 750 transitions. [2025-03-13 22:25:02,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 232 transitions, 550 flow [2025-03-13 22:25:02,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 232 transitions, 530 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-13 22:25:02,169 INFO L231 Difference]: Finished difference. Result has 233 places, 229 transitions, 472 flow [2025-03-13 22:25:02,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=233, PETRI_TRANSITIONS=229} [2025-03-13 22:25:02,175 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -50 predicate places. [2025-03-13 22:25:02,176 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 229 transitions, 472 flow [2025-03-13 22:25:02,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,177 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:02,177 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:02,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:25:02,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:02,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1521395174, now seen corresponding path program 1 times [2025-03-13 22:25:02,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553266796] [2025-03-13 22:25:02,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:02,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:25:02,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:25:02,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:02,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:02,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:02,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553266796] [2025-03-13 22:25:02,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553266796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:02,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:02,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:02,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546398189] [2025-03-13 22:25:02,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:02,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:02,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:02,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:02,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:02,245 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 309 [2025-03-13 22:25:02,246 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 229 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:02,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 309 [2025-03-13 22:25:02,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:02,394 INFO L124 PetriNetUnfolderBase]: 301/997 cut-off events. [2025-03-13 22:25:02,394 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:02,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 997 events. 301/997 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5053 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1451. Up to 435 conditions per place. [2025-03-13 22:25:02,400 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 25 selfloop transitions, 2 changer transitions 0/228 dead transitions. [2025-03-13 22:25:02,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 228 transitions, 524 flow [2025-03-13 22:25:02,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:02,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:02,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2025-03-13 22:25:02,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583603020496225 [2025-03-13 22:25:02,402 INFO L175 Difference]: Start difference. First operand has 233 places, 229 transitions, 472 flow. Second operand 3 states and 703 transitions. [2025-03-13 22:25:02,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 228 transitions, 524 flow [2025-03-13 22:25:02,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 228 transitions, 520 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:02,405 INFO L231 Difference]: Finished difference. Result has 229 places, 228 transitions, 470 flow [2025-03-13 22:25:02,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=228, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=229, PETRI_TRANSITIONS=228} [2025-03-13 22:25:02,406 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -54 predicate places. [2025-03-13 22:25:02,406 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 228 transitions, 470 flow [2025-03-13 22:25:02,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:02,407 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] [2025-03-13 22:25:02,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:25:02,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:02,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:02,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1200187177, now seen corresponding path program 1 times [2025-03-13 22:25:02,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:02,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567020226] [2025-03-13 22:25:02,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:02,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:02,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-13 22:25:02,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-13 22:25:02,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:02,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:02,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:02,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:02,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567020226] [2025-03-13 22:25:02,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567020226] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:02,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:02,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:02,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068855039] [2025-03-13 22:25:02,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:02,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:02,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:02,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:02,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:02,477 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-13 22:25:02,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 228 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:02,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-13 22:25:02,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:02,616 INFO L124 PetriNetUnfolderBase]: 301/996 cut-off events. [2025-03-13 22:25:02,617 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:02,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1482 conditions, 996 events. 301/996 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5031 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1441. Up to 434 conditions per place. [2025-03-13 22:25:02,624 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 0/227 dead transitions. [2025-03-13 22:25:02,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 227 transitions, 520 flow [2025-03-13 22:25:02,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:02,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-13 22:25:02,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-13 22:25:02,626 INFO L175 Difference]: Start difference. First operand has 229 places, 228 transitions, 470 flow. Second operand 3 states and 705 transitions. [2025-03-13 22:25:02,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 227 transitions, 520 flow [2025-03-13 22:25:02,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 227 transitions, 516 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:02,633 INFO L231 Difference]: Finished difference. Result has 228 places, 227 transitions, 468 flow [2025-03-13 22:25:02,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=228, PETRI_TRANSITIONS=227} [2025-03-13 22:25:02,634 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -55 predicate places. [2025-03-13 22:25:02,634 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 227 transitions, 468 flow [2025-03-13 22:25:02,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:02,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:02,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:25:02,634 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:02,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:02,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1280416715, now seen corresponding path program 1 times [2025-03-13 22:25:02,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:02,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229742316] [2025-03-13 22:25:02,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:02,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:02,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 22:25:02,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 22:25:02,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:02,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:02,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:02,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:02,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229742316] [2025-03-13 22:25:02,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229742316] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:02,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:02,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:02,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245645958] [2025-03-13 22:25:02,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:02,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:02,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:02,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:02,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:02,688 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-13 22:25:02,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 227 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,689 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:02,689 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-13 22:25:02,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:02,827 INFO L124 PetriNetUnfolderBase]: 301/995 cut-off events. [2025-03-13 22:25:02,827 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:02,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 995 events. 301/995 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5029 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1432. Up to 434 conditions per place. [2025-03-13 22:25:02,834 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 0/226 dead transitions. [2025-03-13 22:25:02,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 226 transitions, 518 flow [2025-03-13 22:25:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-13 22:25:02,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-13 22:25:02,836 INFO L175 Difference]: Start difference. First operand has 228 places, 227 transitions, 468 flow. Second operand 3 states and 705 transitions. [2025-03-13 22:25:02,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 226 transitions, 518 flow [2025-03-13 22:25:02,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:02,842 INFO L231 Difference]: Finished difference. Result has 227 places, 226 transitions, 466 flow [2025-03-13 22:25:02,842 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=466, PETRI_PLACES=227, PETRI_TRANSITIONS=226} [2025-03-13 22:25:02,843 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -56 predicate places. [2025-03-13 22:25:02,843 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 226 transitions, 466 flow [2025-03-13 22:25:02,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:02,844 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] [2025-03-13 22:25:02,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:25:02,844 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:02,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:02,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1100865142, now seen corresponding path program 1 times [2025-03-13 22:25:02,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:02,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197502292] [2025-03-13 22:25:02,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:02,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:02,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-13 22:25:02,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-13 22:25:02,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:02,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:02,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:02,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:02,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197502292] [2025-03-13 22:25:02,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197502292] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:02,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:02,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:02,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621075625] [2025-03-13 22:25:02,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:02,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:02,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:02,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:02,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:02,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-13 22:25:02,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 226 transitions, 466 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:02,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:02,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-13 22:25:02,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:03,069 INFO L124 PetriNetUnfolderBase]: 301/994 cut-off events. [2025-03-13 22:25:03,069 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:03,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 994 events. 301/994 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5027 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1423. Up to 434 conditions per place. [2025-03-13 22:25:03,075 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-13 22:25:03,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 225 transitions, 516 flow [2025-03-13 22:25:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-13 22:25:03,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-13 22:25:03,078 INFO L175 Difference]: Start difference. First operand has 227 places, 226 transitions, 466 flow. Second operand 3 states and 705 transitions. [2025-03-13 22:25:03,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 225 transitions, 516 flow [2025-03-13 22:25:03,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 225 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:03,081 INFO L231 Difference]: Finished difference. Result has 226 places, 225 transitions, 464 flow [2025-03-13 22:25:03,081 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=224, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=226, PETRI_TRANSITIONS=225} [2025-03-13 22:25:03,082 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -57 predicate places. [2025-03-13 22:25:03,082 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 225 transitions, 464 flow [2025-03-13 22:25:03,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,082 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:03,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:03,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:25:03,083 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:03,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:03,083 INFO L85 PathProgramCache]: Analyzing trace with hash -662976307, now seen corresponding path program 1 times [2025-03-13 22:25:03,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:03,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691781207] [2025-03-13 22:25:03,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:03,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:03,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-13 22:25:03,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-13 22:25:03,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:03,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:03,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:03,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691781207] [2025-03-13 22:25:03,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691781207] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:03,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:03,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:03,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400240375] [2025-03-13 22:25:03,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:03,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:03,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:03,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:03,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:03,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 309 [2025-03-13 22:25:03,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 225 transitions, 464 flow. Second operand has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:03,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 309 [2025-03-13 22:25:03,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:03,287 INFO L124 PetriNetUnfolderBase]: 301/993 cut-off events. [2025-03-13 22:25:03,288 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:03,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1480 conditions, 993 events. 301/993 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5042 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1415. Up to 435 conditions per place. [2025-03-13 22:25:03,293 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 25 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-03-13 22:25:03,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 224 transitions, 516 flow [2025-03-13 22:25:03,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 703 transitions. [2025-03-13 22:25:03,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7583603020496225 [2025-03-13 22:25:03,296 INFO L175 Difference]: Start difference. First operand has 226 places, 225 transitions, 464 flow. Second operand 3 states and 703 transitions. [2025-03-13 22:25:03,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 224 transitions, 516 flow [2025-03-13 22:25:03,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 224 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:03,299 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 462 flow [2025-03-13 22:25:03,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2025-03-13 22:25:03,301 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -58 predicate places. [2025-03-13 22:25:03,301 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 462 flow [2025-03-13 22:25:03,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.33333333333334) internal successors, (679), 3 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:03,302 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] [2025-03-13 22:25:03,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:25:03,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:03,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:03,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1169755543, now seen corresponding path program 1 times [2025-03-13 22:25:03,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:03,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935881461] [2025-03-13 22:25:03,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:03,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:03,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-13 22:25:03,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-13 22:25:03,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:03,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:03,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:03,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935881461] [2025-03-13 22:25:03,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935881461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:03,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:03,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:03,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824241014] [2025-03-13 22:25:03,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:03,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:03,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:03,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:03,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-13 22:25:03,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:03,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-13 22:25:03,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:03,506 INFO L124 PetriNetUnfolderBase]: 301/992 cut-off events. [2025-03-13 22:25:03,506 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:03,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1478 conditions, 992 events. 301/992 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5031 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1405. Up to 434 conditions per place. [2025-03-13 22:25:03,512 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-03-13 22:25:03,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 223 transitions, 512 flow [2025-03-13 22:25:03,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-13 22:25:03,513 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-13 22:25:03,513 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 462 flow. Second operand 3 states and 705 transitions. [2025-03-13 22:25:03,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 223 transitions, 512 flow [2025-03-13 22:25:03,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 223 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:03,516 INFO L231 Difference]: Finished difference. Result has 224 places, 223 transitions, 460 flow [2025-03-13 22:25:03,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=460, PETRI_PLACES=224, PETRI_TRANSITIONS=223} [2025-03-13 22:25:03,517 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -59 predicate places. [2025-03-13 22:25:03,517 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 223 transitions, 460 flow [2025-03-13 22:25:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:03,518 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] [2025-03-13 22:25:03,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:25:03,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:03,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1647060254, now seen corresponding path program 1 times [2025-03-13 22:25:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958826194] [2025-03-13 22:25:03,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:03,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:03,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 22:25:03,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 22:25:03,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:03,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:03,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:03,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958826194] [2025-03-13 22:25:03,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958826194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:03,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:03,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:03,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819062008] [2025-03-13 22:25:03,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:03,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:03,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:03,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:03,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:03,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-13 22:25:03,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 223 transitions, 460 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:03,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-13 22:25:03,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:03,678 INFO L124 PetriNetUnfolderBase]: 301/991 cut-off events. [2025-03-13 22:25:03,678 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:03,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 991 events. 301/991 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5034 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1396. Up to 434 conditions per place. [2025-03-13 22:25:03,685 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-03-13 22:25:03,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 222 transitions, 510 flow [2025-03-13 22:25:03,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-13 22:25:03,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-13 22:25:03,687 INFO L175 Difference]: Start difference. First operand has 224 places, 223 transitions, 460 flow. Second operand 3 states and 705 transitions. [2025-03-13 22:25:03,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 222 transitions, 510 flow [2025-03-13 22:25:03,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 506 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:03,690 INFO L231 Difference]: Finished difference. Result has 223 places, 222 transitions, 458 flow [2025-03-13 22:25:03,690 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=223, PETRI_TRANSITIONS=222} [2025-03-13 22:25:03,691 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -60 predicate places. [2025-03-13 22:25:03,692 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 222 transitions, 458 flow [2025-03-13 22:25:03,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:03,692 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:03,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:25:03,692 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:03,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1965272760, now seen corresponding path program 1 times [2025-03-13 22:25:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:03,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286612965] [2025-03-13 22:25:03,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:03,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:03,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-13 22:25:03,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-13 22:25:03,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:03,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:03,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:03,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286612965] [2025-03-13 22:25:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286612965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:03,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:03,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:03,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778170874] [2025-03-13 22:25:03,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:03,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:03,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:03,729 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:03,729 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:03,743 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-13 22:25:03,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 222 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:03,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-13 22:25:03,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:03,834 INFO L124 PetriNetUnfolderBase]: 301/989 cut-off events. [2025-03-13 22:25:03,834 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:03,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1475 conditions, 989 events. 301/989 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5031 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1386. Up to 434 conditions per place. [2025-03-13 22:25:03,840 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 25 selfloop transitions, 1 changer transitions 0/220 dead transitions. [2025-03-13 22:25:03,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 220 transitions, 506 flow [2025-03-13 22:25:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:03,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:03,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 706 transitions. [2025-03-13 22:25:03,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.761596548004315 [2025-03-13 22:25:03,842 INFO L175 Difference]: Start difference. First operand has 223 places, 222 transitions, 458 flow. Second operand 3 states and 706 transitions. [2025-03-13 22:25:03,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 220 transitions, 506 flow [2025-03-13 22:25:03,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 220 transitions, 502 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:03,845 INFO L231 Difference]: Finished difference. Result has 221 places, 220 transitions, 452 flow [2025-03-13 22:25:03,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=221, PETRI_TRANSITIONS=220} [2025-03-13 22:25:03,846 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -62 predicate places. [2025-03-13 22:25:03,846 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 220 transitions, 452 flow [2025-03-13 22:25:03,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:03,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:03,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:03,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:25:03,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:03,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:03,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1152798048, now seen corresponding path program 1 times [2025-03-13 22:25:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211138080] [2025-03-13 22:25:03,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:03,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:03,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-13 22:25:03,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-13 22:25:03,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:03,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:04,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:04,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:04,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211138080] [2025-03-13 22:25:04,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211138080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:04,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:04,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:25:04,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127534686] [2025-03-13 22:25:04,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:04,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:25:04,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:04,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:25:04,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:25:04,423 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 309 [2025-03-13 22:25:04,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 220 transitions, 452 flow. Second operand has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:04,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 309 [2025-03-13 22:25:04,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:04,546 INFO L124 PetriNetUnfolderBase]: 301/988 cut-off events. [2025-03-13 22:25:04,546 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:04,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1481 conditions, 988 events. 301/988 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5029 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1393. Up to 439 conditions per place. [2025-03-13 22:25:04,550 INFO L140 encePairwiseOnDemand]: 303/309 looper letters, 29 selfloop transitions, 5 changer transitions 0/219 dead transitions. [2025-03-13 22:25:04,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 219 transitions, 518 flow [2025-03-13 22:25:04,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:25:04,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:25:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1349 transitions. [2025-03-13 22:25:04,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7276159654800431 [2025-03-13 22:25:04,553 INFO L175 Difference]: Start difference. First operand has 221 places, 220 transitions, 452 flow. Second operand 6 states and 1349 transitions. [2025-03-13 22:25:04,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 219 transitions, 518 flow [2025-03-13 22:25:04,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 219 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:04,556 INFO L231 Difference]: Finished difference. Result has 224 places, 219 transitions, 459 flow [2025-03-13 22:25:04,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=459, PETRI_PLACES=224, PETRI_TRANSITIONS=219} [2025-03-13 22:25:04,557 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -59 predicate places. [2025-03-13 22:25:04,557 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 219 transitions, 459 flow [2025-03-13 22:25:04,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 220.5) internal successors, (1323), 6 states have internal predecessors, (1323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:04,558 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:04,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:25:04,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:04,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:04,558 INFO L85 PathProgramCache]: Analyzing trace with hash 379789726, now seen corresponding path program 1 times [2025-03-13 22:25:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:04,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842202425] [2025-03-13 22:25:04,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:04,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:04,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-13 22:25:04,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-13 22:25:04,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:04,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:04,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:04,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842202425] [2025-03-13 22:25:04,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842202425] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:04,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:04,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:04,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8723580] [2025-03-13 22:25:04,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:04,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:04,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:04,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:04,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:04,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 309 [2025-03-13 22:25:04,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 219 transitions, 459 flow. Second operand has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:04,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 309 [2025-03-13 22:25:04,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:04,688 INFO L124 PetriNetUnfolderBase]: 301/987 cut-off events. [2025-03-13 22:25:04,688 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:04,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 987 events. 301/987 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5022 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1459. Up to 434 conditions per place. [2025-03-13 22:25:04,692 INFO L140 encePairwiseOnDemand]: 306/309 looper letters, 24 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2025-03-13 22:25:04,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 218 transitions, 509 flow [2025-03-13 22:25:04,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:04,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 705 transitions. [2025-03-13 22:25:04,694 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605177993527508 [2025-03-13 22:25:04,694 INFO L175 Difference]: Start difference. First operand has 224 places, 219 transitions, 459 flow. Second operand 3 states and 705 transitions. [2025-03-13 22:25:04,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 218 transitions, 509 flow [2025-03-13 22:25:04,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 218 transitions, 499 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:25:04,697 INFO L231 Difference]: Finished difference. Result has 220 places, 218 transitions, 451 flow [2025-03-13 22:25:04,697 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=220, PETRI_TRANSITIONS=218} [2025-03-13 22:25:04,697 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -63 predicate places. [2025-03-13 22:25:04,697 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 218 transitions, 451 flow [2025-03-13 22:25:04,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.33333333333334) internal successors, (682), 3 states have internal predecessors, (682), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:04,698 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:04,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:25:04,698 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -532331210, now seen corresponding path program 1 times [2025-03-13 22:25:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739046806] [2025-03-13 22:25:04,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:04,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 186 statements into 1 equivalence classes. [2025-03-13 22:25:04,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 186 of 186 statements. [2025-03-13 22:25:04,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:04,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:04,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:04,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739046806] [2025-03-13 22:25:04,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739046806] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:04,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:04,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:04,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183225423] [2025-03-13 22:25:04,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:04,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:04,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:04,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:04,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 309 [2025-03-13 22:25:04,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 218 transitions, 451 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,757 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:04,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 309 [2025-03-13 22:25:04,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:04,850 INFO L124 PetriNetUnfolderBase]: 301/986 cut-off events. [2025-03-13 22:25:04,851 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:04,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1471 conditions, 986 events. 301/986 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5013 event pairs, 159 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 1382. Up to 432 conditions per place. [2025-03-13 22:25:04,855 INFO L140 encePairwiseOnDemand]: 307/309 looper letters, 23 selfloop transitions, 1 changer transitions 0/217 dead transitions. [2025-03-13 22:25:04,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 217 transitions, 497 flow [2025-03-13 22:25:04,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 712 transitions. [2025-03-13 22:25:04,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7680690399137001 [2025-03-13 22:25:04,857 INFO L175 Difference]: Start difference. First operand has 220 places, 218 transitions, 451 flow. Second operand 3 states and 712 transitions. [2025-03-13 22:25:04,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 217 transitions, 497 flow [2025-03-13 22:25:04,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 217 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:25:04,860 INFO L231 Difference]: Finished difference. Result has 219 places, 217 transitions, 447 flow [2025-03-13 22:25:04,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=219, PETRI_TRANSITIONS=217} [2025-03-13 22:25:04,860 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -64 predicate places. [2025-03-13 22:25:04,860 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 217 transitions, 447 flow [2025-03-13 22:25:04,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,861 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:25:04,861 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:04,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:25:04,861 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 103 more)] === [2025-03-13 22:25:04,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:25:04,862 INFO L85 PathProgramCache]: Analyzing trace with hash 483515417, now seen corresponding path program 1 times [2025-03-13 22:25:04,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:25:04,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768402719] [2025-03-13 22:25:04,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:25:04,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:25:04,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-03-13 22:25:04,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-03-13 22:25:04,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:25:04,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:25:04,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:25:04,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:25:04,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768402719] [2025-03-13 22:25:04,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768402719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:25:04,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:25:04,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:25:04,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541525622] [2025-03-13 22:25:04,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:25:04,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:25:04,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:25:04,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:25:04,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:25:04,937 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 309 [2025-03-13 22:25:04,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 217 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:04,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:25:04,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 309 [2025-03-13 22:25:04,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:25:05,028 INFO L124 PetriNetUnfolderBase]: 301/985 cut-off events. [2025-03-13 22:25:05,028 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:25:05,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1468 conditions, 985 events. 301/985 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 5020 event pairs, 159 based on Foata normal form. 1/896 useless extension candidates. Maximal degree in co-relation 1460. Up to 432 conditions per place. [2025-03-13 22:25:05,031 INFO L140 encePairwiseOnDemand]: 307/309 looper letters, 0 selfloop transitions, 0 changer transitions 216/216 dead transitions. [2025-03-13 22:25:05,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 216 transitions, 491 flow [2025-03-13 22:25:05,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:25:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:25:05,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 711 transitions. [2025-03-13 22:25:05,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7669902912621359 [2025-03-13 22:25:05,033 INFO L175 Difference]: Start difference. First operand has 219 places, 217 transitions, 447 flow. Second operand 3 states and 711 transitions. [2025-03-13 22:25:05,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 216 transitions, 491 flow [2025-03-13 22:25:05,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 216 transitions, 490 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:25:05,036 INFO L231 Difference]: Finished difference. Result has 219 places, 0 transitions, 0 flow [2025-03-13 22:25:05,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=309, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=219, PETRI_TRANSITIONS=0} [2025-03-13 22:25:05,037 INFO L279 CegarLoopForPetriNet]: 283 programPoint places, -64 predicate places. [2025-03-13 22:25:05,037 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 0 transitions, 0 flow [2025-03-13 22:25:05,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:25:05,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (105 of 106 remaining) [2025-03-13 22:25:05,039 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (104 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (103 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (102 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (101 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (100 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (99 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (98 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (97 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (96 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (95 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (94 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (93 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (92 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (91 of 106 remaining) [2025-03-13 22:25:05,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (90 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (89 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (88 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (87 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (86 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (85 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (84 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (83 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (82 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (81 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (80 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (79 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (78 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (77 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (76 of 106 remaining) [2025-03-13 22:25:05,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (75 of 106 remaining) [2025-03-13 22:25:05,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (74 of 106 remaining) [2025-03-13 22:25:05,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (73 of 106 remaining) [2025-03-13 22:25:05,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (72 of 106 remaining) [2025-03-13 22:25:05,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (71 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (70 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (69 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (68 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (67 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (66 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (65 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (64 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (63 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (62 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (61 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (59 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (58 of 106 remaining) [2025-03-13 22:25:05,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (57 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (56 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (55 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (54 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (53 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (52 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (51 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (50 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (49 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (48 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (47 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (46 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (45 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (43 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork0Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 106 remaining) [2025-03-13 22:25:05,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork0Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (40 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (39 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (38 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (37 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (36 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (35 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (34 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (32 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (31 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (30 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (29 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (28 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (27 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (26 of 106 remaining) [2025-03-13 22:25:05,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (25 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (24 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (23 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (22 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (21 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (20 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (19 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (18 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (17 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (16 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (15 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (14 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (12 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (11 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (10 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (9 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (8 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (7 of 106 remaining) [2025-03-13 22:25:05,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (6 of 106 remaining) [2025-03-13 22:25:05,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (5 of 106 remaining) [2025-03-13 22:25:05,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (4 of 106 remaining) [2025-03-13 22:25:05,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (3 of 106 remaining) [2025-03-13 22:25:05,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (2 of 106 remaining) [2025-03-13 22:25:05,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (1 of 106 remaining) [2025-03-13 22:25:05,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (0 of 106 remaining) [2025-03-13 22:25:05,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:25:05,047 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:25:05,053 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-13 22:25:05,053 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:25:05,057 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:25:05 BasicIcfg [2025-03-13 22:25:05,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:25:05,058 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:25:05,058 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:25:05,058 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:25:05,059 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:25:01" (3/4) ... [2025-03-13 22:25:05,060 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-13 22:25:05,062 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-13 22:25:05,062 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-13 22:25:05,062 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-13 22:25:05,063 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-03-13 22:25:05,067 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-13 22:25:05,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-13 22:25:05,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-13 22:25:05,068 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-13 22:25:05,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:25:05,132 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:25:05,132 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:25:05,133 INFO L158 Benchmark]: Toolchain (without parser) took 4792.87ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 123.6MB in the beginning and 221.6MB in the end (delta: -98.0MB). Peak memory consumption was 69.0MB. Max. memory is 16.1GB. [2025-03-13 22:25:05,134 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:25:05,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.45ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:05,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.39ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 106.4MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:05,135 INFO L158 Benchmark]: Boogie Preprocessor took 22.58ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 105.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:25:05,135 INFO L158 Benchmark]: IcfgBuilder took 807.01ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 83.5MB in the end (delta: 21.8MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. [2025-03-13 22:25:05,136 INFO L158 Benchmark]: TraceAbstraction took 3631.39ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 83.5MB in the beginning and 226.2MB in the end (delta: -142.6MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2025-03-13 22:25:05,136 INFO L158 Benchmark]: Witness Printer took 74.42ms. Allocated memory is still 335.5MB. Free memory was 226.2MB in the beginning and 221.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:25:05,137 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.34ms. Allocated memory is still 201.3MB. Free memory is still 115.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.45ms. Allocated memory is still 167.8MB. Free memory was 122.4MB in the beginning and 110.2MB in the end (delta: 12.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.39ms. Allocated memory is still 167.8MB. Free memory was 110.2MB in the beginning and 106.4MB in the end (delta: 3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.58ms. Allocated memory is still 167.8MB. Free memory was 106.4MB in the beginning and 105.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 807.01ms. Allocated memory is still 167.8MB. Free memory was 105.3MB in the beginning and 83.5MB in the end (delta: 21.8MB). Peak memory consumption was 82.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3631.39ms. Allocated memory was 167.8MB in the beginning and 335.5MB in the end (delta: 167.8MB). Free memory was 83.5MB in the beginning and 226.2MB in the end (delta: -142.6MB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * Witness Printer took 74.42ms. Allocated memory is still 335.5MB. Free memory was 226.2MB in the beginning and 221.6MB in the end (delta: 4.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 130]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 135]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 143]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: 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 9 procedures, 398 locations, 106 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: 3.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 60 mSDsluCounter, 74 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 732 IncrementalHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 74 mSDtfsCounter, 732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=594occurred in iteration=0, InterpolantAutomatonStates: 42, 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.9s InterpolantComputationTime, 1129 NumberOfCodeBlocks, 1129 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1116 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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 57 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-13 22:25:05,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE