./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3061b6dc 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/popl20-bad-buffer-mult-alt2.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 a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 05:58:59,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 05:58:59,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-19 05:58:59,288 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 05:58:59,290 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 05:58:59,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 05:58:59,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 05:58:59,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 05:58:59,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 05:58:59,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 05:58:59,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 05:58:59,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 05:58:59,310 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 05:58:59,311 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 05:58:59,311 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 05:58:59,311 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 05:58:59,312 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 05:58:59,312 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 05:58:59,312 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 05:58:59,312 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 05:58:59,313 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 05:58:59,313 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 05:58:59,313 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-19 05:58:59,314 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 05:58:59,314 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 05:58:59,314 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 05:58:59,315 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 05:58:59,315 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 05:58:59,315 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 05:58:59,315 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 05:58:59,316 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 05:58:59,316 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:58:59,316 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 05:58:59,316 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 05:58:59,317 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 05:58:59,317 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 05:58:59,317 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 05:58:59,318 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 05:58:59,318 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 05:58:59,318 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 05:58:59,318 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 05:58:59,319 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 -> a79fe9fcfc95192d454ac05616e4d9a71dbf2bcc8b4fd9d21dcef47910a50542 [2024-11-19 05:58:59,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 05:58:59,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 05:58:59,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 05:58:59,561 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 05:58:59,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 05:58:59,562 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-11-19 05:59:01,053 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 05:59:01,253 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 05:59:01,254 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2024-11-19 05:59:01,261 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c8d4034/f2b6593f05584748a285b635d241299e/FLAG3da8de0d4 [2024-11-19 05:59:01,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97c8d4034/f2b6593f05584748a285b635d241299e [2024-11-19 05:59:01,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 05:59:01,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 05:59:01,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:01,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 05:59:01,281 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 05:59:01,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56bf0d23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01, skipping insertion in model container [2024-11-19 05:59:01,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,311 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 05:59:01,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:01,565 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 05:59:01,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 05:59:01,645 INFO L204 MainTranslator]: Completed translation [2024-11-19 05:59:01,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01 WrapperNode [2024-11-19 05:59:01,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 05:59:01,646 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:01,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 05:59:01,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 05:59:01,655 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,713 INFO L138 Inliner]: procedures = 25, calls = 56, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 615 [2024-11-19 05:59:01,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 05:59:01,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 05:59:01,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 05:59:01,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 05:59:01,722 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,723 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,737 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,737 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,765 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,770 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,776 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,787 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 05:59:01,788 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 05:59:01,788 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 05:59:01,788 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 05:59:01,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (1/1) ... [2024-11-19 05:59:01,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 05:59:01,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 05:59:01,828 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-19 05:59:01,830 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-19 05:59:01,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 05:59:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 05:59:01,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 05:59:01,871 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 05:59:01,871 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 05:59:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 05:59:01,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 05:59:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 05:59:01,872 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 05:59:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 05:59:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 05:59:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 05:59:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 05:59:01,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 05:59:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 05:59:01,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 05:59:01,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 05:59:01,874 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 05:59:01,977 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 05:59:01,979 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 05:59:02,643 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 05:59:02,644 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 05:59:03,108 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 05:59:03,108 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 05:59:03,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:03 BoogieIcfgContainer [2024-11-19 05:59:03,109 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 05:59:03,111 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 05:59:03,111 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 05:59:03,113 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 05:59:03,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 05:59:01" (1/3) ... [2024-11-19 05:59:03,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbbc8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:03, skipping insertion in model container [2024-11-19 05:59:03,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 05:59:01" (2/3) ... [2024-11-19 05:59:03,115 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cbbc8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 05:59:03, skipping insertion in model container [2024-11-19 05:59:03,115 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:03" (3/3) ... [2024-11-19 05:59:03,116 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2024-11-19 05:59:03,131 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 05:59:03,131 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 95 error locations. [2024-11-19 05:59:03,131 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 05:59:03,362 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 05:59:03,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 431 places, 441 transitions, 910 flow [2024-11-19 05:59:03,538 INFO L124 PetriNetUnfolderBase]: 23/437 cut-off events. [2024-11-19 05:59:03,538 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 05:59:03,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 454 conditions, 437 events. 23/437 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 641 event pairs, 0 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 388. Up to 2 conditions per place. [2024-11-19 05:59:03,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 431 places, 441 transitions, 910 flow [2024-11-19 05:59:03,555 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 411 places, 420 transitions, 864 flow [2024-11-19 05:59:03,561 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 05:59:03,570 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;@2c139be3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 05:59:03,571 INFO L334 AbstractCegarLoop]: Starting to check reachability of 169 error locations. [2024-11-19 05:59:03,575 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 05:59:03,575 INFO L124 PetriNetUnfolderBase]: 0/31 cut-off events. [2024-11-19 05:59:03,575 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 05:59:03,575 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:03,576 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] [2024-11-19 05:59:03,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:03,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:03,581 INFO L85 PathProgramCache]: Analyzing trace with hash -217748628, now seen corresponding path program 1 times [2024-11-19 05:59:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:03,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164241656] [2024-11-19 05:59:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:03,746 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-19 05:59:03,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:03,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164241656] [2024-11-19 05:59:03,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164241656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:03,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:03,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:03,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743623097] [2024-11-19 05:59:03,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:03,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:03,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:03,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:03,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:03,801 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 441 [2024-11-19 05:59:03,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 411 places, 420 transitions, 864 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-19 05:59:03,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:03,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 441 [2024-11-19 05:59:03,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:04,160 INFO L124 PetriNetUnfolderBase]: 454/1201 cut-off events. [2024-11-19 05:59:04,161 INFO L125 PetriNetUnfolderBase]: For 158/158 co-relation queries the response was YES. [2024-11-19 05:59:04,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1201 events. 454/1201 cut-off events. For 158/158 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5259 event pairs, 272 based on Foata normal form. 184/1252 useless extension candidates. Maximal degree in co-relation 1525. Up to 614 conditions per place. [2024-11-19 05:59:04,172 INFO L140 encePairwiseOnDemand]: 356/441 looper letters, 25 selfloop transitions, 2 changer transitions 6/337 dead transitions. [2024-11-19 05:59:04,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 337 transitions, 752 flow [2024-11-19 05:59:04,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:04,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:04,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2024-11-19 05:59:04,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8269085411942555 [2024-11-19 05:59:04,192 INFO L175 Difference]: Start difference. First operand has 411 places, 420 transitions, 864 flow. Second operand 3 states and 1094 transitions. [2024-11-19 05:59:04,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 337 transitions, 752 flow [2024-11-19 05:59:04,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 334 places, 337 transitions, 736 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 05:59:04,204 INFO L231 Difference]: Finished difference. Result has 334 places, 331 transitions, 674 flow [2024-11-19 05:59:04,206 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=332, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=335, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=674, PETRI_PLACES=334, PETRI_TRANSITIONS=331} [2024-11-19 05:59:04,211 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -77 predicate places. [2024-11-19 05:59:04,212 INFO L471 AbstractCegarLoop]: Abstraction has has 334 places, 331 transitions, 674 flow [2024-11-19 05:59:04,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-19 05:59:04,213 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:04,213 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] [2024-11-19 05:59:04,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 05:59:04,214 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:04,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2035310580, now seen corresponding path program 1 times [2024-11-19 05:59:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549450478] [2024-11-19 05:59:04,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:04,286 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-19 05:59:04,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:04,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549450478] [2024-11-19 05:59:04,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549450478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:04,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:04,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:04,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723744480] [2024-11-19 05:59:04,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:04,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:04,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:04,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:04,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:04,310 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 328 out of 441 [2024-11-19 05:59:04,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 334 places, 331 transitions, 674 flow. Second operand has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-19 05:59:04,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:04,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 328 of 441 [2024-11-19 05:59:04,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:04,640 INFO L124 PetriNetUnfolderBase]: 454/1194 cut-off events. [2024-11-19 05:59:04,640 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:04,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1854 conditions, 1194 events. 454/1194 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5230 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1814. Up to 614 conditions per place. [2024-11-19 05:59:04,647 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 25 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2024-11-19 05:59:04,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 330 transitions, 726 flow [2024-11-19 05:59:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:04,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1012 transitions. [2024-11-19 05:59:04,650 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.764928193499622 [2024-11-19 05:59:04,650 INFO L175 Difference]: Start difference. First operand has 334 places, 331 transitions, 674 flow. Second operand 3 states and 1012 transitions. [2024-11-19 05:59:04,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 330 transitions, 726 flow [2024-11-19 05:59:04,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 327 places, 330 transitions, 722 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:04,658 INFO L231 Difference]: Finished difference. Result has 327 places, 330 transitions, 672 flow [2024-11-19 05:59:04,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=328, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=672, PETRI_PLACES=327, PETRI_TRANSITIONS=330} [2024-11-19 05:59:04,660 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -84 predicate places. [2024-11-19 05:59:04,661 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 330 transitions, 672 flow [2024-11-19 05:59:04,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 329.3333333333333) internal successors, (988), 3 states have internal predecessors, (988), 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-19 05:59:04,661 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:04,661 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] [2024-11-19 05:59:04,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 05:59:04,662 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:04,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 99853079, now seen corresponding path program 1 times [2024-11-19 05:59:04,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:04,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350856179] [2024-11-19 05:59:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:04,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:04,731 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-19 05:59:04,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:04,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350856179] [2024-11-19 05:59:04,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350856179] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:04,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:04,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:04,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462221216] [2024-11-19 05:59:04,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:04,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:04,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:04,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:04,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 441 [2024-11-19 05:59:04,749 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 330 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:04,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:04,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 441 [2024-11-19 05:59:04,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:04,998 INFO L124 PetriNetUnfolderBase]: 454/1193 cut-off events. [2024-11-19 05:59:04,998 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:05,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1193 events. 454/1193 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5232 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1804. Up to 613 conditions per place. [2024-11-19 05:59:05,006 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 2 changer transitions 0/329 dead transitions. [2024-11-19 05:59:05,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 329 transitions, 722 flow [2024-11-19 05:59:05,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-19 05:59:05,009 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2024-11-19 05:59:05,009 INFO L175 Difference]: Start difference. First operand has 327 places, 330 transitions, 672 flow. Second operand 3 states and 1014 transitions. [2024-11-19 05:59:05,009 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 329 transitions, 722 flow [2024-11-19 05:59:05,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 329 transitions, 718 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:05,014 INFO L231 Difference]: Finished difference. Result has 326 places, 329 transitions, 670 flow [2024-11-19 05:59:05,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=666, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=329, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=670, PETRI_PLACES=326, PETRI_TRANSITIONS=329} [2024-11-19 05:59:05,016 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -85 predicate places. [2024-11-19 05:59:05,017 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 329 transitions, 670 flow [2024-11-19 05:59:05,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,018 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:05,018 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] [2024-11-19 05:59:05,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 05:59:05,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:05,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1751934238, now seen corresponding path program 1 times [2024-11-19 05:59:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607949243] [2024-11-19 05:59:05,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:05,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:05,075 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-19 05:59:05,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:05,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607949243] [2024-11-19 05:59:05,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607949243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:05,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:05,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:05,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147096110] [2024-11-19 05:59:05,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:05,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:05,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:05,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:05,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:05,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 441 [2024-11-19 05:59:05,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 329 transitions, 670 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:05,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 441 [2024-11-19 05:59:05,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:05,282 INFO L124 PetriNetUnfolderBase]: 454/1192 cut-off events. [2024-11-19 05:59:05,282 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:05,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1192 events. 454/1192 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5224 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1795. Up to 613 conditions per place. [2024-11-19 05:59:05,289 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 2 changer transitions 0/328 dead transitions. [2024-11-19 05:59:05,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 328 transitions, 720 flow [2024-11-19 05:59:05,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:05,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-19 05:59:05,291 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2024-11-19 05:59:05,291 INFO L175 Difference]: Start difference. First operand has 326 places, 329 transitions, 670 flow. Second operand 3 states and 1014 transitions. [2024-11-19 05:59:05,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 328 transitions, 720 flow [2024-11-19 05:59:05,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 328 transitions, 716 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:05,296 INFO L231 Difference]: Finished difference. Result has 325 places, 328 transitions, 668 flow [2024-11-19 05:59:05,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=668, PETRI_PLACES=325, PETRI_TRANSITIONS=328} [2024-11-19 05:59:05,298 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -86 predicate places. [2024-11-19 05:59:05,298 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 328 transitions, 668 flow [2024-11-19 05:59:05,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,299 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:05,299 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] [2024-11-19 05:59:05,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 05:59:05,300 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:05,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:05,301 INFO L85 PathProgramCache]: Analyzing trace with hash -927214196, now seen corresponding path program 1 times [2024-11-19 05:59:05,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:05,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156386945] [2024-11-19 05:59:05,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:05,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:05,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:05,359 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-19 05:59:05,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:05,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156386945] [2024-11-19 05:59:05,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156386945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:05,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:05,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:05,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237434731] [2024-11-19 05:59:05,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:05,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:05,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:05,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:05,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:05,372 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 441 [2024-11-19 05:59:05,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 328 transitions, 668 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:05,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 441 [2024-11-19 05:59:05,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:05,560 INFO L124 PetriNetUnfolderBase]: 454/1191 cut-off events. [2024-11-19 05:59:05,560 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:05,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1850 conditions, 1191 events. 454/1191 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5205 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1786. Up to 613 conditions per place. [2024-11-19 05:59:05,568 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 2 changer transitions 0/327 dead transitions. [2024-11-19 05:59:05,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 327 transitions, 718 flow [2024-11-19 05:59:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:05,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-19 05:59:05,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2024-11-19 05:59:05,571 INFO L175 Difference]: Start difference. First operand has 325 places, 328 transitions, 668 flow. Second operand 3 states and 1014 transitions. [2024-11-19 05:59:05,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 327 transitions, 718 flow [2024-11-19 05:59:05,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 327 transitions, 714 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:05,576 INFO L231 Difference]: Finished difference. Result has 324 places, 327 transitions, 666 flow [2024-11-19 05:59:05,577 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=324, PETRI_TRANSITIONS=327} [2024-11-19 05:59:05,580 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -87 predicate places. [2024-11-19 05:59:05,580 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 327 transitions, 666 flow [2024-11-19 05:59:05,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:05,582 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] [2024-11-19 05:59:05,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 05:59:05,583 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:05,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:05,584 INFO L85 PathProgramCache]: Analyzing trace with hash -897493643, now seen corresponding path program 1 times [2024-11-19 05:59:05,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:05,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767281031] [2024-11-19 05:59:05,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:05,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:05,651 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-19 05:59:05,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:05,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767281031] [2024-11-19 05:59:05,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767281031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:05,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:05,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:05,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432981020] [2024-11-19 05:59:05,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:05,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:05,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:05,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:05,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:05,675 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 441 [2024-11-19 05:59:05,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 327 transitions, 666 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:05,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 441 [2024-11-19 05:59:05,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:05,851 INFO L124 PetriNetUnfolderBase]: 454/1190 cut-off events. [2024-11-19 05:59:05,851 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:05,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 1190 events. 454/1190 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5205 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1777. Up to 613 conditions per place. [2024-11-19 05:59:05,857 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 2 changer transitions 0/326 dead transitions. [2024-11-19 05:59:05,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 326 transitions, 716 flow [2024-11-19 05:59:05,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:05,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:05,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-19 05:59:05,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2024-11-19 05:59:05,860 INFO L175 Difference]: Start difference. First operand has 324 places, 327 transitions, 666 flow. Second operand 3 states and 1014 transitions. [2024-11-19 05:59:05,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 326 transitions, 716 flow [2024-11-19 05:59:05,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 326 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:05,864 INFO L231 Difference]: Finished difference. Result has 323 places, 326 transitions, 664 flow [2024-11-19 05:59:05,864 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=326, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=324, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=323, PETRI_TRANSITIONS=326} [2024-11-19 05:59:05,865 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -88 predicate places. [2024-11-19 05:59:05,865 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 326 transitions, 664 flow [2024-11-19 05:59:05,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:05,866 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] [2024-11-19 05:59:05,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 05:59:05,866 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:05,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:05,867 INFO L85 PathProgramCache]: Analyzing trace with hash 2142561607, now seen corresponding path program 1 times [2024-11-19 05:59:05,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:05,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305214873] [2024-11-19 05:59:05,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:05,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:05,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:05,911 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-19 05:59:05,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:05,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305214873] [2024-11-19 05:59:05,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305214873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:05,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:05,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:05,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12709679] [2024-11-19 05:59:05,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:05,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:05,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:05,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 441 [2024-11-19 05:59:05,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 326 transitions, 664 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:05,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:05,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 441 [2024-11-19 05:59:05,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:06,187 INFO L124 PetriNetUnfolderBase]: 454/1189 cut-off events. [2024-11-19 05:59:06,187 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:06,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1848 conditions, 1189 events. 454/1189 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5191 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1768. Up to 613 conditions per place. [2024-11-19 05:59:06,192 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 2 changer transitions 0/325 dead transitions. [2024-11-19 05:59:06,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 325 transitions, 714 flow [2024-11-19 05:59:06,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:06,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:06,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-19 05:59:06,195 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2024-11-19 05:59:06,195 INFO L175 Difference]: Start difference. First operand has 323 places, 326 transitions, 664 flow. Second operand 3 states and 1014 transitions. [2024-11-19 05:59:06,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 325 transitions, 714 flow [2024-11-19 05:59:06,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 325 transitions, 710 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:06,199 INFO L231 Difference]: Finished difference. Result has 322 places, 325 transitions, 662 flow [2024-11-19 05:59:06,199 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=662, PETRI_PLACES=322, PETRI_TRANSITIONS=325} [2024-11-19 05:59:06,200 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -89 predicate places. [2024-11-19 05:59:06,200 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 325 transitions, 662 flow [2024-11-19 05:59:06,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:06,201 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:06,201 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] [2024-11-19 05:59:06,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 05:59:06,201 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1197129863, now seen corresponding path program 1 times [2024-11-19 05:59:06,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:06,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178299219] [2024-11-19 05:59:06,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:06,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:06,228 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-19 05:59:06,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:06,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178299219] [2024-11-19 05:59:06,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178299219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:06,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:06,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:06,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839784790] [2024-11-19 05:59:06,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:06,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:06,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:06,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 441 [2024-11-19 05:59:06,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 325 transitions, 662 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:06,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:06,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 441 [2024-11-19 05:59:06,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:06,395 INFO L124 PetriNetUnfolderBase]: 454/1188 cut-off events. [2024-11-19 05:59:06,395 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:06,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1188 events. 454/1188 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5158 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1759. Up to 613 conditions per place. [2024-11-19 05:59:06,401 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 2 changer transitions 0/324 dead transitions. [2024-11-19 05:59:06,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 324 transitions, 712 flow [2024-11-19 05:59:06,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-19 05:59:06,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2024-11-19 05:59:06,403 INFO L175 Difference]: Start difference. First operand has 322 places, 325 transitions, 662 flow. Second operand 3 states and 1014 transitions. [2024-11-19 05:59:06,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 324 transitions, 712 flow [2024-11-19 05:59:06,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 324 transitions, 708 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:06,407 INFO L231 Difference]: Finished difference. Result has 321 places, 324 transitions, 660 flow [2024-11-19 05:59:06,408 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=321, PETRI_TRANSITIONS=324} [2024-11-19 05:59:06,408 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -90 predicate places. [2024-11-19 05:59:06,408 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 324 transitions, 660 flow [2024-11-19 05:59:06,409 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:06,409 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:06,410 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] [2024-11-19 05:59:06,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 05:59:06,410 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:06,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:06,410 INFO L85 PathProgramCache]: Analyzing trace with hash 208725674, now seen corresponding path program 1 times [2024-11-19 05:59:06,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:06,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534646283] [2024-11-19 05:59:06,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:06,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:06,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:06,436 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-19 05:59:06,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:06,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534646283] [2024-11-19 05:59:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534646283] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:06,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:06,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:06,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509251141] [2024-11-19 05:59:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:06,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:06,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:06,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:06,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 329 out of 441 [2024-11-19 05:59:06,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 324 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:06,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:06,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 329 of 441 [2024-11-19 05:59:06,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:06,653 INFO L124 PetriNetUnfolderBase]: 454/1187 cut-off events. [2024-11-19 05:59:06,653 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:06,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1846 conditions, 1187 events. 454/1187 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5212 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1750. Up to 613 conditions per place. [2024-11-19 05:59:06,659 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2024-11-19 05:59:06,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 323 transitions, 710 flow [2024-11-19 05:59:06,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:06,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:06,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1014 transitions. [2024-11-19 05:59:06,662 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7664399092970522 [2024-11-19 05:59:06,662 INFO L175 Difference]: Start difference. First operand has 321 places, 324 transitions, 660 flow. Second operand 3 states and 1014 transitions. [2024-11-19 05:59:06,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 323 transitions, 710 flow [2024-11-19 05:59:06,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 323 transitions, 706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:06,666 INFO L231 Difference]: Finished difference. Result has 320 places, 323 transitions, 658 flow [2024-11-19 05:59:06,667 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=320, PETRI_TRANSITIONS=323} [2024-11-19 05:59:06,667 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -91 predicate places. [2024-11-19 05:59:06,667 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 323 transitions, 658 flow [2024-11-19 05:59:06,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 330.3333333333333) internal successors, (991), 3 states have internal predecessors, (991), 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-19 05:59:06,668 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:06,668 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] [2024-11-19 05:59:06,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 05:59:06,669 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:06,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:06,669 INFO L85 PathProgramCache]: Analyzing trace with hash 178268364, now seen corresponding path program 1 times [2024-11-19 05:59:06,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:06,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807729700] [2024-11-19 05:59:06,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:06,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:06,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:06,703 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-19 05:59:06,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:06,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807729700] [2024-11-19 05:59:06,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807729700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:06,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:06,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:06,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109325027] [2024-11-19 05:59:06,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:06,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:06,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:06,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:06,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:06,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 441 [2024-11-19 05:59:06,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 323 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:06,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:06,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 441 [2024-11-19 05:59:06,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:06,892 INFO L124 PetriNetUnfolderBase]: 454/1186 cut-off events. [2024-11-19 05:59:06,893 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:06,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1186 events. 454/1186 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5203 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1738. Up to 610 conditions per place. [2024-11-19 05:59:06,898 INFO L140 encePairwiseOnDemand]: 439/441 looper letters, 22 selfloop transitions, 1 changer transitions 0/322 dead transitions. [2024-11-19 05:59:06,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 322 transitions, 702 flow [2024-11-19 05:59:06,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:06,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2024-11-19 05:59:06,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7732426303854876 [2024-11-19 05:59:06,900 INFO L175 Difference]: Start difference. First operand has 320 places, 323 transitions, 658 flow. Second operand 3 states and 1023 transitions. [2024-11-19 05:59:06,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 322 transitions, 702 flow [2024-11-19 05:59:06,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 322 transitions, 698 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:06,904 INFO L231 Difference]: Finished difference. Result has 319 places, 322 transitions, 654 flow [2024-11-19 05:59:06,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=652, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=654, PETRI_PLACES=319, PETRI_TRANSITIONS=322} [2024-11-19 05:59:06,905 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -92 predicate places. [2024-11-19 05:59:06,905 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 322 transitions, 654 flow [2024-11-19 05:59:06,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:06,906 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:06,906 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] [2024-11-19 05:59:06,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 05:59:06,906 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:06,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:06,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1680157895, now seen corresponding path program 1 times [2024-11-19 05:59:06,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:06,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155535993] [2024-11-19 05:59:06,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:06,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:06,943 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-19 05:59:06,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:06,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155535993] [2024-11-19 05:59:06,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155535993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:06,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:06,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:06,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146486027] [2024-11-19 05:59:06,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:06,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:06,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:06,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:06,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:06,951 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 441 [2024-11-19 05:59:06,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 322 transitions, 654 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-19 05:59:06,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:06,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 441 [2024-11-19 05:59:06,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:07,127 INFO L124 PetriNetUnfolderBase]: 454/1185 cut-off events. [2024-11-19 05:59:07,127 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:07,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1842 conditions, 1185 events. 454/1185 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5198 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1738. Up to 612 conditions per place. [2024-11-19 05:59:07,131 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 23 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2024-11-19 05:59:07,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 321 transitions, 702 flow [2024-11-19 05:59:07,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:07,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-19 05:59:07,133 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7679516250944822 [2024-11-19 05:59:07,133 INFO L175 Difference]: Start difference. First operand has 319 places, 322 transitions, 654 flow. Second operand 3 states and 1016 transitions. [2024-11-19 05:59:07,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 321 transitions, 702 flow [2024-11-19 05:59:07,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 321 transitions, 701 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:07,137 INFO L231 Difference]: Finished difference. Result has 319 places, 321 transitions, 655 flow [2024-11-19 05:59:07,138 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=319, PETRI_TRANSITIONS=321} [2024-11-19 05:59:07,138 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -92 predicate places. [2024-11-19 05:59:07,138 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 321 transitions, 655 flow [2024-11-19 05:59:07,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-19 05:59:07,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:07,139 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] [2024-11-19 05:59:07,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 05:59:07,139 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:07,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:07,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1085041701, now seen corresponding path program 1 times [2024-11-19 05:59:07,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:07,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242183364] [2024-11-19 05:59:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:07,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:07,673 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-19 05:59:07,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:07,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242183364] [2024-11-19 05:59:07,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242183364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:07,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:07,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 05:59:07,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840000460] [2024-11-19 05:59:07,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:07,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 05:59:07,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:07,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 05:59:07,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-19 05:59:07,839 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 309 out of 441 [2024-11-19 05:59:07,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 321 transitions, 655 flow. Second operand has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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-19 05:59:07,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:07,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 309 of 441 [2024-11-19 05:59:07,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:08,168 INFO L124 PetriNetUnfolderBase]: 454/1183 cut-off events. [2024-11-19 05:59:08,168 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:08,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1863 conditions, 1183 events. 454/1183 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5200 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1760. Up to 625 conditions per place. [2024-11-19 05:59:08,174 INFO L140 encePairwiseOnDemand]: 429/441 looper letters, 36 selfloop transitions, 10 changer transitions 0/319 dead transitions. [2024-11-19 05:59:08,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 319 transitions, 743 flow [2024-11-19 05:59:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 05:59:08,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 05:59:08,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1902 transitions. [2024-11-19 05:59:08,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7188208616780045 [2024-11-19 05:59:08,177 INFO L175 Difference]: Start difference. First operand has 319 places, 321 transitions, 655 flow. Second operand 6 states and 1902 transitions. [2024-11-19 05:59:08,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 319 transitions, 743 flow [2024-11-19 05:59:08,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 319 transitions, 739 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:08,181 INFO L231 Difference]: Finished difference. Result has 320 places, 319 transitions, 667 flow [2024-11-19 05:59:08,182 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=647, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=667, PETRI_PLACES=320, PETRI_TRANSITIONS=319} [2024-11-19 05:59:08,182 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -91 predicate places. [2024-11-19 05:59:08,182 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 319 transitions, 667 flow [2024-11-19 05:59:08,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 310.5) internal successors, (1863), 6 states have internal predecessors, (1863), 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-19 05:59:08,183 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:08,184 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] [2024-11-19 05:59:08,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 05:59:08,185 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:08,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1145315122, now seen corresponding path program 1 times [2024-11-19 05:59:08,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:08,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616590748] [2024-11-19 05:59:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:08,210 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-19 05:59:08,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:08,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616590748] [2024-11-19 05:59:08,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616590748] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:08,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:08,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:08,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642543922] [2024-11-19 05:59:08,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:08,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:08,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:08,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:08,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:08,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 441 [2024-11-19 05:59:08,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 319 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:08,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:08,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 441 [2024-11-19 05:59:08,219 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:08,365 INFO L124 PetriNetUnfolderBase]: 454/1182 cut-off events. [2024-11-19 05:59:08,366 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:08,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1847 conditions, 1182 events. 454/1182 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5196 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1814. Up to 610 conditions per place. [2024-11-19 05:59:08,370 INFO L140 encePairwiseOnDemand]: 439/441 looper letters, 22 selfloop transitions, 1 changer transitions 0/318 dead transitions. [2024-11-19 05:59:08,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 318 transitions, 711 flow [2024-11-19 05:59:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:08,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:08,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2024-11-19 05:59:08,373 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7732426303854876 [2024-11-19 05:59:08,373 INFO L175 Difference]: Start difference. First operand has 320 places, 319 transitions, 667 flow. Second operand 3 states and 1023 transitions. [2024-11-19 05:59:08,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 318 transitions, 711 flow [2024-11-19 05:59:08,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 318 transitions, 691 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-19 05:59:08,377 INFO L231 Difference]: Finished difference. Result has 316 places, 318 transitions, 647 flow [2024-11-19 05:59:08,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=647, PETRI_PLACES=316, PETRI_TRANSITIONS=318} [2024-11-19 05:59:08,379 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -95 predicate places. [2024-11-19 05:59:08,379 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 318 transitions, 647 flow [2024-11-19 05:59:08,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:08,380 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:08,380 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:08,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 05:59:08,380 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:08,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:08,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1783595941, now seen corresponding path program 1 times [2024-11-19 05:59:08,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:08,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720256470] [2024-11-19 05:59:08,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:08,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:08,417 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-19 05:59:08,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:08,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720256470] [2024-11-19 05:59:08,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720256470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:08,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:08,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:08,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520634843] [2024-11-19 05:59:08,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:08,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:08,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:08,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:08,428 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 441 [2024-11-19 05:59:08,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 318 transitions, 647 flow. Second operand has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-19 05:59:08,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:08,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 441 [2024-11-19 05:59:08,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:08,567 INFO L124 PetriNetUnfolderBase]: 454/1181 cut-off events. [2024-11-19 05:59:08,568 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:08,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 1181 events. 454/1181 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5194 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1735. Up to 612 conditions per place. [2024-11-19 05:59:08,572 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 23 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2024-11-19 05:59:08,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 317 transitions, 695 flow [2024-11-19 05:59:08,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:08,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1016 transitions. [2024-11-19 05:59:08,575 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7679516250944822 [2024-11-19 05:59:08,575 INFO L175 Difference]: Start difference. First operand has 316 places, 318 transitions, 647 flow. Second operand 3 states and 1016 transitions. [2024-11-19 05:59:08,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 317 transitions, 695 flow [2024-11-19 05:59:08,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 317 transitions, 694 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:08,579 INFO L231 Difference]: Finished difference. Result has 316 places, 317 transitions, 648 flow [2024-11-19 05:59:08,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=648, PETRI_PLACES=316, PETRI_TRANSITIONS=317} [2024-11-19 05:59:08,581 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -95 predicate places. [2024-11-19 05:59:08,581 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 317 transitions, 648 flow [2024-11-19 05:59:08,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.3333333333333) internal successors, (994), 3 states have internal predecessors, (994), 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-19 05:59:08,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:08,582 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] [2024-11-19 05:59:08,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 05:59:08,582 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:08,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:08,582 INFO L85 PathProgramCache]: Analyzing trace with hash -309532110, now seen corresponding path program 1 times [2024-11-19 05:59:08,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:08,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500400282] [2024-11-19 05:59:08,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:08,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:08,622 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-19 05:59:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:08,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500400282] [2024-11-19 05:59:08,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500400282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:08,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:08,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:08,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793457109] [2024-11-19 05:59:08,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:08,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:08,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:08,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:08,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:08,632 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 441 [2024-11-19 05:59:08,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 317 transitions, 648 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-19 05:59:08,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:08,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 441 [2024-11-19 05:59:08,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:08,791 INFO L124 PetriNetUnfolderBase]: 454/1179 cut-off events. [2024-11-19 05:59:08,791 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:08,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 1179 events. 454/1179 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5177 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1735. Up to 612 conditions per place. [2024-11-19 05:59:08,796 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 1 changer transitions 0/315 dead transitions. [2024-11-19 05:59:08,796 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 315 transitions, 694 flow [2024-11-19 05:59:08,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2024-11-19 05:59:08,798 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-11-19 05:59:08,798 INFO L175 Difference]: Start difference. First operand has 316 places, 317 transitions, 648 flow. Second operand 3 states and 1017 transitions. [2024-11-19 05:59:08,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 315 transitions, 694 flow [2024-11-19 05:59:08,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 315 transitions, 690 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:08,802 INFO L231 Difference]: Finished difference. Result has 314 places, 315 transitions, 642 flow [2024-11-19 05:59:08,802 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=642, PETRI_PLACES=314, PETRI_TRANSITIONS=315} [2024-11-19 05:59:08,803 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -97 predicate places. [2024-11-19 05:59:08,803 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 315 transitions, 642 flow [2024-11-19 05:59:08,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-19 05:59:08,804 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:08,804 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] [2024-11-19 05:59:08,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 05:59:08,804 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:08,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:08,804 INFO L85 PathProgramCache]: Analyzing trace with hash -252932681, now seen corresponding path program 1 times [2024-11-19 05:59:08,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:08,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591472147] [2024-11-19 05:59:08,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:08,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:08,843 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-19 05:59:08,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:08,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591472147] [2024-11-19 05:59:08,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591472147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:08,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:08,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:08,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174402733] [2024-11-19 05:59:08,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:08,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:08,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:08,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:08,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:08,854 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 441 [2024-11-19 05:59:08,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 315 transitions, 642 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:08,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:08,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 441 [2024-11-19 05:59:08,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:08,994 INFO L124 PetriNetUnfolderBase]: 454/1178 cut-off events. [2024-11-19 05:59:08,994 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:08,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1178 events. 454/1178 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5161 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1731. Up to 610 conditions per place. [2024-11-19 05:59:08,999 INFO L140 encePairwiseOnDemand]: 439/441 looper letters, 22 selfloop transitions, 1 changer transitions 0/314 dead transitions. [2024-11-19 05:59:08,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 314 transitions, 686 flow [2024-11-19 05:59:09,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:09,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:09,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1023 transitions. [2024-11-19 05:59:09,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7732426303854876 [2024-11-19 05:59:09,002 INFO L175 Difference]: Start difference. First operand has 314 places, 315 transitions, 642 flow. Second operand 3 states and 1023 transitions. [2024-11-19 05:59:09,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 314 transitions, 686 flow [2024-11-19 05:59:09,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 314 transitions, 685 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:09,007 INFO L231 Difference]: Finished difference. Result has 314 places, 314 transitions, 641 flow [2024-11-19 05:59:09,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=641, PETRI_PLACES=314, PETRI_TRANSITIONS=314} [2024-11-19 05:59:09,008 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -97 predicate places. [2024-11-19 05:59:09,008 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 314 transitions, 641 flow [2024-11-19 05:59:09,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:09,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:09,009 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] [2024-11-19 05:59:09,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 05:59:09,010 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:09,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:09,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1744896250, now seen corresponding path program 1 times [2024-11-19 05:59:09,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:09,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027085109] [2024-11-19 05:59:09,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:09,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:09,050 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-19 05:59:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:09,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027085109] [2024-11-19 05:59:09,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027085109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:09,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5197713] [2024-11-19 05:59:09,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:09,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:09,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:09,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:09,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:09,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 330 out of 441 [2024-11-19 05:59:09,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 314 transitions, 641 flow. Second operand has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-19 05:59:09,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:09,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 330 of 441 [2024-11-19 05:59:09,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:09,245 INFO L124 PetriNetUnfolderBase]: 454/1176 cut-off events. [2024-11-19 05:59:09,246 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2024-11-19 05:59:09,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1836 conditions, 1176 events. 454/1176 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5190 event pairs, 272 based on Foata normal form. 0/1068 useless extension candidates. Maximal degree in co-relation 1732. Up to 612 conditions per place. [2024-11-19 05:59:09,250 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 24 selfloop transitions, 1 changer transitions 0/312 dead transitions. [2024-11-19 05:59:09,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 312 transitions, 687 flow [2024-11-19 05:59:09,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:09,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:09,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1017 transitions. [2024-11-19 05:59:09,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7687074829931972 [2024-11-19 05:59:09,253 INFO L175 Difference]: Start difference. First operand has 314 places, 314 transitions, 641 flow. Second operand 3 states and 1017 transitions. [2024-11-19 05:59:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 312 transitions, 687 flow [2024-11-19 05:59:09,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 312 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:09,258 INFO L231 Difference]: Finished difference. Result has 313 places, 312 transitions, 638 flow [2024-11-19 05:59:09,258 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=313, PETRI_TRANSITIONS=312} [2024-11-19 05:59:09,258 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -98 predicate places. [2024-11-19 05:59:09,259 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 312 transitions, 638 flow [2024-11-19 05:59:09,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 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-19 05:59:09,259 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:09,259 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] [2024-11-19 05:59:09,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 05:59:09,260 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:09,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:09,260 INFO L85 PathProgramCache]: Analyzing trace with hash 531211510, now seen corresponding path program 1 times [2024-11-19 05:59:09,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:09,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667190050] [2024-11-19 05:59:09,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:09,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:09,314 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-19 05:59:09,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:09,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667190050] [2024-11-19 05:59:09,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667190050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:09,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:09,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:09,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924508159] [2024-11-19 05:59:09,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:09,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:09,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:09,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:09,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:09,324 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 441 [2024-11-19 05:59:09,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 312 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:09,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:09,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 441 [2024-11-19 05:59:09,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:09,625 INFO L124 PetriNetUnfolderBase]: 761/1916 cut-off events. [2024-11-19 05:59:09,625 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2024-11-19 05:59:09,628 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3025 conditions, 1916 events. 761/1916 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 10681 event pairs, 443 based on Foata normal form. 0/1713 useless extension candidates. Maximal degree in co-relation 2921. Up to 658 conditions per place. [2024-11-19 05:59:09,637 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 40 selfloop transitions, 2 changer transitions 0/330 dead transitions. [2024-11-19 05:59:09,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 330 transitions, 766 flow [2024-11-19 05:59:09,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:09,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:09,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1042 transitions. [2024-11-19 05:59:09,640 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7876039304610734 [2024-11-19 05:59:09,640 INFO L175 Difference]: Start difference. First operand has 313 places, 312 transitions, 638 flow. Second operand 3 states and 1042 transitions. [2024-11-19 05:59:09,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 330 transitions, 766 flow [2024-11-19 05:59:09,641 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 330 transitions, 765 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:09,647 INFO L231 Difference]: Finished difference. Result has 314 places, 312 transitions, 645 flow [2024-11-19 05:59:09,648 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=635, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=645, PETRI_PLACES=314, PETRI_TRANSITIONS=312} [2024-11-19 05:59:09,648 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -97 predicate places. [2024-11-19 05:59:09,648 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 312 transitions, 645 flow [2024-11-19 05:59:09,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:09,649 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:09,650 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] [2024-11-19 05:59:09,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 05:59:09,650 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:09,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:09,650 INFO L85 PathProgramCache]: Analyzing trace with hash -606781788, now seen corresponding path program 1 times [2024-11-19 05:59:09,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:09,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565233658] [2024-11-19 05:59:09,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:09,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:09,688 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-19 05:59:09,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:09,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565233658] [2024-11-19 05:59:09,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565233658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:09,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:09,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:09,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671023219] [2024-11-19 05:59:09,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:09,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:09,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:09,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:09,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:09,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 441 [2024-11-19 05:59:09,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 312 transitions, 645 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:09,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:09,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 441 [2024-11-19 05:59:09,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:10,059 INFO L124 PetriNetUnfolderBase]: 1158/2863 cut-off events. [2024-11-19 05:59:10,059 INFO L125 PetriNetUnfolderBase]: For 286/286 co-relation queries the response was YES. [2024-11-19 05:59:10,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4780 conditions, 2863 events. 1158/2863 cut-off events. For 286/286 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 18573 event pairs, 457 based on Foata normal form. 0/2539 useless extension candidates. Maximal degree in co-relation 4675. Up to 841 conditions per place. [2024-11-19 05:59:10,072 INFO L140 encePairwiseOnDemand]: 437/441 looper letters, 41 selfloop transitions, 4 changer transitions 0/332 dead transitions. [2024-11-19 05:59:10,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 332 transitions, 788 flow [2024-11-19 05:59:10,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:10,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2024-11-19 05:59:10,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7883597883597884 [2024-11-19 05:59:10,075 INFO L175 Difference]: Start difference. First operand has 314 places, 312 transitions, 645 flow. Second operand 3 states and 1043 transitions. [2024-11-19 05:59:10,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 332 transitions, 788 flow [2024-11-19 05:59:10,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 332 transitions, 785 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:10,079 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 673 flow [2024-11-19 05:59:10,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=641, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2024-11-19 05:59:10,080 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -95 predicate places. [2024-11-19 05:59:10,080 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 673 flow [2024-11-19 05:59:10,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:10,081 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:10,081 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] [2024-11-19 05:59:10,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 05:59:10,081 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:10,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:10,082 INFO L85 PathProgramCache]: Analyzing trace with hash -611999650, now seen corresponding path program 1 times [2024-11-19 05:59:10,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:10,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124563782] [2024-11-19 05:59:10,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:10,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:10,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:10,116 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-19 05:59:10,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:10,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124563782] [2024-11-19 05:59:10,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124563782] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:10,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:10,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:10,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234044353] [2024-11-19 05:59:10,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:10,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:10,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:10,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:10,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 441 [2024-11-19 05:59:10,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:10,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:10,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 441 [2024-11-19 05:59:10,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:10,741 INFO L124 PetriNetUnfolderBase]: 2007/4791 cut-off events. [2024-11-19 05:59:10,741 INFO L125 PetriNetUnfolderBase]: For 1837/1837 co-relation queries the response was YES. [2024-11-19 05:59:10,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8760 conditions, 4791 events. 2007/4791 cut-off events. For 1837/1837 co-relation queries the response was YES. Maximal size of possible extension queue 241. Compared 36574 event pairs, 1125 based on Foata normal form. 0/4255 useless extension candidates. Maximal degree in co-relation 8654. Up to 1676 conditions per place. [2024-11-19 05:59:10,765 INFO L140 encePairwiseOnDemand]: 438/441 looper letters, 48 selfloop transitions, 2 changer transitions 0/336 dead transitions. [2024-11-19 05:59:10,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 336 transitions, 851 flow [2024-11-19 05:59:10,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:10,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:10,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1042 transitions. [2024-11-19 05:59:10,767 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7876039304610734 [2024-11-19 05:59:10,767 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 673 flow. Second operand 3 states and 1042 transitions. [2024-11-19 05:59:10,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 336 transitions, 851 flow [2024-11-19 05:59:10,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 336 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:10,772 INFO L231 Difference]: Finished difference. Result has 316 places, 314 transitions, 673 flow [2024-11-19 05:59:10,773 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=316, PETRI_TRANSITIONS=314} [2024-11-19 05:59:10,773 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -95 predicate places. [2024-11-19 05:59:10,773 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 314 transitions, 673 flow [2024-11-19 05:59:10,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:10,774 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:10,774 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] [2024-11-19 05:59:10,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 05:59:10,774 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:10,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash 278910060, now seen corresponding path program 1 times [2024-11-19 05:59:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:10,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855559046] [2024-11-19 05:59:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:10,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:10,805 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-19 05:59:10,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:10,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855559046] [2024-11-19 05:59:10,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855559046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:10,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:10,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:10,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4873406] [2024-11-19 05:59:10,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:10,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:10,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:10,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:10,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:10,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 333 out of 441 [2024-11-19 05:59:10,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 314 transitions, 673 flow. Second operand has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:10,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:10,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 333 of 441 [2024-11-19 05:59:10,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:11,845 INFO L124 PetriNetUnfolderBase]: 2826/6664 cut-off events. [2024-11-19 05:59:11,849 INFO L125 PetriNetUnfolderBase]: For 2177/2177 co-relation queries the response was YES. [2024-11-19 05:59:11,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12387 conditions, 6664 events. 2826/6664 cut-off events. For 2177/2177 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 54726 event pairs, 1117 based on Foata normal form. 0/5917 useless extension candidates. Maximal degree in co-relation 12280. Up to 2206 conditions per place. [2024-11-19 05:59:11,895 INFO L140 encePairwiseOnDemand]: 437/441 looper letters, 49 selfloop transitions, 4 changer transitions 0/338 dead transitions. [2024-11-19 05:59:11,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 338 transitions, 860 flow [2024-11-19 05:59:11,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:11,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:11,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1043 transitions. [2024-11-19 05:59:11,897 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7883597883597884 [2024-11-19 05:59:11,897 INFO L175 Difference]: Start difference. First operand has 316 places, 314 transitions, 673 flow. Second operand 3 states and 1043 transitions. [2024-11-19 05:59:11,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 338 transitions, 860 flow [2024-11-19 05:59:11,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 338 transitions, 857 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 05:59:11,902 INFO L231 Difference]: Finished difference. Result has 318 places, 316 transitions, 701 flow [2024-11-19 05:59:11,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=669, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=701, PETRI_PLACES=318, PETRI_TRANSITIONS=316} [2024-11-19 05:59:11,903 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -93 predicate places. [2024-11-19 05:59:11,903 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 316 transitions, 701 flow [2024-11-19 05:59:11,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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-19 05:59:11,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 05:59:11,904 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:11,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-19 05:59:11,904 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 165 more)] === [2024-11-19 05:59:11,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 05:59:11,905 INFO L85 PathProgramCache]: Analyzing trace with hash -551800656, now seen corresponding path program 1 times [2024-11-19 05:59:11,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 05:59:11,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667297675] [2024-11-19 05:59:11,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 05:59:11,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 05:59:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 05:59:11,969 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-19 05:59:11,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 05:59:11,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667297675] [2024-11-19 05:59:11,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667297675] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 05:59:11,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 05:59:11,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 05:59:11,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968989014] [2024-11-19 05:59:11,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 05:59:11,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 05:59:11,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 05:59:11,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 05:59:11,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 05:59:11,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 334 out of 441 [2024-11-19 05:59:11,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 316 transitions, 701 flow. Second operand has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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-19 05:59:11,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 05:59:11,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 334 of 441 [2024-11-19 05:59:11,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 05:59:13,010 INFO L124 PetriNetUnfolderBase]: 2826/6794 cut-off events. [2024-11-19 05:59:13,010 INFO L125 PetriNetUnfolderBase]: For 4038/4038 co-relation queries the response was YES. [2024-11-19 05:59:13,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13445 conditions, 6794 events. 2826/6794 cut-off events. For 4038/4038 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 57304 event pairs, 1550 based on Foata normal form. 16/6032 useless extension candidates. Maximal degree in co-relation 13338. Up to 3855 conditions per place. [2024-11-19 05:59:13,029 INFO L140 encePairwiseOnDemand]: 439/441 looper letters, 0 selfloop transitions, 0 changer transitions 315/315 dead transitions. [2024-11-19 05:59:13,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 757 flow [2024-11-19 05:59:13,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 05:59:13,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 05:59:13,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1024 transitions. [2024-11-19 05:59:13,032 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7739984882842026 [2024-11-19 05:59:13,032 INFO L175 Difference]: Start difference. First operand has 318 places, 316 transitions, 701 flow. Second operand 3 states and 1024 transitions. [2024-11-19 05:59:13,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 757 flow [2024-11-19 05:59:13,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 315 transitions, 749 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 05:59:13,036 INFO L231 Difference]: Finished difference. Result has 317 places, 0 transitions, 0 flow [2024-11-19 05:59:13,037 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=441, PETRI_DIFFERENCE_MINUEND_FLOW=691, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=317, PETRI_TRANSITIONS=0} [2024-11-19 05:59:13,037 INFO L277 CegarLoopForPetriNet]: 411 programPoint places, -94 predicate places. [2024-11-19 05:59:13,037 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 0 transitions, 0 flow [2024-11-19 05:59:13,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 338.6666666666667) internal successors, (1016), 3 states have internal predecessors, (1016), 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-19 05:59:13,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (168 of 169 remaining) [2024-11-19 05:59:13,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (167 of 169 remaining) [2024-11-19 05:59:13,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (166 of 169 remaining) [2024-11-19 05:59:13,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (165 of 169 remaining) [2024-11-19 05:59:13,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (164 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (163 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (162 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (161 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (160 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (159 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (158 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (157 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (156 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (155 of 169 remaining) [2024-11-19 05:59:13,041 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (154 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (153 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (152 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (151 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (150 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (149 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (148 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (147 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (146 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (145 of 169 remaining) [2024-11-19 05:59:13,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (144 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (143 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (142 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (141 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (140 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (139 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (138 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (137 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (136 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (135 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (134 of 169 remaining) [2024-11-19 05:59:13,043 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (133 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (132 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (131 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (130 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (129 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (128 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (127 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (126 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (125 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (124 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (123 of 169 remaining) [2024-11-19 05:59:13,044 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (122 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (121 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (120 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (119 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (118 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (117 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (116 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (115 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (114 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (113 of 169 remaining) [2024-11-19 05:59:13,045 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (112 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (111 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (110 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (109 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (108 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (107 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (106 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (105 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (104 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (103 of 169 remaining) [2024-11-19 05:59:13,046 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (102 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (101 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (100 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (99 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (98 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (97 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (96 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (95 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (94 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (93 of 169 remaining) [2024-11-19 05:59:13,047 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (92 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (91 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (90 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (89 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (88 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (87 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (86 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (85 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (84 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (83 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (82 of 169 remaining) [2024-11-19 05:59:13,048 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (81 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (80 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (79 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (78 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (77 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (76 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (75 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (74 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (73 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (72 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (71 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (70 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (69 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (68 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (67 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (66 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (65 of 169 remaining) [2024-11-19 05:59:13,049 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (64 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (63 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (62 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (61 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (60 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (59 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (58 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (57 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (56 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (55 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (54 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (53 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (52 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (51 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (50 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (49 of 169 remaining) [2024-11-19 05:59:13,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (48 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (47 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (46 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (45 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (44 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (43 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (42 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (40 of 169 remaining) [2024-11-19 05:59:13,051 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (39 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (38 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (37 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (36 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (35 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (34 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (33 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (32 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (31 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (30 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (29 of 169 remaining) [2024-11-19 05:59:13,052 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (28 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (27 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (26 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONDATA_RACE (25 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONDATA_RACE (24 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONDATA_RACE (23 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONDATA_RACE (22 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONDATA_RACE (21 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONDATA_RACE (20 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (19 of 169 remaining) [2024-11-19 05:59:13,053 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (18 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (17 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (16 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (15 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (14 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (13 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (12 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (11 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (10 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (9 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (8 of 169 remaining) [2024-11-19 05:59:13,054 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (7 of 169 remaining) [2024-11-19 05:59:13,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (6 of 169 remaining) [2024-11-19 05:59:13,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err14ASSERT_VIOLATIONDATA_RACE (5 of 169 remaining) [2024-11-19 05:59:13,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err15ASSERT_VIOLATIONDATA_RACE (4 of 169 remaining) [2024-11-19 05:59:13,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err16ASSERT_VIOLATIONDATA_RACE (3 of 169 remaining) [2024-11-19 05:59:13,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err17ASSERT_VIOLATIONDATA_RACE (2 of 169 remaining) [2024-11-19 05:59:13,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err18ASSERT_VIOLATIONDATA_RACE (1 of 169 remaining) [2024-11-19 05:59:13,055 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err19ASSERT_VIOLATIONDATA_RACE (0 of 169 remaining) [2024-11-19 05:59:13,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 05:59:13,056 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 05:59:13,061 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 05:59:13,061 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 05:59:13,065 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 05:59:13 BasicIcfg [2024-11-19 05:59:13,066 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 05:59:13,066 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 05:59:13,066 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 05:59:13,066 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 05:59:13,067 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 05:59:03" (3/4) ... [2024-11-19 05:59:13,068 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-19 05:59:13,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-19 05:59:13,070 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-19 05:59:13,071 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread3 [2024-11-19 05:59:13,071 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread4 [2024-11-19 05:59:13,076 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2024-11-19 05:59:13,077 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-19 05:59:13,077 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-19 05:59:13,077 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-19 05:59:13,185 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-19 05:59:13,185 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-19 05:59:13,186 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 05:59:13,186 INFO L158 Benchmark]: Toolchain (without parser) took 11910.81ms. Allocated memory was 184.5MB in the beginning and 1.1GB in the end (delta: 903.9MB). Free memory was 110.8MB in the beginning and 841.4MB in the end (delta: -730.6MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. [2024-11-19 05:59:13,186 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 05:59:13,186 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.45ms. Allocated memory is still 184.5MB. Free memory was 110.5MB in the beginning and 94.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-19 05:59:13,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.08ms. Allocated memory is still 184.5MB. Free memory was 94.4MB in the beginning and 90.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:59:13,187 INFO L158 Benchmark]: Boogie Preprocessor took 72.96ms. Allocated memory is still 184.5MB. Free memory was 90.5MB in the beginning and 87.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 05:59:13,187 INFO L158 Benchmark]: RCFGBuilder took 1321.50ms. Allocated memory was 184.5MB in the beginning and 291.5MB in the end (delta: 107.0MB). Free memory was 87.1MB in the beginning and 92.2MB in the end (delta: -5.1MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. [2024-11-19 05:59:13,187 INFO L158 Benchmark]: TraceAbstraction took 9954.75ms. Allocated memory was 291.5MB in the beginning and 1.1GB in the end (delta: 796.9MB). Free memory was 91.2MB in the beginning and 848.7MB in the end (delta: -757.6MB). Peak memory consumption was 572.0MB. Max. memory is 16.1GB. [2024-11-19 05:59:13,187 INFO L158 Benchmark]: Witness Printer took 119.53ms. Allocated memory is still 1.1GB. Free memory was 848.7MB in the beginning and 841.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-19 05:59:13,189 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.45ms. Allocated memory is still 184.5MB. Free memory was 110.5MB in the beginning and 94.4MB in the end (delta: 16.1MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.08ms. Allocated memory is still 184.5MB. Free memory was 94.4MB in the beginning and 90.5MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.96ms. Allocated memory is still 184.5MB. Free memory was 90.5MB in the beginning and 87.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1321.50ms. Allocated memory was 184.5MB in the beginning and 291.5MB in the end (delta: 107.0MB). Free memory was 87.1MB in the beginning and 92.2MB in the end (delta: -5.1MB). Peak memory consumption was 108.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9954.75ms. Allocated memory was 291.5MB in the beginning and 1.1GB in the end (delta: 796.9MB). Free memory was 91.2MB in the beginning and 848.7MB in the end (delta: -757.6MB). Peak memory consumption was 572.0MB. Max. memory is 16.1GB. * Witness Printer took 119.53ms. Allocated memory is still 1.1GB. Free memory was 848.7MB in the beginning and 841.4MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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: 123]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 124]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 126]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 127]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 128]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 129]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 131]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 132]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 133]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 161]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 134]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 136]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 137]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 149]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 109]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 112]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 525 locations, 169 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: 9.7s, OverallIterations: 22, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 77 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1221 IncrementalHoareTripleChecker+Invalid, 1297 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 77 mSDtfsCounter, 1221 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864occurred in iteration=0, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2754 NumberOfCodeBlocks, 2754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2732 ConstructedInterpolants, 0 QuantifiedInterpolants, 2889 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 95 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-19 05:59:13,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE