./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.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 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:01:03,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:01:03,963 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 07:01:03,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:01:03,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:01:04,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:01:04,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:01:04,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:01:04,022 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:01:04,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:01:04,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:01:04,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:01:04,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:01:04,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:01:04,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:01:04,027 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:01:04,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:01:04,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:01:04,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:01:04,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:01:04,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:01:04,031 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:01:04,031 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 07:01:04,031 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:01:04,031 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:01:04,032 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:01:04,032 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:01:04,032 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:01:04,032 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:01:04,032 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:01:04,033 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:01:04,033 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:04,033 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:01:04,033 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:01:04,034 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 07:01:04,034 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:01:04,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:01:04,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:01:04,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:01:04,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:01:04,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:01:04,038 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 -> 462fb42b593b74362524fb8209dde3f76380a79de0c48b612eb75bd0eda8df1c [2024-11-09 07:01:04,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:01:04,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:01:04,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:01:04,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:01:04,350 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:01:04,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2024-11-09 07:01:05,786 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:01:05,993 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:01:05,993 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-parallel-sum-1-dsl.wvr.c [2024-11-09 07:01:06,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/385713c12/d9f5875b771f491d9e1793d8aaa72b17/FLAG1f9dca8ab [2024-11-09 07:01:06,023 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/385713c12/d9f5875b771f491d9e1793d8aaa72b17 [2024-11-09 07:01:06,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:01:06,028 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:01:06,031 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:06,031 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:01:06,039 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:01:06,040 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,041 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203f0901 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06, skipping insertion in model container [2024-11-09 07:01:06,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,075 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:01:06,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:06,360 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:01:06,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:01:06,436 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:01:06,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06 WrapperNode [2024-11-09 07:01:06,437 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:01:06,438 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:06,438 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:01:06,438 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:01:06,445 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,463 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,506 INFO L138 Inliner]: procedures = 28, calls = 66, calls flagged for inlining = 22, calls inlined = 28, statements flattened = 496 [2024-11-09 07:01:06,507 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:01:06,507 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:01:06,508 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:01:06,508 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:01:06,519 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,525 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,526 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,540 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,545 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,551 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,555 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:01:06,557 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:01:06,557 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:01:06,557 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:01:06,559 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (1/1) ... [2024-11-09 07:01:06,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:01:06,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:01:06,616 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-11-09 07:01:06,620 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-11-09 07:01:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:01:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 07:01:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 07:01:06,660 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 07:01:06,660 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 07:01:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 07:01:06,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 07:01:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 07:01:06,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 07:01:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-09 07:01:06,661 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-09 07:01:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 07:01:06,661 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2024-11-09 07:01:06,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2024-11-09 07:01:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2024-11-09 07:01:06,662 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2024-11-09 07:01:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 07:01:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 07:01:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:01:06,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:01:06,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:01:06,665 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 07:01:06,846 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:01:06,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:01:07,598 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 07:01:07,598 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:01:08,099 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:01:08,100 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 07:01:08,100 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:08 BoogieIcfgContainer [2024-11-09 07:01:08,101 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:01:08,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:01:08,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:01:08,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:01:08,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:01:06" (1/3) ... [2024-11-09 07:01:08,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3957dfb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:08, skipping insertion in model container [2024-11-09 07:01:08,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:01:06" (2/3) ... [2024-11-09 07:01:08,111 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3957dfb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:01:08, skipping insertion in model container [2024-11-09 07:01:08,111 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:08" (3/3) ... [2024-11-09 07:01:08,112 INFO L112 eAbstractionObserver]: Analyzing ICFG parallel-parallel-sum-1-dsl.wvr.c [2024-11-09 07:01:08,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:01:08,132 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2024-11-09 07:01:08,133 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 07:01:08,284 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2024-11-09 07:01:08,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 372 places, 371 transitions, 808 flow [2024-11-09 07:01:08,475 INFO L124 PetriNetUnfolderBase]: 18/357 cut-off events. [2024-11-09 07:01:08,475 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-09 07:01:08,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 357 events. 18/357 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 692 event pairs, 0 based on Foata normal form. 0/268 useless extension candidates. Maximal degree in co-relation 314. Up to 3 conditions per place. [2024-11-09 07:01:08,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 372 places, 371 transitions, 808 flow [2024-11-09 07:01:08,502 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 342 places, 340 transitions, 728 flow [2024-11-09 07:01:08,514 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:01:08,524 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;@489c7d07, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:01:08,524 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2024-11-09 07:01:08,531 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 07:01:08,532 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-09 07:01:08,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 07:01:08,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:08,533 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] [2024-11-09 07:01:08,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:08,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:08,539 INFO L85 PathProgramCache]: Analyzing trace with hash -675959310, now seen corresponding path program 1 times [2024-11-09 07:01:08,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:08,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072634115] [2024-11-09 07:01:08,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:08,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:08,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:08,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072634115] [2024-11-09 07:01:08,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072634115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:08,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:08,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:08,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554398507] [2024-11-09 07:01:08,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:08,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:08,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:08,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:08,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:08,851 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 375 [2024-11-09 07:01:08,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 340 transitions, 728 flow. Second operand has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-11-09 07:01:08,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:08,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 375 [2024-11-09 07:01:08,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:10,616 INFO L124 PetriNetUnfolderBase]: 2800/6296 cut-off events. [2024-11-09 07:01:10,617 INFO L125 PetriNetUnfolderBase]: For 1095/1095 co-relation queries the response was YES. [2024-11-09 07:01:10,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10982 conditions, 6296 events. 2800/6296 cut-off events. For 1095/1095 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 48955 event pairs, 1446 based on Foata normal form. 1047/6408 useless extension candidates. Maximal degree in co-relation 10547. Up to 3551 conditions per place. [2024-11-09 07:01:10,690 INFO L140 encePairwiseOnDemand]: 308/375 looper letters, 35 selfloop transitions, 2 changer transitions 3/275 dead transitions. [2024-11-09 07:01:10,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 275 transitions, 672 flow [2024-11-09 07:01:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:10,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:10,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2024-11-09 07:01:10,713 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7893333333333333 [2024-11-09 07:01:10,718 INFO L175 Difference]: Start difference. First operand has 342 places, 340 transitions, 728 flow. Second operand 3 states and 888 transitions. [2024-11-09 07:01:10,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 275 transitions, 672 flow [2024-11-09 07:01:10,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 640 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-09 07:01:10,742 INFO L231 Difference]: Finished difference. Result has 275 places, 272 transitions, 564 flow [2024-11-09 07:01:10,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=275, PETRI_TRANSITIONS=272} [2024-11-09 07:01:10,750 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -67 predicate places. [2024-11-09 07:01:10,752 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 272 transitions, 564 flow [2024-11-09 07:01:10,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.3333333333333) internal successors, (790), 3 states have internal predecessors, (790), 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-11-09 07:01:10,753 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:10,753 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] [2024-11-09 07:01:10,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:01:10,754 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:10,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:10,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1167698333, now seen corresponding path program 1 times [2024-11-09 07:01:10,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:10,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97099939] [2024-11-09 07:01:10,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:10,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:10,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:10,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97099939] [2024-11-09 07:01:10,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97099939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:10,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:10,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:10,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704256571] [2024-11-09 07:01:10,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:10,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:10,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:10,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:10,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:10,862 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 375 [2024-11-09 07:01:10,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 272 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-11-09 07:01:10,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:10,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 375 [2024-11-09 07:01:10,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:12,016 INFO L124 PetriNetUnfolderBase]: 2800/6292 cut-off events. [2024-11-09 07:01:12,016 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:12,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10126 conditions, 6292 events. 2800/6292 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 288. Compared 49047 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10092. Up to 3550 conditions per place. [2024-11-09 07:01:12,086 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 34 selfloop transitions, 2 changer transitions 0/271 dead transitions. [2024-11-09 07:01:12,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 273 places, 271 transitions, 634 flow [2024-11-09 07:01:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2024-11-09 07:01:12,090 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7342222222222222 [2024-11-09 07:01:12,090 INFO L175 Difference]: Start difference. First operand has 275 places, 272 transitions, 564 flow. Second operand 3 states and 826 transitions. [2024-11-09 07:01:12,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 273 places, 271 transitions, 634 flow [2024-11-09 07:01:12,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 271 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:12,099 INFO L231 Difference]: Finished difference. Result has 271 places, 271 transitions, 562 flow [2024-11-09 07:01:12,100 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=271, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=271, PETRI_TRANSITIONS=271} [2024-11-09 07:01:12,100 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -71 predicate places. [2024-11-09 07:01:12,101 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 271 transitions, 562 flow [2024-11-09 07:01:12,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-11-09 07:01:12,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:12,102 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-11-09 07:01:12,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:01:12,103 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:12,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:12,105 INFO L85 PathProgramCache]: Analyzing trace with hash 456454812, now seen corresponding path program 1 times [2024-11-09 07:01:12,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:12,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392146121] [2024-11-09 07:01:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:12,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:12,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:12,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:12,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392146121] [2024-11-09 07:01:12,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392146121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:12,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:12,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:12,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281497737] [2024-11-09 07:01:12,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:12,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:12,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:12,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:12,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:12,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:12,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 271 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:12,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:12,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:12,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:13,376 INFO L124 PetriNetUnfolderBase]: 2800/6291 cut-off events. [2024-11-09 07:01:13,377 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:13,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10124 conditions, 6291 events. 2800/6291 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49043 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10082. Up to 3549 conditions per place. [2024-11-09 07:01:13,427 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 33 selfloop transitions, 2 changer transitions 0/270 dead transitions. [2024-11-09 07:01:13,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 272 places, 270 transitions, 630 flow [2024-11-09 07:01:13,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:13,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:13,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 07:01:13,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736 [2024-11-09 07:01:13,430 INFO L175 Difference]: Start difference. First operand has 271 places, 271 transitions, 562 flow. Second operand 3 states and 828 transitions. [2024-11-09 07:01:13,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 272 places, 270 transitions, 630 flow [2024-11-09 07:01:13,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 270 transitions, 626 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:13,435 INFO L231 Difference]: Finished difference. Result has 270 places, 270 transitions, 560 flow [2024-11-09 07:01:13,436 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=270, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=268, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=270, PETRI_TRANSITIONS=270} [2024-11-09 07:01:13,437 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -72 predicate places. [2024-11-09 07:01:13,437 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 270 transitions, 560 flow [2024-11-09 07:01:13,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:13,438 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:13,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] [2024-11-09 07:01:13,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:01:13,439 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:13,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:13,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1425536791, now seen corresponding path program 1 times [2024-11-09 07:01:13,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:13,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362609620] [2024-11-09 07:01:13,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:13,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:13,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:13,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362609620] [2024-11-09 07:01:13,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362609620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:13,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:13,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:13,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677037702] [2024-11-09 07:01:13,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:13,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:13,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:13,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:13,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:13,521 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:13,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 270 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:13,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:13,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:13,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:14,693 INFO L124 PetriNetUnfolderBase]: 2800/6290 cut-off events. [2024-11-09 07:01:14,693 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:14,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10123 conditions, 6290 events. 2800/6290 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49046 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10073. Up to 3549 conditions per place. [2024-11-09 07:01:14,744 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 33 selfloop transitions, 2 changer transitions 0/269 dead transitions. [2024-11-09 07:01:14,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 269 transitions, 628 flow [2024-11-09 07:01:14,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:14,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:14,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 07:01:14,748 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736 [2024-11-09 07:01:14,748 INFO L175 Difference]: Start difference. First operand has 270 places, 270 transitions, 560 flow. Second operand 3 states and 828 transitions. [2024-11-09 07:01:14,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 269 transitions, 628 flow [2024-11-09 07:01:14,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 269 transitions, 624 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:14,753 INFO L231 Difference]: Finished difference. Result has 269 places, 269 transitions, 558 flow [2024-11-09 07:01:14,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=267, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=269, PETRI_TRANSITIONS=269} [2024-11-09 07:01:14,755 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -73 predicate places. [2024-11-09 07:01:14,755 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 269 transitions, 558 flow [2024-11-09 07:01:14,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:14,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:14,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] [2024-11-09 07:01:14,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:01:14,757 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:14,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1254891883, now seen corresponding path program 1 times [2024-11-09 07:01:14,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:14,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295976972] [2024-11-09 07:01:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:14,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-11-09 07:01:14,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:14,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295976972] [2024-11-09 07:01:14,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295976972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:14,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:14,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:14,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126315513] [2024-11-09 07:01:14,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:14,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:14,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:14,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:14,821 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:14,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 269 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:14,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:14,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:14,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:15,824 INFO L124 PetriNetUnfolderBase]: 2800/6289 cut-off events. [2024-11-09 07:01:15,824 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:15,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 6289 events. 2800/6289 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49065 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10064. Up to 3549 conditions per place. [2024-11-09 07:01:15,878 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 33 selfloop transitions, 2 changer transitions 0/268 dead transitions. [2024-11-09 07:01:15,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 268 transitions, 626 flow [2024-11-09 07:01:15,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:15,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:15,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 07:01:15,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736 [2024-11-09 07:01:15,884 INFO L175 Difference]: Start difference. First operand has 269 places, 269 transitions, 558 flow. Second operand 3 states and 828 transitions. [2024-11-09 07:01:15,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 268 transitions, 626 flow [2024-11-09 07:01:15,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 268 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:15,891 INFO L231 Difference]: Finished difference. Result has 268 places, 268 transitions, 556 flow [2024-11-09 07:01:15,893 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=268, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=266, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=268, PETRI_TRANSITIONS=268} [2024-11-09 07:01:15,895 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -74 predicate places. [2024-11-09 07:01:15,896 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 268 transitions, 556 flow [2024-11-09 07:01:15,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:15,897 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:15,897 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] [2024-11-09 07:01:15,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:01:15,900 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:15,900 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:15,901 INFO L85 PathProgramCache]: Analyzing trace with hash -288670589, now seen corresponding path program 1 times [2024-11-09 07:01:15,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:15,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796599580] [2024-11-09 07:01:15,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:15,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:15,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:15,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:15,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796599580] [2024-11-09 07:01:15,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796599580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:15,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:15,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:15,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803318250] [2024-11-09 07:01:15,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:15,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:15,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:15,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:15,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:15,990 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 375 [2024-11-09 07:01:15,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 268 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-11-09 07:01:15,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:15,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 375 [2024-11-09 07:01:15,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:16,761 INFO L124 PetriNetUnfolderBase]: 2800/6288 cut-off events. [2024-11-09 07:01:16,761 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:16,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 6288 events. 2800/6288 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49088 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10056. Up to 3550 conditions per place. [2024-11-09 07:01:16,809 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 34 selfloop transitions, 2 changer transitions 0/267 dead transitions. [2024-11-09 07:01:16,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 267 transitions, 626 flow [2024-11-09 07:01:16,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:16,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 826 transitions. [2024-11-09 07:01:16,813 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7342222222222222 [2024-11-09 07:01:16,813 INFO L175 Difference]: Start difference. First operand has 268 places, 268 transitions, 556 flow. Second operand 3 states and 826 transitions. [2024-11-09 07:01:16,813 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 267 transitions, 626 flow [2024-11-09 07:01:16,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 267 transitions, 622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:16,817 INFO L231 Difference]: Finished difference. Result has 267 places, 267 transitions, 554 flow [2024-11-09 07:01:16,818 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=265, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=554, PETRI_PLACES=267, PETRI_TRANSITIONS=267} [2024-11-09 07:01:16,819 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -75 predicate places. [2024-11-09 07:01:16,819 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 267 transitions, 554 flow [2024-11-09 07:01:16,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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-11-09 07:01:16,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:16,820 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] [2024-11-09 07:01:16,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:01:16,820 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash -2067435275, now seen corresponding path program 1 times [2024-11-09 07:01:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875882436] [2024-11-09 07:01:16,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:16,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:16,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:16,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875882436] [2024-11-09 07:01:16,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875882436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:16,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:16,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:16,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020439556] [2024-11-09 07:01:16,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:16,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:16,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:16,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:16,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:16,869 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:16,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 267 places, 267 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:16,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:16,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:16,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:17,806 INFO L124 PetriNetUnfolderBase]: 2800/6287 cut-off events. [2024-11-09 07:01:17,806 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:17,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10120 conditions, 6287 events. 2800/6287 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49157 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10046. Up to 3549 conditions per place. [2024-11-09 07:01:17,887 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 33 selfloop transitions, 2 changer transitions 0/266 dead transitions. [2024-11-09 07:01:17,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 266 transitions, 622 flow [2024-11-09 07:01:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 07:01:17,891 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736 [2024-11-09 07:01:17,891 INFO L175 Difference]: Start difference. First operand has 267 places, 267 transitions, 554 flow. Second operand 3 states and 828 transitions. [2024-11-09 07:01:17,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 266 transitions, 622 flow [2024-11-09 07:01:17,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 266 transitions, 618 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:17,897 INFO L231 Difference]: Finished difference. Result has 266 places, 266 transitions, 552 flow [2024-11-09 07:01:17,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=264, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=552, PETRI_PLACES=266, PETRI_TRANSITIONS=266} [2024-11-09 07:01:17,899 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -76 predicate places. [2024-11-09 07:01:17,899 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 266 transitions, 552 flow [2024-11-09 07:01:17,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:17,900 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:17,900 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] [2024-11-09 07:01:17,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:01:17,901 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:17,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1712913886, now seen corresponding path program 1 times [2024-11-09 07:01:17,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:17,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343025701] [2024-11-09 07:01:17,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:17,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:17,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:17,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:17,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:17,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343025701] [2024-11-09 07:01:17,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343025701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:17,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:17,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:17,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463979092] [2024-11-09 07:01:17,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:17,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:17,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:17,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:17,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:17,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:17,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 266 transitions, 552 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:17,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:17,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:17,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:18,812 INFO L124 PetriNetUnfolderBase]: 2800/6286 cut-off events. [2024-11-09 07:01:18,813 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:18,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10119 conditions, 6286 events. 2800/6286 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49011 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10037. Up to 3549 conditions per place. [2024-11-09 07:01:18,864 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 33 selfloop transitions, 2 changer transitions 0/265 dead transitions. [2024-11-09 07:01:18,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 265 transitions, 620 flow [2024-11-09 07:01:18,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:18,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:18,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 07:01:18,867 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736 [2024-11-09 07:01:18,867 INFO L175 Difference]: Start difference. First operand has 266 places, 266 transitions, 552 flow. Second operand 3 states and 828 transitions. [2024-11-09 07:01:18,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 265 transitions, 620 flow [2024-11-09 07:01:18,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 265 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:18,872 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 550 flow [2024-11-09 07:01:18,873 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=265, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=263, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=550, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2024-11-09 07:01:18,873 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -77 predicate places. [2024-11-09 07:01:18,873 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 550 flow [2024-11-09 07:01:18,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:18,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:18,875 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] [2024-11-09 07:01:18,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:01:18,875 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:18,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:18,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1965377812, now seen corresponding path program 1 times [2024-11-09 07:01:18,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:18,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108687378] [2024-11-09 07:01:18,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:18,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:18,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:18,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108687378] [2024-11-09 07:01:18,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108687378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:18,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:18,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:18,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237516476] [2024-11-09 07:01:18,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:18,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:18,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:18,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:18,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:18,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:18,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 550 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:18,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:18,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:18,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:19,595 INFO L124 PetriNetUnfolderBase]: 2800/6285 cut-off events. [2024-11-09 07:01:19,595 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:19,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 6285 events. 2800/6285 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49088 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10028. Up to 3549 conditions per place. [2024-11-09 07:01:19,647 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 33 selfloop transitions, 2 changer transitions 0/264 dead transitions. [2024-11-09 07:01:19,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 264 transitions, 618 flow [2024-11-09 07:01:19,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:19,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 07:01:19,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736 [2024-11-09 07:01:19,650 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 550 flow. Second operand 3 states and 828 transitions. [2024-11-09 07:01:19,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 264 transitions, 618 flow [2024-11-09 07:01:19,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 264 transitions, 614 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:19,656 INFO L231 Difference]: Finished difference. Result has 264 places, 264 transitions, 548 flow [2024-11-09 07:01:19,656 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=544, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=262, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=264, PETRI_TRANSITIONS=264} [2024-11-09 07:01:19,657 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -78 predicate places. [2024-11-09 07:01:19,657 INFO L471 AbstractCegarLoop]: Abstraction has has 264 places, 264 transitions, 548 flow [2024-11-09 07:01:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:19,658 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:19,658 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] [2024-11-09 07:01:19,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:01:19,659 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:19,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1666497278, now seen corresponding path program 1 times [2024-11-09 07:01:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:19,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641783693] [2024-11-09 07:01:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:19,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:19,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:19,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:19,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641783693] [2024-11-09 07:01:19,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641783693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:19,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:19,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:19,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260514924] [2024-11-09 07:01:19,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:19,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:19,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:19,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:19,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:19,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:19,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 264 places, 264 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-11-09 07:01:19,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:19,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:19,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:20,561 INFO L124 PetriNetUnfolderBase]: 2800/6283 cut-off events. [2024-11-09 07:01:20,561 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:20,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10116 conditions, 6283 events. 2800/6283 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49195 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10018. Up to 3549 conditions per place. [2024-11-09 07:01:20,601 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 34 selfloop transitions, 1 changer transitions 0/262 dead transitions. [2024-11-09 07:01:20,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 262 transitions, 614 flow [2024-11-09 07:01:20,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:20,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:20,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 829 transitions. [2024-11-09 07:01:20,604 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7368888888888889 [2024-11-09 07:01:20,604 INFO L175 Difference]: Start difference. First operand has 264 places, 264 transitions, 548 flow. Second operand 3 states and 829 transitions. [2024-11-09 07:01:20,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 262 transitions, 614 flow [2024-11-09 07:01:20,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 262 transitions, 610 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:20,610 INFO L231 Difference]: Finished difference. Result has 262 places, 262 transitions, 542 flow [2024-11-09 07:01:20,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=262, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=542, PETRI_PLACES=262, PETRI_TRANSITIONS=262} [2024-11-09 07:01:20,611 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -80 predicate places. [2024-11-09 07:01:20,611 INFO L471 AbstractCegarLoop]: Abstraction has has 262 places, 262 transitions, 542 flow [2024-11-09 07:01:20,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.0) internal successors, (795), 3 states have internal predecessors, (795), 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-11-09 07:01:20,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:20,612 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] [2024-11-09 07:01:20,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:01:20,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:20,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:20,613 INFO L85 PathProgramCache]: Analyzing trace with hash 819139382, now seen corresponding path program 1 times [2024-11-09 07:01:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:20,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94390712] [2024-11-09 07:01:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:20,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:21,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:21,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:21,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94390712] [2024-11-09 07:01:21,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94390712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:21,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:21,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:01:21,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696425565] [2024-11-09 07:01:21,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:21,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:01:21,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:21,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:01:21,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:01:21,351 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 375 [2024-11-09 07:01:21,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 262 transitions, 542 flow. Second operand has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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-11-09 07:01:21,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:21,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 375 [2024-11-09 07:01:21,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:22,336 INFO L124 PetriNetUnfolderBase]: 2800/6282 cut-off events. [2024-11-09 07:01:22,336 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:22,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10122 conditions, 6282 events. 2800/6282 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49099 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10025. Up to 3554 conditions per place. [2024-11-09 07:01:22,388 INFO L140 encePairwiseOnDemand]: 369/375 looper letters, 38 selfloop transitions, 5 changer transitions 0/261 dead transitions. [2024-11-09 07:01:22,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 261 transitions, 626 flow [2024-11-09 07:01:22,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:01:22,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 07:01:22,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1586 transitions. [2024-11-09 07:01:22,394 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7048888888888889 [2024-11-09 07:01:22,394 INFO L175 Difference]: Start difference. First operand has 262 places, 262 transitions, 542 flow. Second operand 6 states and 1586 transitions. [2024-11-09 07:01:22,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 261 transitions, 626 flow [2024-11-09 07:01:22,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 265 places, 261 transitions, 625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:22,400 INFO L231 Difference]: Finished difference. Result has 265 places, 261 transitions, 549 flow [2024-11-09 07:01:22,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=539, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=261, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=256, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=549, PETRI_PLACES=265, PETRI_TRANSITIONS=261} [2024-11-09 07:01:22,401 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -77 predicate places. [2024-11-09 07:01:22,401 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 261 transitions, 549 flow [2024-11-09 07:01:22,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.5) internal successors, (1551), 6 states have internal predecessors, (1551), 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-11-09 07:01:22,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:22,403 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] [2024-11-09 07:01:22,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 07:01:22,403 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:22,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:22,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1456166517, now seen corresponding path program 1 times [2024-11-09 07:01:22,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:22,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630684657] [2024-11-09 07:01:22,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:22,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:22,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:22,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630684657] [2024-11-09 07:01:22,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630684657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:22,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:22,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:22,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156715621] [2024-11-09 07:01:22,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:22,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:22,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:22,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:22,467 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 264 out of 375 [2024-11-09 07:01:22,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 261 transitions, 549 flow. Second operand has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:22,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:22,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 264 of 375 [2024-11-09 07:01:22,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:23,426 INFO L124 PetriNetUnfolderBase]: 2800/6281 cut-off events. [2024-11-09 07:01:23,427 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:23,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10118 conditions, 6281 events. 2800/6281 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49124 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10100. Up to 3549 conditions per place. [2024-11-09 07:01:23,506 INFO L140 encePairwiseOnDemand]: 372/375 looper letters, 33 selfloop transitions, 2 changer transitions 0/260 dead transitions. [2024-11-09 07:01:23,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 260 transitions, 617 flow [2024-11-09 07:01:23,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:23,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 828 transitions. [2024-11-09 07:01:23,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.736 [2024-11-09 07:01:23,509 INFO L175 Difference]: Start difference. First operand has 265 places, 261 transitions, 549 flow. Second operand 3 states and 828 transitions. [2024-11-09 07:01:23,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 260 transitions, 617 flow [2024-11-09 07:01:23,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 260 transitions, 607 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-09 07:01:23,515 INFO L231 Difference]: Finished difference. Result has 261 places, 260 transitions, 541 flow [2024-11-09 07:01:23,516 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=537, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=260, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=541, PETRI_PLACES=261, PETRI_TRANSITIONS=260} [2024-11-09 07:01:23,516 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -81 predicate places. [2024-11-09 07:01:23,517 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 260 transitions, 541 flow [2024-11-09 07:01:23,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 265.3333333333333) internal successors, (796), 3 states have internal predecessors, (796), 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-11-09 07:01:23,519 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:23,520 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] [2024-11-09 07:01:23,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 07:01:23,520 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:23,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:23,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1487252302, now seen corresponding path program 1 times [2024-11-09 07:01:23,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:23,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829681685] [2024-11-09 07:01:23,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:23,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829681685] [2024-11-09 07:01:23,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829681685] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:23,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:23,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041459943] [2024-11-09 07:01:23,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:23,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:23,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:23,630 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 375 [2024-11-09 07:01:23,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 260 transitions, 541 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-11-09 07:01:23,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:23,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 375 [2024-11-09 07:01:23,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:24,610 INFO L124 PetriNetUnfolderBase]: 2800/6280 cut-off events. [2024-11-09 07:01:24,611 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:24,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10112 conditions, 6280 events. 2800/6280 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49167 event pairs, 1446 based on Foata normal form. 0/5361 useless extension candidates. Maximal degree in co-relation 10014. Up to 3547 conditions per place. [2024-11-09 07:01:24,667 INFO L140 encePairwiseOnDemand]: 373/375 looper letters, 32 selfloop transitions, 1 changer transitions 0/259 dead transitions. [2024-11-09 07:01:24,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 262 places, 259 transitions, 605 flow [2024-11-09 07:01:24,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:24,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:24,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 835 transitions. [2024-11-09 07:01:24,670 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7422222222222222 [2024-11-09 07:01:24,670 INFO L175 Difference]: Start difference. First operand has 261 places, 260 transitions, 541 flow. Second operand 3 states and 835 transitions. [2024-11-09 07:01:24,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 262 places, 259 transitions, 605 flow [2024-11-09 07:01:24,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 259 transitions, 601 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 07:01:24,678 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 537 flow [2024-11-09 07:01:24,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=535, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=259, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=537, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2024-11-09 07:01:24,680 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2024-11-09 07:01:24,681 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 537 flow [2024-11-09 07:01:24,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-11-09 07:01:24,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 07:01:24,682 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] [2024-11-09 07:01:24,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:01:24,682 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 134 more)] === [2024-11-09 07:01:24,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:01:24,683 INFO L85 PathProgramCache]: Analyzing trace with hash -223459309, now seen corresponding path program 1 times [2024-11-09 07:01:24,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:01:24,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056705591] [2024-11-09 07:01:24,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:01:24,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:01:24,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:01:24,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:01:24,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:01:24,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056705591] [2024-11-09 07:01:24,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056705591] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:01:24,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:01:24,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:01:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324423384] [2024-11-09 07:01:24,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:01:24,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:01:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:01:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:01:24,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:01:24,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 267 out of 375 [2024-11-09 07:01:24,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 537 flow. Second operand has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-11-09 07:01:24,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 07:01:24,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 267 of 375 [2024-11-09 07:01:24,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 07:01:25,871 INFO L124 PetriNetUnfolderBase]: 2800/6279 cut-off events. [2024-11-09 07:01:25,871 INFO L125 PetriNetUnfolderBase]: For 259/259 co-relation queries the response was YES. [2024-11-09 07:01:25,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10109 conditions, 6279 events. 2800/6279 cut-off events. For 259/259 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 49038 event pairs, 1446 based on Foata normal form. 1/5361 useless extension candidates. Maximal degree in co-relation 10101. Up to 3547 conditions per place. [2024-11-09 07:01:25,904 INFO L140 encePairwiseOnDemand]: 373/375 looper letters, 0 selfloop transitions, 0 changer transitions 258/258 dead transitions. [2024-11-09 07:01:25,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 261 places, 258 transitions, 599 flow [2024-11-09 07:01:25,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:01:25,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 07:01:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2024-11-09 07:01:25,907 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7413333333333333 [2024-11-09 07:01:25,907 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 537 flow. Second operand 3 states and 834 transitions. [2024-11-09 07:01:25,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 261 places, 258 transitions, 599 flow [2024-11-09 07:01:25,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 260 places, 258 transitions, 598 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 07:01:25,912 INFO L231 Difference]: Finished difference. Result has 260 places, 0 transitions, 0 flow [2024-11-09 07:01:25,912 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=375, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=258, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=260, PETRI_TRANSITIONS=0} [2024-11-09 07:01:25,913 INFO L277 CegarLoopForPetriNet]: 342 programPoint places, -82 predicate places. [2024-11-09 07:01:25,913 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 0 transitions, 0 flow [2024-11-09 07:01:25,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 274.0) internal successors, (822), 3 states have internal predecessors, (822), 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-11-09 07:01:25,919 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (136 of 137 remaining) [2024-11-09 07:01:25,922 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (135 of 137 remaining) [2024-11-09 07:01:25,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (134 of 137 remaining) [2024-11-09 07:01:25,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (133 of 137 remaining) [2024-11-09 07:01:25,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (132 of 137 remaining) [2024-11-09 07:01:25,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (131 of 137 remaining) [2024-11-09 07:01:25,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (130 of 137 remaining) [2024-11-09 07:01:25,923 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (129 of 137 remaining) [2024-11-09 07:01:25,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (128 of 137 remaining) [2024-11-09 07:01:25,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (127 of 137 remaining) [2024-11-09 07:01:25,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (126 of 137 remaining) [2024-11-09 07:01:25,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (125 of 137 remaining) [2024-11-09 07:01:25,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (124 of 137 remaining) [2024-11-09 07:01:25,924 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (123 of 137 remaining) [2024-11-09 07:01:25,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (122 of 137 remaining) [2024-11-09 07:01:25,925 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (121 of 137 remaining) [2024-11-09 07:01:25,928 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (120 of 137 remaining) [2024-11-09 07:01:25,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (119 of 137 remaining) [2024-11-09 07:01:25,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (118 of 137 remaining) [2024-11-09 07:01:25,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (117 of 137 remaining) [2024-11-09 07:01:25,929 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (116 of 137 remaining) [2024-11-09 07:01:25,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (115 of 137 remaining) [2024-11-09 07:01:25,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (114 of 137 remaining) [2024-11-09 07:01:25,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (113 of 137 remaining) [2024-11-09 07:01:25,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (112 of 137 remaining) [2024-11-09 07:01:25,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (111 of 137 remaining) [2024-11-09 07:01:25,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (110 of 137 remaining) [2024-11-09 07:01:25,930 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (109 of 137 remaining) [2024-11-09 07:01:25,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (108 of 137 remaining) [2024-11-09 07:01:25,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (107 of 137 remaining) [2024-11-09 07:01:25,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (106 of 137 remaining) [2024-11-09 07:01:25,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (105 of 137 remaining) [2024-11-09 07:01:25,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (104 of 137 remaining) [2024-11-09 07:01:25,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (103 of 137 remaining) [2024-11-09 07:01:25,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (102 of 137 remaining) [2024-11-09 07:01:25,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (101 of 137 remaining) [2024-11-09 07:01:25,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (100 of 137 remaining) [2024-11-09 07:01:25,932 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (99 of 137 remaining) [2024-11-09 07:01:25,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (98 of 137 remaining) [2024-11-09 07:01:25,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (97 of 137 remaining) [2024-11-09 07:01:25,933 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (96 of 137 remaining) [2024-11-09 07:01:25,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (95 of 137 remaining) [2024-11-09 07:01:25,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (94 of 137 remaining) [2024-11-09 07:01:25,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (93 of 137 remaining) [2024-11-09 07:01:25,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (92 of 137 remaining) [2024-11-09 07:01:25,934 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 137 remaining) [2024-11-09 07:01:25,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 137 remaining) [2024-11-09 07:01:25,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 137 remaining) [2024-11-09 07:01:25,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 137 remaining) [2024-11-09 07:01:25,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (87 of 137 remaining) [2024-11-09 07:01:25,935 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (86 of 137 remaining) [2024-11-09 07:01:25,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (85 of 137 remaining) [2024-11-09 07:01:25,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (84 of 137 remaining) [2024-11-09 07:01:25,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (83 of 137 remaining) [2024-11-09 07:01:25,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (82 of 137 remaining) [2024-11-09 07:01:25,936 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (81 of 137 remaining) [2024-11-09 07:01:25,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (80 of 137 remaining) [2024-11-09 07:01:25,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (79 of 137 remaining) [2024-11-09 07:01:25,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (78 of 137 remaining) [2024-11-09 07:01:25,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (77 of 137 remaining) [2024-11-09 07:01:25,937 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (76 of 137 remaining) [2024-11-09 07:01:25,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (75 of 137 remaining) [2024-11-09 07:01:25,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (74 of 137 remaining) [2024-11-09 07:01:25,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (73 of 137 remaining) [2024-11-09 07:01:25,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (72 of 137 remaining) [2024-11-09 07:01:25,938 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (71 of 137 remaining) [2024-11-09 07:01:25,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (70 of 137 remaining) [2024-11-09 07:01:25,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (69 of 137 remaining) [2024-11-09 07:01:25,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (68 of 137 remaining) [2024-11-09 07:01:25,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (67 of 137 remaining) [2024-11-09 07:01:25,939 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (66 of 137 remaining) [2024-11-09 07:01:25,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (65 of 137 remaining) [2024-11-09 07:01:25,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (64 of 137 remaining) [2024-11-09 07:01:25,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (63 of 137 remaining) [2024-11-09 07:01:25,940 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (62 of 137 remaining) [2024-11-09 07:01:25,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (61 of 137 remaining) [2024-11-09 07:01:25,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (60 of 137 remaining) [2024-11-09 07:01:25,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (59 of 137 remaining) [2024-11-09 07:01:25,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (58 of 137 remaining) [2024-11-09 07:01:25,941 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (57 of 137 remaining) [2024-11-09 07:01:25,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Thread1of1ForFork3Err6INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (56 of 137 remaining) [2024-11-09 07:01:25,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (55 of 137 remaining) [2024-11-09 07:01:25,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (54 of 137 remaining) [2024-11-09 07:01:25,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (53 of 137 remaining) [2024-11-09 07:01:25,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (52 of 137 remaining) [2024-11-09 07:01:25,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (51 of 137 remaining) [2024-11-09 07:01:25,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (50 of 137 remaining) [2024-11-09 07:01:25,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (49 of 137 remaining) [2024-11-09 07:01:25,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (48 of 137 remaining) [2024-11-09 07:01:25,943 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (47 of 137 remaining) [2024-11-09 07:01:25,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (46 of 137 remaining) [2024-11-09 07:01:25,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (45 of 137 remaining) [2024-11-09 07:01:25,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (44 of 137 remaining) [2024-11-09 07:01:25,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (43 of 137 remaining) [2024-11-09 07:01:25,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (42 of 137 remaining) [2024-11-09 07:01:25,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (41 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (40 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (39 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (38 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (37 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (36 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (34 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (33 of 137 remaining) [2024-11-09 07:01:25,945 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (32 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (31 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (30 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (29 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (28 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork5Err3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork5Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err11ASSERT_VIOLATIONDATA_RACE (25 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err12ASSERT_VIOLATIONDATA_RACE (24 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err0ASSERT_VIOLATIONDATA_RACE (23 of 137 remaining) [2024-11-09 07:01:25,946 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err1ASSERT_VIOLATIONDATA_RACE (22 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err2ASSERT_VIOLATIONDATA_RACE (21 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err3ASSERT_VIOLATIONDATA_RACE (20 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err4ASSERT_VIOLATIONDATA_RACE (19 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err5ASSERT_VIOLATIONDATA_RACE (18 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err6ASSERT_VIOLATIONDATA_RACE (17 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err7ASSERT_VIOLATIONDATA_RACE (16 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err8ASSERT_VIOLATIONDATA_RACE (15 of 137 remaining) [2024-11-09 07:01:25,947 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err9ASSERT_VIOLATIONDATA_RACE (14 of 137 remaining) [2024-11-09 07:01:25,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread5Err10ASSERT_VIOLATIONDATA_RACE (13 of 137 remaining) [2024-11-09 07:01:25,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err11ASSERT_VIOLATIONDATA_RACE (12 of 137 remaining) [2024-11-09 07:01:25,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err12ASSERT_VIOLATIONDATA_RACE (11 of 137 remaining) [2024-11-09 07:01:25,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err0ASSERT_VIOLATIONDATA_RACE (10 of 137 remaining) [2024-11-09 07:01:25,948 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err1ASSERT_VIOLATIONDATA_RACE (9 of 137 remaining) [2024-11-09 07:01:25,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err2ASSERT_VIOLATIONDATA_RACE (8 of 137 remaining) [2024-11-09 07:01:25,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err3ASSERT_VIOLATIONDATA_RACE (7 of 137 remaining) [2024-11-09 07:01:25,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err4ASSERT_VIOLATIONDATA_RACE (6 of 137 remaining) [2024-11-09 07:01:25,949 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err5ASSERT_VIOLATIONDATA_RACE (5 of 137 remaining) [2024-11-09 07:01:25,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err6ASSERT_VIOLATIONDATA_RACE (4 of 137 remaining) [2024-11-09 07:01:25,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err7ASSERT_VIOLATIONDATA_RACE (3 of 137 remaining) [2024-11-09 07:01:25,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err8ASSERT_VIOLATIONDATA_RACE (2 of 137 remaining) [2024-11-09 07:01:25,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err9ASSERT_VIOLATIONDATA_RACE (1 of 137 remaining) [2024-11-09 07:01:25,950 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread6Err10ASSERT_VIOLATIONDATA_RACE (0 of 137 remaining) [2024-11-09 07:01:25,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:01:25,951 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:01:25,959 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 07:01:25,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:01:25,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:01:25 BasicIcfg [2024-11-09 07:01:25,967 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:01:25,967 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:01:25,968 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:01:25,968 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:01:25,968 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:01:08" (3/4) ... [2024-11-09 07:01:25,970 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-09 07:01:25,972 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-09 07:01:25,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-09 07:01:25,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-09 07:01:25,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-09 07:01:25,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread5 [2024-11-09 07:01:25,973 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread6 [2024-11-09 07:01:25,981 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2024-11-09 07:01:25,981 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-09 07:01:25,982 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-09 07:01:25,982 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-09 07:01:26,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 07:01:26,080 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-09 07:01:26,080 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:01:26,081 INFO L158 Benchmark]: Toolchain (without parser) took 20053.24ms. Allocated memory was 188.7MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 139.6MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-11-09 07:01:26,081 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:01:26,081 INFO L158 Benchmark]: CACSL2BoogieTranslator took 406.29ms. Allocated memory is still 188.7MB. Free memory was 139.6MB in the beginning and 123.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-09 07:01:26,081 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.11ms. Allocated memory is still 188.7MB. Free memory was 123.8MB in the beginning and 120.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:01:26,082 INFO L158 Benchmark]: Boogie Preprocessor took 48.37ms. Allocated memory is still 188.7MB. Free memory was 120.2MB in the beginning and 116.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:01:26,082 INFO L158 Benchmark]: RCFGBuilder took 1545.08ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 116.9MB in the beginning and 157.9MB in the end (delta: -40.9MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. [2024-11-09 07:01:26,082 INFO L158 Benchmark]: TraceAbstraction took 17863.29ms. Allocated memory was 226.5MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 156.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. [2024-11-09 07:01:26,082 INFO L158 Benchmark]: Witness Printer took 112.79ms. Allocated memory is still 4.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 07:01:26,084 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.19ms. Allocated memory is still 109.1MB. Free memory is still 70.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 406.29ms. Allocated memory is still 188.7MB. Free memory was 139.6MB in the beginning and 123.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.11ms. Allocated memory is still 188.7MB. Free memory was 123.8MB in the beginning and 120.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.37ms. Allocated memory is still 188.7MB. Free memory was 120.2MB in the beginning and 116.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1545.08ms. Allocated memory was 188.7MB in the beginning and 226.5MB in the end (delta: 37.7MB). Free memory was 116.9MB in the beginning and 157.9MB in the end (delta: -40.9MB). Peak memory consumption was 64.6MB. Max. memory is 16.1GB. * TraceAbstraction took 17863.29ms. Allocated memory was 226.5MB in the beginning and 4.4GB in the end (delta: 4.2GB). Free memory was 156.8MB in the beginning and 1.5GB in the end (delta: -1.3GB). Peak memory consumption was 2.9GB. Max. memory is 16.1GB. * Witness Printer took 112.79ms. Allocated memory is still 4.4GB. Free memory was 1.5GB in the beginning and 1.5GB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 155]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 156]: 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: 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: 161]: 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: 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: 185]: 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: 173]: 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: 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: 111]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 111]: 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: 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: 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: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: 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: 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: 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: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 125]: 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 13 procedures, 502 locations, 137 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: 17.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 189 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 67 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1044 IncrementalHoareTripleChecker+Invalid, 1077 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 56 mSDtfsCounter, 1044 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=0, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1326 NumberOfCodeBlocks, 1326 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1312 ConstructedInterpolants, 0 QuantifiedInterpolants, 1453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-09 07:01:26,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE