./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.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 ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:59:53,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:59:53,577 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:59:53,585 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:59:53,586 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:59:53,618 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:59:53,619 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:59:53,620 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:59:53,621 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:59:53,625 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:59:53,626 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:59:53,626 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:59:53,626 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:59:53,626 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:59:53,627 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:59:53,627 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:59:53,627 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:59:53,628 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:59:53,628 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:59:53,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:59:53,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:59:53,631 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:59:53,631 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:59:53,631 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:59:53,632 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:59:53,633 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:59:53,633 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:59:53,633 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:59:53,634 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:59:53,634 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:59:53,634 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:59:53,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:59:53,635 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:59:53,636 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:59:53,636 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:59:53,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:59:53,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:59:53,637 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:59:53,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:59:53,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:59:53,638 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:59:53,639 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> ec2334e7e9ec2636c6abf161aed91fff94fbff3709d38c7edad92256c3b5dc81 [2024-10-13 09:59:53,916 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:59:53,947 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:59:53,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:59:53,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:59:53,954 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:59:53,955 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2024-10-13 09:59:55,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:59:55,701 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:59:55,702 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-commit-2.wvr.c [2024-10-13 09:59:55,715 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bf65908/3e503a2d4aea477ba64509c7be8b83d2/FLAG8f426c187 [2024-10-13 09:59:55,729 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32bf65908/3e503a2d4aea477ba64509c7be8b83d2 [2024-10-13 09:59:55,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:59:55,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:59:55,734 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:59:55,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:59:55,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:59:55,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:59:55" (1/1) ... [2024-10-13 09:59:55,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d838f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:55, skipping insertion in model container [2024-10-13 09:59:55,743 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:59:55" (1/1) ... [2024-10-13 09:59:55,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:59:56,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:59:56,056 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:59:56,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:59:56,137 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:59:56,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56 WrapperNode [2024-10-13 09:59:56,138 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:59:56,139 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:59:56,139 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:59:56,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:59:56,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,251 INFO L138 Inliner]: procedures = 25, calls = 74, calls flagged for inlining = 28, calls inlined = 34, statements flattened = 993 [2024-10-13 09:59:56,251 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:59:56,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:59:56,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:59:56,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:59:56,263 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,339 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,365 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:59:56,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:59:56,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:59:56,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:59:56,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (1/1) ... [2024-10-13 09:59:56,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:59:56,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:59:56,407 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) [2024-10-13 09:59:56,413 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 [2024-10-13 09:59:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:59:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 09:59:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 09:59:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 09:59:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 09:59:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 09:59:56,459 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 09:59:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-10-13 09:59:56,460 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-10-13 09:59:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:59:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 09:59:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 09:59:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 09:59:56,460 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:59:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:59:56,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:59:56,461 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 09:59:56,465 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:59:56,629 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:59:56,630 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:59:57,815 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:59:57,816 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:59:59,092 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:59:59,093 INFO L314 CfgBuilder]: Removed 8 assume(true) statements. [2024-10-13 09:59:59,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:59 BoogieIcfgContainer [2024-10-13 09:59:59,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:59:59,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:59:59,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:59:59,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:59:59,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:59:55" (1/3) ... [2024-10-13 09:59:59,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be7d56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:59:59, skipping insertion in model container [2024-10-13 09:59:59,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:59:56" (2/3) ... [2024-10-13 09:59:59,103 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7be7d56e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:59:59, skipping insertion in model container [2024-10-13 09:59:59,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:59" (3/3) ... [2024-10-13 09:59:59,105 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-commit-2.wvr.c [2024-10-13 09:59:59,123 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:59:59,123 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 164 error locations. [2024-10-13 09:59:59,123 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:59:59,306 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-10-13 09:59:59,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 614 places, 626 transitions, 1280 flow [2024-10-13 09:59:59,636 INFO L124 PetriNetUnfolderBase]: 25/622 cut-off events. [2024-10-13 09:59:59,637 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:59:59,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 622 events. 25/622 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1159 event pairs, 0 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 568. Up to 2 conditions per place. [2024-10-13 09:59:59,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 614 places, 626 transitions, 1280 flow [2024-10-13 09:59:59,673 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 594 places, 605 transitions, 1234 flow [2024-10-13 09:59:59,682 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:59:59,689 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;@5252a2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:59:59,690 INFO L334 AbstractCegarLoop]: Starting to check reachability of 300 error locations. [2024-10-13 09:59:59,697 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:59:59,697 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-10-13 09:59:59,698 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:59:59,698 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:59:59,699 INFO L204 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] [2024-10-13 09:59:59,700 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 09:59:59,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:59:59,705 INFO L85 PathProgramCache]: Analyzing trace with hash -227247349, now seen corresponding path program 1 times [2024-10-13 09:59:59,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:59:59,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318705461] [2024-10-13 09:59:59,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:59:59,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:59:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:59:59,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:59:59,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:59:59,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318705461] [2024-10-13 09:59:59,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318705461] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:59:59,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:59:59,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:59:59,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51769323] [2024-10-13 09:59:59,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:59:59,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:59:59,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:59:59,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:59:59,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:00,008 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:00,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 594 places, 605 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:00,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:00,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:00,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:01,269 INFO L124 PetriNetUnfolderBase]: 865/3083 cut-off events. [2024-10-13 10:00:01,269 INFO L125 PetriNetUnfolderBase]: For 272/272 co-relation queries the response was YES. [2024-10-13 10:00:01,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4495 conditions, 3083 events. 865/3083 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 23430 event pairs, 503 based on Foata normal form. 555/3324 useless extension candidates. Maximal degree in co-relation 3569. Up to 1158 conditions per place. [2024-10-13 10:00:01,297 INFO L140 encePairwiseOnDemand]: 475/626 looper letters, 24 selfloop transitions, 2 changer transitions 8/456 dead transitions. [2024-10-13 10:00:01,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 463 places, 456 transitions, 988 flow [2024-10-13 10:00:01,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:01,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:01,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1519 transitions. [2024-10-13 10:00:01,322 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.808839190628328 [2024-10-13 10:00:01,324 INFO L175 Difference]: Start difference. First operand has 594 places, 605 transitions, 1234 flow. Second operand 3 states and 1519 transitions. [2024-10-13 10:00:01,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 463 places, 456 transitions, 988 flow [2024-10-13 10:00:01,335 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 455 places, 456 transitions, 972 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-10-13 10:00:01,344 INFO L231 Difference]: Finished difference. Result has 455 places, 448 transitions, 908 flow [2024-10-13 10:00:01,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=453, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=456, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=455, PETRI_TRANSITIONS=448} [2024-10-13 10:00:01,350 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -139 predicate places. [2024-10-13 10:00:01,351 INFO L471 AbstractCegarLoop]: Abstraction has has 455 places, 448 transitions, 908 flow [2024-10-13 10:00:01,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:01,352 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:01,352 INFO L204 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] [2024-10-13 10:00:01,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:00:01,353 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:01,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:01,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1560247909, now seen corresponding path program 1 times [2024-10-13 10:00:01,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:01,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126845098] [2024-10-13 10:00:01,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:01,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:01,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:01,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:01,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126845098] [2024-10-13 10:00:01,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126845098] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:01,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:01,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:01,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721571409] [2024-10-13 10:00:01,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:01,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:01,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:01,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:01,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:01,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:01,465 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 455 places, 448 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:01,465 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:01,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:01,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:02,550 INFO L124 PetriNetUnfolderBase]: 865/3074 cut-off events. [2024-10-13 10:00:02,551 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-13 10:00:02,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4325 conditions, 3074 events. 865/3074 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 23423 event pairs, 503 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 4283. Up to 1158 conditions per place. [2024-10-13 10:00:02,579 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 24 selfloop transitions, 2 changer transitions 0/447 dead transitions. [2024-10-13 10:00:02,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 448 places, 447 transitions, 958 flow [2024-10-13 10:00:02,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:02,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:02,584 INFO L175 Difference]: Start difference. First operand has 455 places, 448 transitions, 908 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:02,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 448 places, 447 transitions, 958 flow [2024-10-13 10:00:02,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 446 places, 447 transitions, 954 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:02,594 INFO L231 Difference]: Finished difference. Result has 446 places, 447 transitions, 906 flow [2024-10-13 10:00:02,595 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=906, PETRI_PLACES=446, PETRI_TRANSITIONS=447} [2024-10-13 10:00:02,596 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -148 predicate places. [2024-10-13 10:00:02,596 INFO L471 AbstractCegarLoop]: Abstraction has has 446 places, 447 transitions, 906 flow [2024-10-13 10:00:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:02,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:02,598 INFO L204 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] [2024-10-13 10:00:02,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:00:02,598 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:02,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:02,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1938497711, now seen corresponding path program 1 times [2024-10-13 10:00:02,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:02,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824366848] [2024-10-13 10:00:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:02,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:02,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:02,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824366848] [2024-10-13 10:00:02,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824366848] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:02,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:02,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178974683] [2024-10-13 10:00:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:02,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:02,711 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:02,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 446 places, 447 transitions, 906 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:02,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:02,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:02,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:03,600 INFO L124 PetriNetUnfolderBase]: 865/3073 cut-off events. [2024-10-13 10:00:03,600 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-10-13 10:00:03,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4324 conditions, 3073 events. 865/3073 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 23421 event pairs, 503 based on Foata normal form. 0/2769 useless extension candidates. Maximal degree in co-relation 4274. Up to 1158 conditions per place. [2024-10-13 10:00:03,623 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 24 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2024-10-13 10:00:03,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 446 transitions, 956 flow [2024-10-13 10:00:03,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:03,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:03,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:03,627 INFO L175 Difference]: Start difference. First operand has 446 places, 447 transitions, 906 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:03,628 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 446 transitions, 956 flow [2024-10-13 10:00:03,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 446 transitions, 952 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:03,636 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 904 flow [2024-10-13 10:00:03,637 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=900, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=445, PETRI_TRANSITIONS=446} [2024-10-13 10:00:03,638 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2024-10-13 10:00:03,638 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 904 flow [2024-10-13 10:00:03,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:03,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:03,640 INFO L204 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] [2024-10-13 10:00:03,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:00:03,640 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -2094399981, now seen corresponding path program 1 times [2024-10-13 10:00:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:03,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340425413] [2024-10-13 10:00:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:03,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:03,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:03,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340425413] [2024-10-13 10:00:03,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340425413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:03,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:03,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:03,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551962044] [2024-10-13 10:00:03,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:03,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:03,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:03,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:03,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:03,729 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:03,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 446 transitions, 904 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:03,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:03,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:03,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:04,703 INFO L124 PetriNetUnfolderBase]: 1019/2661 cut-off events. [2024-10-13 10:00:04,703 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-10-13 10:00:04,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 2661 events. 1019/2661 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 16225 event pairs, 131 based on Foata normal form. 0/2498 useless extension candidates. Maximal degree in co-relation 4070. Up to 1121 conditions per place. [2024-10-13 10:00:04,729 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 35 selfloop transitions, 2 changer transitions 0/459 dead transitions. [2024-10-13 10:00:04,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 459 transitions, 1011 flow [2024-10-13 10:00:04,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:04,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:04,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1394 transitions. [2024-10-13 10:00:04,734 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7422790202342918 [2024-10-13 10:00:04,734 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 904 flow. Second operand 3 states and 1394 transitions. [2024-10-13 10:00:04,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 459 transitions, 1011 flow [2024-10-13 10:00:04,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 459 transitions, 1007 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:04,744 INFO L231 Difference]: Finished difference. Result has 445 places, 446 transitions, 908 flow [2024-10-13 10:00:04,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=445, PETRI_TRANSITIONS=446} [2024-10-13 10:00:04,746 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2024-10-13 10:00:04,746 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 446 transitions, 908 flow [2024-10-13 10:00:04,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:04,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:04,747 INFO L204 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] [2024-10-13 10:00:04,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:00:04,748 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:04,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:04,749 INFO L85 PathProgramCache]: Analyzing trace with hash -922300295, now seen corresponding path program 1 times [2024-10-13 10:00:04,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:04,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49190537] [2024-10-13 10:00:04,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:04,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:04,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:04,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49190537] [2024-10-13 10:00:04,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49190537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:04,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:04,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:04,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106364905] [2024-10-13 10:00:04,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:04,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:04,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:04,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:04,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:04,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:04,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 446 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:04,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:04,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:04,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:05,621 INFO L124 PetriNetUnfolderBase]: 954/3323 cut-off events. [2024-10-13 10:00:05,621 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-10-13 10:00:05,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4809 conditions, 3323 events. 954/3323 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 25637 event pairs, 569 based on Foata normal form. 0/3004 useless extension candidates. Maximal degree in co-relation 3459. Up to 1287 conditions per place. [2024-10-13 10:00:05,648 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 24 selfloop transitions, 2 changer transitions 0/445 dead transitions. [2024-10-13 10:00:05,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 445 transitions, 958 flow [2024-10-13 10:00:05,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:05,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:05,656 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:05,657 INFO L175 Difference]: Start difference. First operand has 445 places, 446 transitions, 908 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:05,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 445 transitions, 958 flow [2024-10-13 10:00:05,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 445 transitions, 956 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:05,666 INFO L231 Difference]: Finished difference. Result has 445 places, 445 transitions, 908 flow [2024-10-13 10:00:05,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=908, PETRI_PLACES=445, PETRI_TRANSITIONS=445} [2024-10-13 10:00:05,667 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -149 predicate places. [2024-10-13 10:00:05,668 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 445 transitions, 908 flow [2024-10-13 10:00:05,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:05,669 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:05,669 INFO L204 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] [2024-10-13 10:00:05,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:00:05,670 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:05,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:05,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1339123555, now seen corresponding path program 1 times [2024-10-13 10:00:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:05,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615430895] [2024-10-13 10:00:05,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:05,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:05,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:05,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:05,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615430895] [2024-10-13 10:00:05,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615430895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:05,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:05,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:05,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788683055] [2024-10-13 10:00:05,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:05,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:05,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:05,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:05,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 445 transitions, 908 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:05,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:05,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:05,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:06,531 INFO L124 PetriNetUnfolderBase]: 954/3322 cut-off events. [2024-10-13 10:00:06,532 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-10-13 10:00:06,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4774 conditions, 3322 events. 954/3322 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 25627 event pairs, 569 based on Foata normal form. 0/3004 useless extension candidates. Maximal degree in co-relation 4707. Up to 1285 conditions per place. [2024-10-13 10:00:06,562 INFO L140 encePairwiseOnDemand]: 624/626 looper letters, 23 selfloop transitions, 1 changer transitions 0/444 dead transitions. [2024-10-13 10:00:06,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 444 transitions, 954 flow [2024-10-13 10:00:06,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:06,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:06,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2024-10-13 10:00:06,566 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348242811501597 [2024-10-13 10:00:06,566 INFO L175 Difference]: Start difference. First operand has 445 places, 445 transitions, 908 flow. Second operand 3 states and 1380 transitions. [2024-10-13 10:00:06,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 444 transitions, 954 flow [2024-10-13 10:00:06,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 444 transitions, 950 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:06,573 INFO L231 Difference]: Finished difference. Result has 444 places, 444 transitions, 904 flow [2024-10-13 10:00:06,574 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=902, PETRI_DIFFERENCE_MINUEND_PLACES=442, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=444, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=904, PETRI_PLACES=444, PETRI_TRANSITIONS=444} [2024-10-13 10:00:06,575 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2024-10-13 10:00:06,575 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 444 transitions, 904 flow [2024-10-13 10:00:06,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:06,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:06,577 INFO L204 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] [2024-10-13 10:00:06,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:00:06,577 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:06,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:06,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1931445746, now seen corresponding path program 1 times [2024-10-13 10:00:06,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:06,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120073865] [2024-10-13 10:00:06,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:06,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:07,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:07,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:07,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120073865] [2024-10-13 10:00:07,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120073865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:07,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:07,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:07,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349856202] [2024-10-13 10:00:07,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:07,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:07,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:07,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:07,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:07,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 400 out of 626 [2024-10-13 10:00:07,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 444 transitions, 904 flow. Second operand has 6 states, 6 states have (on average 401.5) internal successors, (2409), 6 states have internal predecessors, (2409), 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) [2024-10-13 10:00:07,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:07,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 400 of 626 [2024-10-13 10:00:07,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:08,161 INFO L124 PetriNetUnfolderBase]: 954/3318 cut-off events. [2024-10-13 10:00:08,161 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-10-13 10:00:08,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4818 conditions, 3318 events. 954/3318 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 25628 event pairs, 569 based on Foata normal form. 0/3004 useless extension candidates. Maximal degree in co-relation 4752. Up to 1316 conditions per place. [2024-10-13 10:00:08,192 INFO L140 encePairwiseOnDemand]: 602/626 looper letters, 53 selfloop transitions, 20 changer transitions 0/440 dead transitions. [2024-10-13 10:00:08,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1042 flow [2024-10-13 10:00:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:08,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:08,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2476 transitions. [2024-10-13 10:00:08,199 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6592119275825347 [2024-10-13 10:00:08,199 INFO L175 Difference]: Start difference. First operand has 444 places, 444 transitions, 904 flow. Second operand 6 states and 2476 transitions. [2024-10-13 10:00:08,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1042 flow [2024-10-13 10:00:08,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1041 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:08,206 INFO L231 Difference]: Finished difference. Result has 444 places, 440 transitions, 935 flow [2024-10-13 10:00:08,207 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=440, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=935, PETRI_PLACES=444, PETRI_TRANSITIONS=440} [2024-10-13 10:00:08,209 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -150 predicate places. [2024-10-13 10:00:08,210 INFO L471 AbstractCegarLoop]: Abstraction has has 444 places, 440 transitions, 935 flow [2024-10-13 10:00:08,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 401.5) internal successors, (2409), 6 states have internal predecessors, (2409), 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) [2024-10-13 10:00:08,212 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:08,212 INFO L204 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] [2024-10-13 10:00:08,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:00:08,213 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:08,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:08,214 INFO L85 PathProgramCache]: Analyzing trace with hash -649436743, now seen corresponding path program 1 times [2024-10-13 10:00:08,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:08,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900751736] [2024-10-13 10:00:08,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:08,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:08,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:08,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:08,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900751736] [2024-10-13 10:00:08,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900751736] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:08,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:08,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:08,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210291681] [2024-10-13 10:00:08,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:08,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:08,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:08,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:08,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:08,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:08,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 444 places, 440 transitions, 935 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:08,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:08,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:08,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:09,169 INFO L124 PetriNetUnfolderBase]: 954/3317 cut-off events. [2024-10-13 10:00:09,169 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-10-13 10:00:09,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4790 conditions, 3317 events. 954/3317 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 25660 event pairs, 569 based on Foata normal form. 0/3004 useless extension candidates. Maximal degree in co-relation 4726. Up to 1287 conditions per place. [2024-10-13 10:00:09,195 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 24 selfloop transitions, 2 changer transitions 0/439 dead transitions. [2024-10-13 10:00:09,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 985 flow [2024-10-13 10:00:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:09,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:09,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:09,200 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:09,200 INFO L175 Difference]: Start difference. First operand has 444 places, 440 transitions, 935 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:09,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 985 flow [2024-10-13 10:00:09,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 439 transitions, 945 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:09,210 INFO L231 Difference]: Finished difference. Result has 440 places, 439 transitions, 897 flow [2024-10-13 10:00:09,211 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=437, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=440, PETRI_TRANSITIONS=439} [2024-10-13 10:00:09,212 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -154 predicate places. [2024-10-13 10:00:09,212 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 439 transitions, 897 flow [2024-10-13 10:00:09,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:09,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:09,214 INFO L204 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] [2024-10-13 10:00:09,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:00:09,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:09,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:09,215 INFO L85 PathProgramCache]: Analyzing trace with hash 290133932, now seen corresponding path program 1 times [2024-10-13 10:00:09,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:09,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435051146] [2024-10-13 10:00:09,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:09,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:09,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435051146] [2024-10-13 10:00:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435051146] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:09,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:09,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175255436] [2024-10-13 10:00:09,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:09,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:09,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:09,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:09,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:09,279 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:09,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 439 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:09,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:09,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:09,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:10,305 INFO L124 PetriNetUnfolderBase]: 954/3316 cut-off events. [2024-10-13 10:00:10,305 INFO L125 PetriNetUnfolderBase]: For 139/139 co-relation queries the response was YES. [2024-10-13 10:00:10,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4772 conditions, 3316 events. 954/3316 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 25622 event pairs, 569 based on Foata normal form. 0/3004 useless extension candidates. Maximal degree in co-relation 4705. Up to 1288 conditions per place. [2024-10-13 10:00:10,335 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 25 selfloop transitions, 2 changer transitions 0/438 dead transitions. [2024-10-13 10:00:10,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 438 transitions, 949 flow [2024-10-13 10:00:10,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:10,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:10,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:10,340 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:10,340 INFO L175 Difference]: Start difference. First operand has 440 places, 439 transitions, 897 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:10,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 438 transitions, 949 flow [2024-10-13 10:00:10,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 438 transitions, 945 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:10,350 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 895 flow [2024-10-13 10:00:10,351 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=438, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=436, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=895, PETRI_PLACES=439, PETRI_TRANSITIONS=438} [2024-10-13 10:00:10,352 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2024-10-13 10:00:10,352 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 895 flow [2024-10-13 10:00:10,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:10,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:10,354 INFO L204 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] [2024-10-13 10:00:10,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:00:10,354 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:10,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:10,355 INFO L85 PathProgramCache]: Analyzing trace with hash -948293547, now seen corresponding path program 1 times [2024-10-13 10:00:10,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:10,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293810559] [2024-10-13 10:00:10,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:10,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:10,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:10,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293810559] [2024-10-13 10:00:10,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293810559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:10,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:10,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:10,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849742806] [2024-10-13 10:00:10,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:10,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:10,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:10,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:10,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:10,409 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:10,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 438 transitions, 895 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:10,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:10,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:10,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:11,404 INFO L124 PetriNetUnfolderBase]: 1293/4020 cut-off events. [2024-10-13 10:00:11,404 INFO L125 PetriNetUnfolderBase]: For 212/212 co-relation queries the response was YES. [2024-10-13 10:00:11,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5951 conditions, 4020 events. 1293/4020 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 32189 event pairs, 462 based on Foata normal form. 0/3710 useless extension candidates. Maximal degree in co-relation 5885. Up to 939 conditions per place. [2024-10-13 10:00:11,422 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 39 selfloop transitions, 2 changer transitions 0/454 dead transitions. [2024-10-13 10:00:11,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 454 transitions, 1017 flow [2024-10-13 10:00:11,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:11,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:11,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2024-10-13 10:00:11,426 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7433439829605963 [2024-10-13 10:00:11,426 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 895 flow. Second operand 3 states and 1396 transitions. [2024-10-13 10:00:11,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 454 transitions, 1017 flow [2024-10-13 10:00:11,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 454 transitions, 1013 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:11,434 INFO L231 Difference]: Finished difference. Result has 439 places, 438 transitions, 899 flow [2024-10-13 10:00:11,435 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=439, PETRI_TRANSITIONS=438} [2024-10-13 10:00:11,436 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2024-10-13 10:00:11,436 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 438 transitions, 899 flow [2024-10-13 10:00:11,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:11,437 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:11,438 INFO L204 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] [2024-10-13 10:00:11,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:00:11,438 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:11,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:11,439 INFO L85 PathProgramCache]: Analyzing trace with hash 697889354, now seen corresponding path program 1 times [2024-10-13 10:00:11,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:11,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538666383] [2024-10-13 10:00:11,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:11,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:11,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:11,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:11,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538666383] [2024-10-13 10:00:11,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538666383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:11,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:11,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:11,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028601791] [2024-10-13 10:00:11,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:11,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:11,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:11,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:11,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:11,489 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:11,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 438 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:11,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:11,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:11,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:12,391 INFO L124 PetriNetUnfolderBase]: 1293/3955 cut-off events. [2024-10-13 10:00:12,392 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-10-13 10:00:12,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6155 conditions, 3955 events. 1293/3955 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 31485 event pairs, 846 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 6087. Up to 1740 conditions per place. [2024-10-13 10:00:12,428 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 25 selfloop transitions, 2 changer transitions 0/437 dead transitions. [2024-10-13 10:00:12,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 437 transitions, 951 flow [2024-10-13 10:00:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:12,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:12,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:12,433 INFO L175 Difference]: Start difference. First operand has 439 places, 438 transitions, 899 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:12,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 437 transitions, 951 flow [2024-10-13 10:00:12,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 437 transitions, 949 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:12,440 INFO L231 Difference]: Finished difference. Result has 439 places, 437 transitions, 899 flow [2024-10-13 10:00:12,441 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=437, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=435, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=899, PETRI_PLACES=439, PETRI_TRANSITIONS=437} [2024-10-13 10:00:12,441 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -155 predicate places. [2024-10-13 10:00:12,441 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 437 transitions, 899 flow [2024-10-13 10:00:12,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:12,443 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:12,443 INFO L204 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] [2024-10-13 10:00:12,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:00:12,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:12,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:12,444 INFO L85 PathProgramCache]: Analyzing trace with hash 237268096, now seen corresponding path program 1 times [2024-10-13 10:00:12,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:12,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887435178] [2024-10-13 10:00:12,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:12,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:12,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:12,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887435178] [2024-10-13 10:00:12,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887435178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:12,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:12,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:12,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271601856] [2024-10-13 10:00:12,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:12,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:12,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:12,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:12,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:12,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:12,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 437 transitions, 899 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:12,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:12,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:12,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:13,239 INFO L124 PetriNetUnfolderBase]: 1293/3954 cut-off events. [2024-10-13 10:00:13,240 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2024-10-13 10:00:13,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6068 conditions, 3954 events. 1293/3954 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 31577 event pairs, 846 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 6000. Up to 1741 conditions per place. [2024-10-13 10:00:13,267 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 26 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2024-10-13 10:00:13,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 440 places, 436 transitions, 953 flow [2024-10-13 10:00:13,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:13,272 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:13,272 INFO L175 Difference]: Start difference. First operand has 439 places, 437 transitions, 899 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:13,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 440 places, 436 transitions, 953 flow [2024-10-13 10:00:13,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 436 transitions, 949 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:13,279 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 897 flow [2024-10-13 10:00:13,280 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=893, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=436, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=438, PETRI_TRANSITIONS=436} [2024-10-13 10:00:13,281 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -156 predicate places. [2024-10-13 10:00:13,282 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 897 flow [2024-10-13 10:00:13,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:13,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:13,283 INFO L204 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] [2024-10-13 10:00:13,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:00:13,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:13,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:13,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1537348846, now seen corresponding path program 1 times [2024-10-13 10:00:13,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:13,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833741554] [2024-10-13 10:00:13,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:13,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:13,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:13,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833741554] [2024-10-13 10:00:13,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833741554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:13,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:13,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:13,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446462093] [2024-10-13 10:00:13,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:13,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:13,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:13,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:13,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:13,335 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:13,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 436 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:13,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:13,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:13,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:14,053 INFO L124 PetriNetUnfolderBase]: 1293/3953 cut-off events. [2024-10-13 10:00:14,054 INFO L125 PetriNetUnfolderBase]: For 274/274 co-relation queries the response was YES. [2024-10-13 10:00:14,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6064 conditions, 3953 events. 1293/3953 cut-off events. For 274/274 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 31535 event pairs, 846 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5997. Up to 1738 conditions per place. [2024-10-13 10:00:14,084 INFO L140 encePairwiseOnDemand]: 624/626 looper letters, 24 selfloop transitions, 1 changer transitions 0/435 dead transitions. [2024-10-13 10:00:14,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 435 transitions, 945 flow [2024-10-13 10:00:14,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:14,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:14,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2024-10-13 10:00:14,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348242811501597 [2024-10-13 10:00:14,088 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 897 flow. Second operand 3 states and 1380 transitions. [2024-10-13 10:00:14,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 435 transitions, 945 flow [2024-10-13 10:00:14,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 435 transitions, 941 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:14,095 INFO L231 Difference]: Finished difference. Result has 437 places, 435 transitions, 893 flow [2024-10-13 10:00:14,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=891, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=437, PETRI_TRANSITIONS=435} [2024-10-13 10:00:14,097 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2024-10-13 10:00:14,097 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 435 transitions, 893 flow [2024-10-13 10:00:14,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:14,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:14,099 INFO L204 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] [2024-10-13 10:00:14,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:00:14,099 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:14,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:14,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1649415859, now seen corresponding path program 1 times [2024-10-13 10:00:14,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:14,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185083447] [2024-10-13 10:00:14,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:14,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:14,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:14,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185083447] [2024-10-13 10:00:14,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185083447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512540185] [2024-10-13 10:00:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:14,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:14,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:14,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:14,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:14,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 435 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:14,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:14,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:14,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:14,884 INFO L124 PetriNetUnfolderBase]: 1293/3952 cut-off events. [2024-10-13 10:00:14,884 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2024-10-13 10:00:14,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6064 conditions, 3952 events. 1293/3952 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 31483 event pairs, 846 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5996. Up to 1740 conditions per place. [2024-10-13 10:00:14,908 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 25 selfloop transitions, 2 changer transitions 0/434 dead transitions. [2024-10-13 10:00:14,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 434 transitions, 945 flow [2024-10-13 10:00:14,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:14,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:14,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:14,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:14,912 INFO L175 Difference]: Start difference. First operand has 437 places, 435 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:14,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 434 transitions, 945 flow [2024-10-13 10:00:14,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 434 transitions, 944 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:14,918 INFO L231 Difference]: Finished difference. Result has 437 places, 434 transitions, 894 flow [2024-10-13 10:00:14,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=432, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=437, PETRI_TRANSITIONS=434} [2024-10-13 10:00:14,920 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -157 predicate places. [2024-10-13 10:00:14,920 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 434 transitions, 894 flow [2024-10-13 10:00:14,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:14,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:14,921 INFO L204 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] [2024-10-13 10:00:14,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:00:14,922 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:14,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:14,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1728306121, now seen corresponding path program 1 times [2024-10-13 10:00:14,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:14,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794577022] [2024-10-13 10:00:14,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:14,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:14,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:14,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794577022] [2024-10-13 10:00:14,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794577022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:14,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:14,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202372188] [2024-10-13 10:00:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:14,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:14,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:14,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:14,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 434 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:14,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:14,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:14,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:16,052 INFO L124 PetriNetUnfolderBase]: 1293/3951 cut-off events. [2024-10-13 10:00:16,052 INFO L125 PetriNetUnfolderBase]: For 273/273 co-relation queries the response was YES. [2024-10-13 10:00:16,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6066 conditions, 3951 events. 1293/3951 cut-off events. For 273/273 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 31577 event pairs, 846 based on Foata normal form. 0/3622 useless extension candidates. Maximal degree in co-relation 5998. Up to 1741 conditions per place. [2024-10-13 10:00:16,069 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 26 selfloop transitions, 2 changer transitions 0/433 dead transitions. [2024-10-13 10:00:16,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 433 transitions, 948 flow [2024-10-13 10:00:16,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:16,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:16,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:16,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:16,073 INFO L175 Difference]: Start difference. First operand has 437 places, 434 transitions, 894 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:16,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 433 transitions, 948 flow [2024-10-13 10:00:16,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 433 transitions, 944 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:16,080 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 892 flow [2024-10-13 10:00:16,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=431, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=892, PETRI_PLACES=436, PETRI_TRANSITIONS=433} [2024-10-13 10:00:16,081 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2024-10-13 10:00:16,081 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 892 flow [2024-10-13 10:00:16,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:16,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:16,083 INFO L204 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] [2024-10-13 10:00:16,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:00:16,083 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:16,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1072601083, now seen corresponding path program 1 times [2024-10-13 10:00:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:16,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565628787] [2024-10-13 10:00:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:16,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:16,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:16,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:16,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565628787] [2024-10-13 10:00:16,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565628787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:16,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:16,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:16,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906549429] [2024-10-13 10:00:16,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:16,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:16,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:16,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:16,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:16,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:16,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 433 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:16,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:16,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:16,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:16,989 INFO L124 PetriNetUnfolderBase]: 1337/3894 cut-off events. [2024-10-13 10:00:16,989 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-10-13 10:00:17,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6107 conditions, 3894 events. 1337/3894 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 29593 event pairs, 224 based on Foata normal form. 0/3626 useless extension candidates. Maximal degree in co-relation 6040. Up to 1310 conditions per place. [2024-10-13 10:00:17,014 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 42 selfloop transitions, 2 changer transitions 0/451 dead transitions. [2024-10-13 10:00:17,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 451 transitions, 1030 flow [2024-10-13 10:00:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:17,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:17,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1397 transitions. [2024-10-13 10:00:17,017 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7438764643237487 [2024-10-13 10:00:17,017 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 892 flow. Second operand 3 states and 1397 transitions. [2024-10-13 10:00:17,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 451 transitions, 1030 flow [2024-10-13 10:00:17,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 451 transitions, 1026 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:17,025 INFO L231 Difference]: Finished difference. Result has 436 places, 433 transitions, 896 flow [2024-10-13 10:00:17,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=436, PETRI_TRANSITIONS=433} [2024-10-13 10:00:17,026 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2024-10-13 10:00:17,027 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 433 transitions, 896 flow [2024-10-13 10:00:17,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:17,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:17,029 INFO L204 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] [2024-10-13 10:00:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:00:17,029 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:17,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:17,030 INFO L85 PathProgramCache]: Analyzing trace with hash 264393896, now seen corresponding path program 1 times [2024-10-13 10:00:17,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513728410] [2024-10-13 10:00:17,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:17,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:17,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513728410] [2024-10-13 10:00:17,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513728410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:17,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:17,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:17,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866192997] [2024-10-13 10:00:17,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:17,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:17,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:17,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:17,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:17,093 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:17,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 433 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:17,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:17,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:17,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:18,084 INFO L124 PetriNetUnfolderBase]: 1337/4087 cut-off events. [2024-10-13 10:00:18,085 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-10-13 10:00:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6706 conditions, 4087 events. 1337/4087 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32806 event pairs, 890 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6637. Up to 1822 conditions per place. [2024-10-13 10:00:18,114 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 26 selfloop transitions, 2 changer transitions 0/432 dead transitions. [2024-10-13 10:00:18,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 432 transitions, 950 flow [2024-10-13 10:00:18,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:18,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:18,117 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:18,118 INFO L175 Difference]: Start difference. First operand has 436 places, 433 transitions, 896 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:18,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 432 transitions, 950 flow [2024-10-13 10:00:18,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 432 transitions, 948 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:18,127 INFO L231 Difference]: Finished difference. Result has 436 places, 432 transitions, 896 flow [2024-10-13 10:00:18,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=892, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=896, PETRI_PLACES=436, PETRI_TRANSITIONS=432} [2024-10-13 10:00:18,128 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -158 predicate places. [2024-10-13 10:00:18,128 INFO L471 AbstractCegarLoop]: Abstraction has has 436 places, 432 transitions, 896 flow [2024-10-13 10:00:18,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:18,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:18,129 INFO L204 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] [2024-10-13 10:00:18,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:00:18,129 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:18,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:18,130 INFO L85 PathProgramCache]: Analyzing trace with hash -930653472, now seen corresponding path program 1 times [2024-10-13 10:00:18,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:18,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775738988] [2024-10-13 10:00:18,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:18,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:18,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:18,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:18,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:18,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775738988] [2024-10-13 10:00:18,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775738988] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:18,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:18,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:18,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240566629] [2024-10-13 10:00:18,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:18,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:18,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:18,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:18,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:18,201 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:18,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 436 places, 432 transitions, 896 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:18,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:18,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:18,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:19,345 INFO L124 PetriNetUnfolderBase]: 1337/4086 cut-off events. [2024-10-13 10:00:19,345 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2024-10-13 10:00:19,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6574 conditions, 4086 events. 1337/4086 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32773 event pairs, 890 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6505. Up to 1823 conditions per place. [2024-10-13 10:00:19,376 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 27 selfloop transitions, 2 changer transitions 0/431 dead transitions. [2024-10-13 10:00:19,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 431 transitions, 952 flow [2024-10-13 10:00:19,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:19,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:19,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:19,379 INFO L175 Difference]: Start difference. First operand has 436 places, 432 transitions, 896 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:19,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 431 transitions, 952 flow [2024-10-13 10:00:19,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 431 transitions, 948 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:19,387 INFO L231 Difference]: Finished difference. Result has 435 places, 431 transitions, 894 flow [2024-10-13 10:00:19,388 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=435, PETRI_TRANSITIONS=431} [2024-10-13 10:00:19,389 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -159 predicate places. [2024-10-13 10:00:19,389 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 431 transitions, 894 flow [2024-10-13 10:00:19,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:19,390 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:19,390 INFO L204 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] [2024-10-13 10:00:19,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:00:19,390 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:19,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:19,391 INFO L85 PathProgramCache]: Analyzing trace with hash 865769140, now seen corresponding path program 1 times [2024-10-13 10:00:19,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:19,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98043646] [2024-10-13 10:00:19,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:19,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:19,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:19,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:19,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98043646] [2024-10-13 10:00:19,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98043646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:19,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:19,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:19,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385884501] [2024-10-13 10:00:19,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:19,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:19,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:19,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:19,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:19,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 431 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:19,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:19,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:19,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:20,276 INFO L124 PetriNetUnfolderBase]: 1337/4085 cut-off events. [2024-10-13 10:00:20,276 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-10-13 10:00:20,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 4085 events. 1337/4085 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32790 event pairs, 890 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6502. Up to 1820 conditions per place. [2024-10-13 10:00:20,301 INFO L140 encePairwiseOnDemand]: 624/626 looper letters, 25 selfloop transitions, 1 changer transitions 0/430 dead transitions. [2024-10-13 10:00:20,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 436 places, 430 transitions, 944 flow [2024-10-13 10:00:20,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:20,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:20,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2024-10-13 10:00:20,303 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348242811501597 [2024-10-13 10:00:20,303 INFO L175 Difference]: Start difference. First operand has 435 places, 431 transitions, 894 flow. Second operand 3 states and 1380 transitions. [2024-10-13 10:00:20,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 436 places, 430 transitions, 944 flow [2024-10-13 10:00:20,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 430 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:20,310 INFO L231 Difference]: Finished difference. Result has 434 places, 430 transitions, 890 flow [2024-10-13 10:00:20,310 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=430, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=890, PETRI_PLACES=434, PETRI_TRANSITIONS=430} [2024-10-13 10:00:20,311 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2024-10-13 10:00:20,311 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 430 transitions, 890 flow [2024-10-13 10:00:20,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:20,312 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:20,312 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:20,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:00:20,312 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:20,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:20,313 INFO L85 PathProgramCache]: Analyzing trace with hash -284683069, now seen corresponding path program 1 times [2024-10-13 10:00:20,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:20,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062918625] [2024-10-13 10:00:20,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:20,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:20,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:20,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:20,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062918625] [2024-10-13 10:00:20,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062918625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:20,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:20,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:20,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057909494] [2024-10-13 10:00:20,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:20,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:20,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:20,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:20,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:20,375 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:20,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 430 transitions, 890 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:20,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:20,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:20,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:21,128 INFO L124 PetriNetUnfolderBase]: 1337/4084 cut-off events. [2024-10-13 10:00:21,128 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2024-10-13 10:00:21,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6570 conditions, 4084 events. 1337/4084 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32785 event pairs, 890 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6501. Up to 1822 conditions per place. [2024-10-13 10:00:21,157 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 26 selfloop transitions, 2 changer transitions 0/429 dead transitions. [2024-10-13 10:00:21,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 429 transitions, 944 flow [2024-10-13 10:00:21,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:21,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:21,160 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:21,160 INFO L175 Difference]: Start difference. First operand has 434 places, 430 transitions, 890 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:21,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 429 transitions, 944 flow [2024-10-13 10:00:21,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 434 places, 429 transitions, 943 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:21,168 INFO L231 Difference]: Finished difference. Result has 434 places, 429 transitions, 891 flow [2024-10-13 10:00:21,169 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=434, PETRI_TRANSITIONS=429} [2024-10-13 10:00:21,169 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -160 predicate places. [2024-10-13 10:00:21,169 INFO L471 AbstractCegarLoop]: Abstraction has has 434 places, 429 transitions, 891 flow [2024-10-13 10:00:21,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:21,170 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:21,170 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:21,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:00:21,171 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:21,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1897152617, now seen corresponding path program 1 times [2024-10-13 10:00:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:21,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570141278] [2024-10-13 10:00:21,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:21,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:21,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:21,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:21,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570141278] [2024-10-13 10:00:21,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570141278] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:21,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:21,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:21,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644089164] [2024-10-13 10:00:21,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:21,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:21,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:21,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:21,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:21,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:21,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 434 places, 429 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:21,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:21,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:21,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:22,085 INFO L124 PetriNetUnfolderBase]: 1337/4083 cut-off events. [2024-10-13 10:00:22,085 INFO L125 PetriNetUnfolderBase]: For 564/564 co-relation queries the response was YES. [2024-10-13 10:00:22,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6572 conditions, 4083 events. 1337/4083 cut-off events. For 564/564 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 32806 event pairs, 890 based on Foata normal form. 0/3754 useless extension candidates. Maximal degree in co-relation 6503. Up to 1823 conditions per place. [2024-10-13 10:00:22,113 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 27 selfloop transitions, 2 changer transitions 0/428 dead transitions. [2024-10-13 10:00:22,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 428 transitions, 947 flow [2024-10-13 10:00:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:22,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:22,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:22,116 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:22,116 INFO L175 Difference]: Start difference. First operand has 434 places, 429 transitions, 891 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:22,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 428 transitions, 947 flow [2024-10-13 10:00:22,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 428 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:22,121 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 889 flow [2024-10-13 10:00:22,122 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=428, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=889, PETRI_PLACES=433, PETRI_TRANSITIONS=428} [2024-10-13 10:00:22,122 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2024-10-13 10:00:22,122 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 889 flow [2024-10-13 10:00:22,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:22,123 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:22,123 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:22,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:00:22,123 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:22,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:22,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1287124110, now seen corresponding path program 1 times [2024-10-13 10:00:22,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:22,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52404394] [2024-10-13 10:00:22,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:22,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:22,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:22,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:22,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52404394] [2024-10-13 10:00:22,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52404394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:22,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:22,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:22,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656684728] [2024-10-13 10:00:22,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:22,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:22,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:22,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:22,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:22,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 428 transitions, 889 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:22,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:22,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:22,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:22,951 INFO L124 PetriNetUnfolderBase]: 1343/4011 cut-off events. [2024-10-13 10:00:22,952 INFO L125 PetriNetUnfolderBase]: For 677/677 co-relation queries the response was YES. [2024-10-13 10:00:22,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6542 conditions, 4011 events. 1343/4011 cut-off events. For 677/677 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 30645 event pairs, 236 based on Foata normal form. 0/3746 useless extension candidates. Maximal degree in co-relation 6474. Up to 1315 conditions per place. [2024-10-13 10:00:22,979 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 43 selfloop transitions, 2 changer transitions 0/446 dead transitions. [2024-10-13 10:00:22,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 446 transitions, 1032 flow [2024-10-13 10:00:22,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:22,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1396 transitions. [2024-10-13 10:00:22,982 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7433439829605963 [2024-10-13 10:00:22,982 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 889 flow. Second operand 3 states and 1396 transitions. [2024-10-13 10:00:22,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 446 transitions, 1032 flow [2024-10-13 10:00:22,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 446 transitions, 1028 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:22,989 INFO L231 Difference]: Finished difference. Result has 433 places, 428 transitions, 893 flow [2024-10-13 10:00:22,989 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=433, PETRI_TRANSITIONS=428} [2024-10-13 10:00:22,990 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2024-10-13 10:00:22,990 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 428 transitions, 893 flow [2024-10-13 10:00:22,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:22,991 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:22,991 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:22,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:00:22,991 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:22,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:22,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1998603806, now seen corresponding path program 1 times [2024-10-13 10:00:22,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:22,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759128214] [2024-10-13 10:00:22,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:22,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:23,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759128214] [2024-10-13 10:00:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759128214] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987548746] [2024-10-13 10:00:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:23,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:23,079 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:23,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 428 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:23,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:23,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:23,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:23,812 INFO L124 PetriNetUnfolderBase]: 1343/4145 cut-off events. [2024-10-13 10:00:23,813 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2024-10-13 10:00:23,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7113 conditions, 4145 events. 1343/4145 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 33485 event pairs, 908 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 7043. Up to 1854 conditions per place. [2024-10-13 10:00:23,840 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 27 selfloop transitions, 2 changer transitions 0/427 dead transitions. [2024-10-13 10:00:23,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 427 transitions, 949 flow [2024-10-13 10:00:23,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:23,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:23,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:23,842 INFO L175 Difference]: Start difference. First operand has 433 places, 428 transitions, 893 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:23,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 427 transitions, 949 flow [2024-10-13 10:00:23,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 427 transitions, 947 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:23,850 INFO L231 Difference]: Finished difference. Result has 433 places, 427 transitions, 893 flow [2024-10-13 10:00:23,851 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=427, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=893, PETRI_PLACES=433, PETRI_TRANSITIONS=427} [2024-10-13 10:00:23,851 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -161 predicate places. [2024-10-13 10:00:23,852 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 427 transitions, 893 flow [2024-10-13 10:00:23,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:23,858 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:23,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:23,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 10:00:23,859 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1553367504, now seen corresponding path program 1 times [2024-10-13 10:00:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:23,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007728638] [2024-10-13 10:00:23,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:23,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:23,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:23,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:23,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007728638] [2024-10-13 10:00:23,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007728638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:23,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:23,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:23,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625955806] [2024-10-13 10:00:23,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:23,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:23,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:23,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:23,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:23,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 448 out of 626 [2024-10-13 10:00:23,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 427 transitions, 893 flow. Second operand has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:23,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:23,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 448 of 626 [2024-10-13 10:00:23,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:24,728 INFO L124 PetriNetUnfolderBase]: 1343/4144 cut-off events. [2024-10-13 10:00:24,729 INFO L125 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2024-10-13 10:00:24,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6970 conditions, 4144 events. 1343/4144 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 33523 event pairs, 908 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 6900. Up to 1855 conditions per place. [2024-10-13 10:00:24,745 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 28 selfloop transitions, 2 changer transitions 0/426 dead transitions. [2024-10-13 10:00:24,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 434 places, 426 transitions, 951 flow [2024-10-13 10:00:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:24,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:24,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1371 transitions. [2024-10-13 10:00:24,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7300319488817891 [2024-10-13 10:00:24,748 INFO L175 Difference]: Start difference. First operand has 433 places, 427 transitions, 893 flow. Second operand 3 states and 1371 transitions. [2024-10-13 10:00:24,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 434 places, 426 transitions, 951 flow [2024-10-13 10:00:24,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 432 places, 426 transitions, 947 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:24,755 INFO L231 Difference]: Finished difference. Result has 432 places, 426 transitions, 891 flow [2024-10-13 10:00:24,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=887, PETRI_DIFFERENCE_MINUEND_PLACES=430, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=891, PETRI_PLACES=432, PETRI_TRANSITIONS=426} [2024-10-13 10:00:24,756 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -162 predicate places. [2024-10-13 10:00:24,756 INFO L471 AbstractCegarLoop]: Abstraction has has 432 places, 426 transitions, 891 flow [2024-10-13 10:00:24,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 449.3333333333333) internal successors, (1348), 3 states have internal predecessors, (1348), 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) [2024-10-13 10:00:24,757 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:24,757 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:24,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:00:24,757 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:24,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:24,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1299013392, now seen corresponding path program 1 times [2024-10-13 10:00:24,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:24,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479642297] [2024-10-13 10:00:24,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:24,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:24,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479642297] [2024-10-13 10:00:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479642297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:24,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:24,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513161341] [2024-10-13 10:00:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:24,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:24,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:24,831 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:24,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 432 places, 426 transitions, 891 flow. Second operand has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:24,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:24,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:24,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:25,588 INFO L124 PetriNetUnfolderBase]: 1343/4143 cut-off events. [2024-10-13 10:00:25,588 INFO L125 PetriNetUnfolderBase]: For 866/866 co-relation queries the response was YES. [2024-10-13 10:00:25,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6966 conditions, 4143 events. 1343/4143 cut-off events. For 866/866 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 33478 event pairs, 908 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 6897. Up to 1852 conditions per place. [2024-10-13 10:00:25,615 INFO L140 encePairwiseOnDemand]: 624/626 looper letters, 26 selfloop transitions, 1 changer transitions 0/425 dead transitions. [2024-10-13 10:00:25,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 425 transitions, 943 flow [2024-10-13 10:00:25,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:25,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:25,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1380 transitions. [2024-10-13 10:00:25,618 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7348242811501597 [2024-10-13 10:00:25,618 INFO L175 Difference]: Start difference. First operand has 432 places, 426 transitions, 891 flow. Second operand 3 states and 1380 transitions. [2024-10-13 10:00:25,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 425 transitions, 943 flow [2024-10-13 10:00:25,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 425 transitions, 939 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:25,626 INFO L231 Difference]: Finished difference. Result has 431 places, 425 transitions, 887 flow [2024-10-13 10:00:25,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=885, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=887, PETRI_PLACES=431, PETRI_TRANSITIONS=425} [2024-10-13 10:00:25,627 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2024-10-13 10:00:25,627 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 425 transitions, 887 flow [2024-10-13 10:00:25,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 453.0) internal successors, (1359), 3 states have internal predecessors, (1359), 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) [2024-10-13 10:00:25,628 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:25,628 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:25,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:00:25,628 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:25,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:25,629 INFO L85 PathProgramCache]: Analyzing trace with hash -486956249, now seen corresponding path program 1 times [2024-10-13 10:00:25,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:25,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390608530] [2024-10-13 10:00:25,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:25,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:25,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390608530] [2024-10-13 10:00:25,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390608530] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:25,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:25,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:25,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507204835] [2024-10-13 10:00:25,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:25,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:25,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:25,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:25,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:25,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:25,729 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 425 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:25,729 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:25,729 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:25,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:26,538 INFO L124 PetriNetUnfolderBase]: 1343/4142 cut-off events. [2024-10-13 10:00:26,539 INFO L125 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2024-10-13 10:00:26,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6966 conditions, 4142 events. 1343/4142 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 33474 event pairs, 908 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 6896. Up to 1854 conditions per place. [2024-10-13 10:00:26,568 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 27 selfloop transitions, 2 changer transitions 0/424 dead transitions. [2024-10-13 10:00:26,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 424 transitions, 943 flow [2024-10-13 10:00:26,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:26,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:26,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:26,570 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:26,570 INFO L175 Difference]: Start difference. First operand has 431 places, 425 transitions, 887 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:26,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 424 transitions, 943 flow [2024-10-13 10:00:26,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 431 places, 424 transitions, 942 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:26,576 INFO L231 Difference]: Finished difference. Result has 431 places, 424 transitions, 888 flow [2024-10-13 10:00:26,576 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=429, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=424, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=422, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=888, PETRI_PLACES=431, PETRI_TRANSITIONS=424} [2024-10-13 10:00:26,577 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -163 predicate places. [2024-10-13 10:00:26,577 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 424 transitions, 888 flow [2024-10-13 10:00:26,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:26,577 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:26,578 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:26,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 10:00:26,578 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:26,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:26,578 INFO L85 PathProgramCache]: Analyzing trace with hash -2095390038, now seen corresponding path program 1 times [2024-10-13 10:00:26,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:26,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225585590] [2024-10-13 10:00:26,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:26,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:26,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:26,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:26,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225585590] [2024-10-13 10:00:26,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225585590] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:26,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:26,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:26,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271672376] [2024-10-13 10:00:26,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:26,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:26,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:26,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:26,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:26,651 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:26,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 424 transitions, 888 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:26,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:26,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:26,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:27,456 INFO L124 PetriNetUnfolderBase]: 1343/4141 cut-off events. [2024-10-13 10:00:27,456 INFO L125 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2024-10-13 10:00:27,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6967 conditions, 4141 events. 1343/4141 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 33523 event pairs, 908 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 6897. Up to 1854 conditions per place. [2024-10-13 10:00:27,479 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 27 selfloop transitions, 2 changer transitions 0/423 dead transitions. [2024-10-13 10:00:27,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 423 transitions, 944 flow [2024-10-13 10:00:27,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:27,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:27,481 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:27,482 INFO L175 Difference]: Start difference. First operand has 431 places, 424 transitions, 888 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:27,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 423 transitions, 944 flow [2024-10-13 10:00:27,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 423 transitions, 940 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:27,487 INFO L231 Difference]: Finished difference. Result has 430 places, 423 transitions, 886 flow [2024-10-13 10:00:27,488 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=428, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=430, PETRI_TRANSITIONS=423} [2024-10-13 10:00:27,488 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -164 predicate places. [2024-10-13 10:00:27,488 INFO L471 AbstractCegarLoop]: Abstraction has has 430 places, 423 transitions, 886 flow [2024-10-13 10:00:27,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:27,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:27,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:27,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 10:00:27,489 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:27,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:27,489 INFO L85 PathProgramCache]: Analyzing trace with hash 690659806, now seen corresponding path program 1 times [2024-10-13 10:00:27,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:27,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474359246] [2024-10-13 10:00:27,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:27,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:27,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474359246] [2024-10-13 10:00:27,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474359246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:27,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:27,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649129908] [2024-10-13 10:00:27,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:27,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:27,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:27,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:27,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:27,563 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 449 out of 626 [2024-10-13 10:00:27,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 430 places, 423 transitions, 886 flow. Second operand has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:27,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:27,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 449 of 626 [2024-10-13 10:00:27,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:28,328 INFO L124 PetriNetUnfolderBase]: 1343/4140 cut-off events. [2024-10-13 10:00:28,328 INFO L125 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2024-10-13 10:00:28,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6966 conditions, 4140 events. 1343/4140 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 33445 event pairs, 908 based on Foata normal form. 0/3816 useless extension candidates. Maximal degree in co-relation 6896. Up to 1854 conditions per place. [2024-10-13 10:00:28,356 INFO L140 encePairwiseOnDemand]: 623/626 looper letters, 27 selfloop transitions, 2 changer transitions 0/422 dead transitions. [2024-10-13 10:00:28,356 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 431 places, 422 transitions, 942 flow [2024-10-13 10:00:28,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:28,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1373 transitions. [2024-10-13 10:00:28,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7310969116080938 [2024-10-13 10:00:28,358 INFO L175 Difference]: Start difference. First operand has 430 places, 423 transitions, 886 flow. Second operand 3 states and 1373 transitions. [2024-10-13 10:00:28,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 431 places, 422 transitions, 942 flow [2024-10-13 10:00:28,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 429 places, 422 transitions, 938 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:28,364 INFO L231 Difference]: Finished difference. Result has 429 places, 422 transitions, 884 flow [2024-10-13 10:00:28,364 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=429, PETRI_TRANSITIONS=422} [2024-10-13 10:00:28,365 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -165 predicate places. [2024-10-13 10:00:28,365 INFO L471 AbstractCegarLoop]: Abstraction has has 429 places, 422 transitions, 884 flow [2024-10-13 10:00:28,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 450.3333333333333) internal successors, (1351), 3 states have internal predecessors, (1351), 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) [2024-10-13 10:00:28,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:28,366 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:28,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 10:00:28,366 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 296 more)] === [2024-10-13 10:00:28,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:28,366 INFO L85 PathProgramCache]: Analyzing trace with hash -698032818, now seen corresponding path program 1 times [2024-10-13 10:00:28,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:28,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125204950] [2024-10-13 10:00:28,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:28,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:28,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:28,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:28,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125204950] [2024-10-13 10:00:28,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125204950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:28,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:28,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:28,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849052063] [2024-10-13 10:00:28,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:28,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:28,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:28,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:28,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:28,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 452 out of 626 [2024-10-13 10:00:28,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 429 places, 422 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 455.6666666666667) internal successors, (1367), 3 states have internal predecessors, (1367), 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) [2024-10-13 10:00:28,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:28,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 452 of 626 [2024-10-13 10:00:28,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:29,329 INFO L124 PetriNetUnfolderBase]: 1343/4124 cut-off events. [2024-10-13 10:00:29,330 INFO L125 PetriNetUnfolderBase]: For 865/865 co-relation queries the response was YES. [2024-10-13 10:00:29,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6962 conditions, 4124 events. 1343/4124 cut-off events. For 865/865 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 33356 event pairs, 908 based on Foata normal form. 16/3816 useless extension candidates. Maximal degree in co-relation 6892. Up to 1852 conditions per place. [2024-10-13 10:00:29,347 INFO L140 encePairwiseOnDemand]: 624/626 looper letters, 0 selfloop transitions, 0 changer transitions 421/421 dead transitions. [2024-10-13 10:00:29,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 421 transitions, 934 flow [2024-10-13 10:00:29,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:29,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:29,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1379 transitions. [2024-10-13 10:00:29,349 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7342917997870074 [2024-10-13 10:00:29,349 INFO L175 Difference]: Start difference. First operand has 429 places, 422 transitions, 884 flow. Second operand 3 states and 1379 transitions. [2024-10-13 10:00:29,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 421 transitions, 934 flow [2024-10-13 10:00:29,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 421 transitions, 930 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:29,354 INFO L231 Difference]: Finished difference. Result has 428 places, 0 transitions, 0 flow [2024-10-13 10:00:29,354 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=626, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=426, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=421, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=428, PETRI_TRANSITIONS=0} [2024-10-13 10:00:29,355 INFO L277 CegarLoopForPetriNet]: 594 programPoint places, -166 predicate places. [2024-10-13 10:00:29,355 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 0 transitions, 0 flow [2024-10-13 10:00:29,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 455.6666666666667) internal successors, (1367), 3 states have internal predecessors, (1367), 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) [2024-10-13 10:00:29,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (299 of 300 remaining) [2024-10-13 10:00:29,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (298 of 300 remaining) [2024-10-13 10:00:29,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (297 of 300 remaining) [2024-10-13 10:00:29,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (296 of 300 remaining) [2024-10-13 10:00:29,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (295 of 300 remaining) [2024-10-13 10:00:29,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (294 of 300 remaining) [2024-10-13 10:00:29,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (293 of 300 remaining) [2024-10-13 10:00:29,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (292 of 300 remaining) [2024-10-13 10:00:29,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (291 of 300 remaining) [2024-10-13 10:00:29,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (290 of 300 remaining) [2024-10-13 10:00:29,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (289 of 300 remaining) [2024-10-13 10:00:29,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (288 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (287 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (286 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (285 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (284 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (283 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (282 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (281 of 300 remaining) [2024-10-13 10:00:29,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (280 of 300 remaining) [2024-10-13 10:00:29,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (279 of 300 remaining) [2024-10-13 10:00:29,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (278 of 300 remaining) [2024-10-13 10:00:29,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (277 of 300 remaining) [2024-10-13 10:00:29,362 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (276 of 300 remaining) [2024-10-13 10:00:29,363 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (275 of 300 remaining) [2024-10-13 10:00:29,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (274 of 300 remaining) [2024-10-13 10:00:29,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (273 of 300 remaining) [2024-10-13 10:00:29,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (272 of 300 remaining) [2024-10-13 10:00:29,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (271 of 300 remaining) [2024-10-13 10:00:29,364 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (270 of 300 remaining) [2024-10-13 10:00:29,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (269 of 300 remaining) [2024-10-13 10:00:29,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (268 of 300 remaining) [2024-10-13 10:00:29,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (267 of 300 remaining) [2024-10-13 10:00:29,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (266 of 300 remaining) [2024-10-13 10:00:29,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (265 of 300 remaining) [2024-10-13 10:00:29,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (264 of 300 remaining) [2024-10-13 10:00:29,365 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (263 of 300 remaining) [2024-10-13 10:00:29,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (262 of 300 remaining) [2024-10-13 10:00:29,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (261 of 300 remaining) [2024-10-13 10:00:29,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (260 of 300 remaining) [2024-10-13 10:00:29,366 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (259 of 300 remaining) [2024-10-13 10:00:29,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (258 of 300 remaining) [2024-10-13 10:00:29,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (257 of 300 remaining) [2024-10-13 10:00:29,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (256 of 300 remaining) [2024-10-13 10:00:29,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (255 of 300 remaining) [2024-10-13 10:00:29,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (254 of 300 remaining) [2024-10-13 10:00:29,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (253 of 300 remaining) [2024-10-13 10:00:29,367 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (252 of 300 remaining) [2024-10-13 10:00:29,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (251 of 300 remaining) [2024-10-13 10:00:29,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (250 of 300 remaining) [2024-10-13 10:00:29,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (249 of 300 remaining) [2024-10-13 10:00:29,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (248 of 300 remaining) [2024-10-13 10:00:29,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (247 of 300 remaining) [2024-10-13 10:00:29,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (246 of 300 remaining) [2024-10-13 10:00:29,368 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (245 of 300 remaining) [2024-10-13 10:00:29,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (244 of 300 remaining) [2024-10-13 10:00:29,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (243 of 300 remaining) [2024-10-13 10:00:29,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (242 of 300 remaining) [2024-10-13 10:00:29,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (241 of 300 remaining) [2024-10-13 10:00:29,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (240 of 300 remaining) [2024-10-13 10:00:29,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (239 of 300 remaining) [2024-10-13 10:00:29,369 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (238 of 300 remaining) [2024-10-13 10:00:29,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (237 of 300 remaining) [2024-10-13 10:00:29,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (236 of 300 remaining) [2024-10-13 10:00:29,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (235 of 300 remaining) [2024-10-13 10:00:29,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (234 of 300 remaining) [2024-10-13 10:00:29,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (233 of 300 remaining) [2024-10-13 10:00:29,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (232 of 300 remaining) [2024-10-13 10:00:29,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (231 of 300 remaining) [2024-10-13 10:00:29,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (230 of 300 remaining) [2024-10-13 10:00:29,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (229 of 300 remaining) [2024-10-13 10:00:29,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (228 of 300 remaining) [2024-10-13 10:00:29,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (227 of 300 remaining) [2024-10-13 10:00:29,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (226 of 300 remaining) [2024-10-13 10:00:29,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (225 of 300 remaining) [2024-10-13 10:00:29,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (224 of 300 remaining) [2024-10-13 10:00:29,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (223 of 300 remaining) [2024-10-13 10:00:29,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (222 of 300 remaining) [2024-10-13 10:00:29,372 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (221 of 300 remaining) [2024-10-13 10:00:29,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (220 of 300 remaining) [2024-10-13 10:00:29,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (219 of 300 remaining) [2024-10-13 10:00:29,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (218 of 300 remaining) [2024-10-13 10:00:29,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (217 of 300 remaining) [2024-10-13 10:00:29,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (216 of 300 remaining) [2024-10-13 10:00:29,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (215 of 300 remaining) [2024-10-13 10:00:29,373 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (214 of 300 remaining) [2024-10-13 10:00:29,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (213 of 300 remaining) [2024-10-13 10:00:29,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (212 of 300 remaining) [2024-10-13 10:00:29,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (211 of 300 remaining) [2024-10-13 10:00:29,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (210 of 300 remaining) [2024-10-13 10:00:29,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (209 of 300 remaining) [2024-10-13 10:00:29,374 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (208 of 300 remaining) [2024-10-13 10:00:29,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (207 of 300 remaining) [2024-10-13 10:00:29,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (206 of 300 remaining) [2024-10-13 10:00:29,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (205 of 300 remaining) [2024-10-13 10:00:29,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (204 of 300 remaining) [2024-10-13 10:00:29,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (203 of 300 remaining) [2024-10-13 10:00:29,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (202 of 300 remaining) [2024-10-13 10:00:29,375 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (201 of 300 remaining) [2024-10-13 10:00:29,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (200 of 300 remaining) [2024-10-13 10:00:29,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (199 of 300 remaining) [2024-10-13 10:00:29,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (198 of 300 remaining) [2024-10-13 10:00:29,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (197 of 300 remaining) [2024-10-13 10:00:29,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (196 of 300 remaining) [2024-10-13 10:00:29,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (195 of 300 remaining) [2024-10-13 10:00:29,376 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (194 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (193 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (192 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (191 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (190 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (189 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (188 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (187 of 300 remaining) [2024-10-13 10:00:29,377 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (186 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (185 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (184 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (183 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (182 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (181 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (180 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (179 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (178 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (177 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (176 of 300 remaining) [2024-10-13 10:00:29,378 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (175 of 300 remaining) [2024-10-13 10:00:29,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (174 of 300 remaining) [2024-10-13 10:00:29,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (173 of 300 remaining) [2024-10-13 10:00:29,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (172 of 300 remaining) [2024-10-13 10:00:29,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (171 of 300 remaining) [2024-10-13 10:00:29,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (170 of 300 remaining) [2024-10-13 10:00:29,379 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (169 of 300 remaining) [2024-10-13 10:00:29,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (168 of 300 remaining) [2024-10-13 10:00:29,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (167 of 300 remaining) [2024-10-13 10:00:29,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (166 of 300 remaining) [2024-10-13 10:00:29,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (165 of 300 remaining) [2024-10-13 10:00:29,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (164 of 300 remaining) [2024-10-13 10:00:29,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (163 of 300 remaining) [2024-10-13 10:00:29,380 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE (162 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE (161 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE (160 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE (159 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE (158 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (157 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (156 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (155 of 300 remaining) [2024-10-13 10:00:29,381 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (154 of 300 remaining) [2024-10-13 10:00:29,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (153 of 300 remaining) [2024-10-13 10:00:29,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (152 of 300 remaining) [2024-10-13 10:00:29,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (151 of 300 remaining) [2024-10-13 10:00:29,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (150 of 300 remaining) [2024-10-13 10:00:29,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (149 of 300 remaining) [2024-10-13 10:00:29,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (148 of 300 remaining) [2024-10-13 10:00:29,382 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (147 of 300 remaining) [2024-10-13 10:00:29,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (146 of 300 remaining) [2024-10-13 10:00:29,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (145 of 300 remaining) [2024-10-13 10:00:29,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (144 of 300 remaining) [2024-10-13 10:00:29,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (143 of 300 remaining) [2024-10-13 10:00:29,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (142 of 300 remaining) [2024-10-13 10:00:29,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (141 of 300 remaining) [2024-10-13 10:00:29,383 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (140 of 300 remaining) [2024-10-13 10:00:29,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (139 of 300 remaining) [2024-10-13 10:00:29,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (138 of 300 remaining) [2024-10-13 10:00:29,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (137 of 300 remaining) [2024-10-13 10:00:29,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (136 of 300 remaining) [2024-10-13 10:00:29,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (135 of 300 remaining) [2024-10-13 10:00:29,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (134 of 300 remaining) [2024-10-13 10:00:29,384 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (133 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (132 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (131 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (130 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (129 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (128 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (127 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (126 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (125 of 300 remaining) [2024-10-13 10:00:29,385 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (123 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (122 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (121 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (120 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (119 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (118 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (117 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (116 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (115 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (114 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (113 of 300 remaining) [2024-10-13 10:00:29,386 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (112 of 300 remaining) [2024-10-13 10:00:29,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (111 of 300 remaining) [2024-10-13 10:00:29,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (110 of 300 remaining) [2024-10-13 10:00:29,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (109 of 300 remaining) [2024-10-13 10:00:29,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (108 of 300 remaining) [2024-10-13 10:00:29,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err24ASSERT_VIOLATIONDATA_RACE (107 of 300 remaining) [2024-10-13 10:00:29,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err25ASSERT_VIOLATIONDATA_RACE (106 of 300 remaining) [2024-10-13 10:00:29,387 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err26ASSERT_VIOLATIONDATA_RACE (105 of 300 remaining) [2024-10-13 10:00:29,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err27ASSERT_VIOLATIONDATA_RACE (104 of 300 remaining) [2024-10-13 10:00:29,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err28ASSERT_VIOLATIONDATA_RACE (103 of 300 remaining) [2024-10-13 10:00:29,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err29ASSERT_VIOLATIONDATA_RACE (102 of 300 remaining) [2024-10-13 10:00:29,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err30ASSERT_VIOLATIONDATA_RACE (101 of 300 remaining) [2024-10-13 10:00:29,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err31ASSERT_VIOLATIONDATA_RACE (100 of 300 remaining) [2024-10-13 10:00:29,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err32ASSERT_VIOLATIONDATA_RACE (99 of 300 remaining) [2024-10-13 10:00:29,388 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err33ASSERT_VIOLATIONDATA_RACE (98 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err34ASSERT_VIOLATIONDATA_RACE (97 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err35ASSERT_VIOLATIONDATA_RACE (96 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err36ASSERT_VIOLATIONDATA_RACE (95 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err37ASSERT_VIOLATIONDATA_RACE (94 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err38ASSERT_VIOLATIONDATA_RACE (93 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err39ASSERT_VIOLATIONDATA_RACE (92 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err40ASSERT_VIOLATIONDATA_RACE (91 of 300 remaining) [2024-10-13 10:00:29,389 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err41ASSERT_VIOLATIONDATA_RACE (90 of 300 remaining) [2024-10-13 10:00:29,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err42ASSERT_VIOLATIONDATA_RACE (89 of 300 remaining) [2024-10-13 10:00:29,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err43ASSERT_VIOLATIONDATA_RACE (88 of 300 remaining) [2024-10-13 10:00:29,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err44ASSERT_VIOLATIONDATA_RACE (87 of 300 remaining) [2024-10-13 10:00:29,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err45ASSERT_VIOLATIONDATA_RACE (86 of 300 remaining) [2024-10-13 10:00:29,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err46ASSERT_VIOLATIONDATA_RACE (85 of 300 remaining) [2024-10-13 10:00:29,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err47ASSERT_VIOLATIONDATA_RACE (84 of 300 remaining) [2024-10-13 10:00:29,390 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err48ASSERT_VIOLATIONDATA_RACE (83 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err49ASSERT_VIOLATIONDATA_RACE (82 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err50ASSERT_VIOLATIONDATA_RACE (81 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err51ASSERT_VIOLATIONDATA_RACE (80 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err52ASSERT_VIOLATIONDATA_RACE (79 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err53ASSERT_VIOLATIONDATA_RACE (78 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err54ASSERT_VIOLATIONDATA_RACE (77 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err55ASSERT_VIOLATIONDATA_RACE (76 of 300 remaining) [2024-10-13 10:00:29,391 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err56ASSERT_VIOLATIONDATA_RACE (75 of 300 remaining) [2024-10-13 10:00:29,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err57ASSERT_VIOLATIONDATA_RACE (74 of 300 remaining) [2024-10-13 10:00:29,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err58ASSERT_VIOLATIONDATA_RACE (73 of 300 remaining) [2024-10-13 10:00:29,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err59ASSERT_VIOLATIONDATA_RACE (72 of 300 remaining) [2024-10-13 10:00:29,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err60ASSERT_VIOLATIONDATA_RACE (71 of 300 remaining) [2024-10-13 10:00:29,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err61ASSERT_VIOLATIONDATA_RACE (70 of 300 remaining) [2024-10-13 10:00:29,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err62ASSERT_VIOLATIONDATA_RACE (69 of 300 remaining) [2024-10-13 10:00:29,392 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err63ASSERT_VIOLATIONDATA_RACE (68 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err64ASSERT_VIOLATIONDATA_RACE (67 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err65ASSERT_VIOLATIONDATA_RACE (66 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (65 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (64 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (63 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (62 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 300 remaining) [2024-10-13 10:00:29,393 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (59 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (58 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (57 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (56 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (55 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (54 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (53 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (52 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (51 of 300 remaining) [2024-10-13 10:00:29,394 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (50 of 300 remaining) [2024-10-13 10:00:29,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (49 of 300 remaining) [2024-10-13 10:00:29,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (48 of 300 remaining) [2024-10-13 10:00:29,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (47 of 300 remaining) [2024-10-13 10:00:29,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (46 of 300 remaining) [2024-10-13 10:00:29,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (45 of 300 remaining) [2024-10-13 10:00:29,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (44 of 300 remaining) [2024-10-13 10:00:29,395 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (43 of 300 remaining) [2024-10-13 10:00:29,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (42 of 300 remaining) [2024-10-13 10:00:29,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (41 of 300 remaining) [2024-10-13 10:00:29,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (40 of 300 remaining) [2024-10-13 10:00:29,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (39 of 300 remaining) [2024-10-13 10:00:29,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (38 of 300 remaining) [2024-10-13 10:00:29,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (37 of 300 remaining) [2024-10-13 10:00:29,396 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (36 of 300 remaining) [2024-10-13 10:00:29,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (35 of 300 remaining) [2024-10-13 10:00:29,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (34 of 300 remaining) [2024-10-13 10:00:29,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (33 of 300 remaining) [2024-10-13 10:00:29,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (32 of 300 remaining) [2024-10-13 10:00:29,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (31 of 300 remaining) [2024-10-13 10:00:29,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (30 of 300 remaining) [2024-10-13 10:00:29,397 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (29 of 300 remaining) [2024-10-13 10:00:29,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (28 of 300 remaining) [2024-10-13 10:00:29,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (27 of 300 remaining) [2024-10-13 10:00:29,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (26 of 300 remaining) [2024-10-13 10:00:29,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (25 of 300 remaining) [2024-10-13 10:00:29,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (24 of 300 remaining) [2024-10-13 10:00:29,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONDATA_RACE (23 of 300 remaining) [2024-10-13 10:00:29,398 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONDATA_RACE (22 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (21 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (20 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (19 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (18 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (17 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (16 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (15 of 300 remaining) [2024-10-13 10:00:29,399 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (14 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (13 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (12 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (11 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (10 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (9 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (8 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (7 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (6 of 300 remaining) [2024-10-13 10:00:29,400 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (5 of 300 remaining) [2024-10-13 10:00:29,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (4 of 300 remaining) [2024-10-13 10:00:29,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (3 of 300 remaining) [2024-10-13 10:00:29,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (2 of 300 remaining) [2024-10-13 10:00:29,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err20ASSERT_VIOLATIONDATA_RACE (1 of 300 remaining) [2024-10-13 10:00:29,401 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err21ASSERT_VIOLATIONDATA_RACE (0 of 300 remaining) [2024-10-13 10:00:29,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 10:00:29,402 INFO L407 BasicCegarLoop]: Path program 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] [2024-10-13 10:00:29,412 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-13 10:00:29,412 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 10:00:29,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:00:29 BasicIcfg [2024-10-13 10:00:29,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 10:00:29,420 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 10:00:29,420 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 10:00:29,421 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 10:00:29,421 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:59:59" (3/4) ... [2024-10-13 10:00:29,423 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-13 10:00:29,425 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-13 10:00:29,426 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-13 10:00:29,426 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-10-13 10:00:29,426 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-10-13 10:00:29,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2024-10-13 10:00:29,442 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-13 10:00:29,443 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-13 10:00:29,443 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-13 10:00:29,563 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-13 10:00:29,566 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-13 10:00:29,566 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 10:00:29,566 INFO L158 Benchmark]: Toolchain (without parser) took 33834.04ms. Allocated memory was 167.8MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 93.2MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2024-10-13 10:00:29,567 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 167.8MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 10:00:29,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.61ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 93.1MB in the beginning and 184.9MB in the end (delta: -91.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. [2024-10-13 10:00:29,567 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.77ms. Allocated memory is still 218.1MB. Free memory was 184.9MB in the beginning and 178.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 10:00:29,567 INFO L158 Benchmark]: Boogie Preprocessor took 112.60ms. Allocated memory is still 218.1MB. Free memory was 178.6MB in the beginning and 173.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 10:00:29,567 INFO L158 Benchmark]: RCFGBuilder took 2728.10ms. Allocated memory is still 218.1MB. Free memory was 173.4MB in the beginning and 106.9MB in the end (delta: 66.4MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. [2024-10-13 10:00:29,568 INFO L158 Benchmark]: TraceAbstraction took 30322.95ms. Allocated memory was 218.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 106.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2024-10-13 10:00:29,568 INFO L158 Benchmark]: Witness Printer took 145.53ms. Allocated memory is still 3.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 10:00:29,570 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.25ms. Allocated memory is still 167.8MB. Free memory is still 119.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.61ms. Allocated memory was 167.8MB in the beginning and 218.1MB in the end (delta: 50.3MB). Free memory was 93.1MB in the beginning and 184.9MB in the end (delta: -91.8MB). Peak memory consumption was 16.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.77ms. Allocated memory is still 218.1MB. Free memory was 184.9MB in the beginning and 178.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 112.60ms. Allocated memory is still 218.1MB. Free memory was 178.6MB in the beginning and 173.4MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2728.10ms. Allocated memory is still 218.1MB. Free memory was 173.4MB in the beginning and 106.9MB in the end (delta: 66.4MB). Peak memory consumption was 135.9MB. Max. memory is 16.1GB. * TraceAbstraction took 30322.95ms. Allocated memory was 218.1MB in the beginning and 3.6GB in the end (delta: 3.4GB). Free memory was 106.9MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 145.53ms. Allocated memory is still 3.6GB. Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: 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: 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: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: 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: 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: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: 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: 102]: 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: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 115]: 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: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 121]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 122]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 150]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 152]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 153]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 154]: 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: 197]: 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: 157]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 158]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 159]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 160]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 162]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 163]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 164]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 165]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 167]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 168]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 168]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 169]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 197]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 170]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 172]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 173]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 185]: 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: 132]: 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: 133]: 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: 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: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 138]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 139]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 140]: 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, 786 locations, 300 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: 30.1s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 27.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 528 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 291 mSDsluCounter, 87 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1639 IncrementalHoareTripleChecker+Invalid, 1746 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 87 mSDtfsCounter, 1639 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1234occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 4461 NumberOfCodeBlocks, 4461 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 4432 ConstructedInterpolants, 0 QuantifiedInterpolants, 4603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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 - AllSpecificationsHoldResult: All specifications hold 164 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-13 10:00:29,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE