./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:17:13,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:17:13,490 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 17:17:13,493 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:17:13,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:17:13,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:17:13,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:17:13,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:17:13,518 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:17:13,518 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:17:13,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:17:13,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:17:13,519 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:17:13,520 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:17:13,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 17:17:13,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 17:17:13,521 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:17:13,521 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 17:17:13,524 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:17:13,524 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 17:17:13,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:17:13,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 17:17:13,525 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 17:17:13,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:17:13,526 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:17:13,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 17:17:13,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 17:17:13,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:17:13,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:17:13,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:17:13,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:17:13,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:13,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:17:13,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:17:13,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 17:17:13,529 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:17:13,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:17:13,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:17:13,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:17:13,530 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:17:13,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:17:13,531 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-clean/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-clean/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 -> 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 [2024-10-11 17:17:13,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:17:13,834 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:17:13,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:17:13,839 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:17:13,840 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:17:13,841 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-10-11 17:17:15,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:17:15,503 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:17:15,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-10-11 17:17:15,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9bc3bcc5/fd45d3ce90534d5da3f2f55a0bac876e/FLAG081890a81 [2024-10-11 17:17:15,529 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c9bc3bcc5/fd45d3ce90534d5da3f2f55a0bac876e [2024-10-11 17:17:15,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:17:15,535 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:17:15,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:15,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:17:15,540 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:17:15,541 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:15,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d0c23dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15, skipping insertion in model container [2024-10-11 17:17:15,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:15,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:17:15,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:15,818 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:17:15,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:17:15,889 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:17:15,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15 WrapperNode [2024-10-11 17:17:15,890 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:17:15,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:15,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:17:15,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:17:15,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:15,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:15,959 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 810 [2024-10-11 17:17:15,959 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:17:15,960 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:17:15,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:17:15,960 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:17:15,971 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:15,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:15,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:15,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:16,024 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:16,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:16,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:16,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:16,047 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:17:16,048 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:17:16,048 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:17:16,048 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:17:16,049 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (1/1) ... [2024-10-11 17:17:16,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:17:16,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:17:16,091 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:17:16,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:17:16,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 17:17:16,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-11 17:17:16,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-11 17:17:16,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-11 17:17:16,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-11 17:17:16,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-11 17:17:16,147 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-11 17:17:16,147 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-11 17:17:16,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-11 17:17:16,148 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-11 17:17:16,148 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-11 17:17:16,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 17:17:16,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-11 17:17:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-11 17:17:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 17:17:16,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:17:16,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:17:16,152 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 17:17:16,309 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:17:16,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:17:17,492 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 17:17:17,492 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:17:18,343 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:17:18,343 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-11 17:17:18,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:18 BoogieIcfgContainer [2024-10-11 17:17:18,344 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:17:18,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:17:18,346 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:17:18,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:17:18,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:17:15" (1/3) ... [2024-10-11 17:17:18,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9a2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:18, skipping insertion in model container [2024-10-11 17:17:18,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:17:15" (2/3) ... [2024-10-11 17:17:18,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5db9a2de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:17:18, skipping insertion in model container [2024-10-11 17:17:18,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:17:18" (3/3) ... [2024-10-11 17:17:18,351 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-10-11 17:17:18,367 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:17:18,367 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 127 error locations. [2024-10-11 17:17:18,367 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 17:17:18,590 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-11 17:17:18,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 777 places, 808 transitions, 1637 flow [2024-10-11 17:17:18,914 INFO L124 PetriNetUnfolderBase]: 41/805 cut-off events. [2024-10-11 17:17:18,914 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-11 17:17:18,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 818 conditions, 805 events. 41/805 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1453 event pairs, 0 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 583. Up to 2 conditions per place. [2024-10-11 17:17:18,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 777 places, 808 transitions, 1637 flow [2024-10-11 17:17:18,943 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 758 places, 788 transitions, 1594 flow [2024-10-11 17:17:18,950 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:17:18,958 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;@7a42aaf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:17:18,958 INFO L334 AbstractCegarLoop]: Starting to check reachability of 222 error locations. [2024-10-11 17:17:18,964 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 17:17:18,964 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-10-11 17:17:18,965 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 17:17:18,965 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:18,966 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:18,967 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:18,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:18,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1257042968, now seen corresponding path program 1 times [2024-10-11 17:17:18,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:18,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108738578] [2024-10-11 17:17:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:18,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:19,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:19,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108738578] [2024-10-11 17:17:19,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108738578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:19,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:19,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:19,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716735437] [2024-10-11 17:17:19,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:19,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:19,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:19,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:19,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-11 17:17:19,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 758 places, 788 transitions, 1594 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:19,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:19,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-11 17:17:19,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:19,684 INFO L124 PetriNetUnfolderBase]: 52/968 cut-off events. [2024-10-11 17:17:19,685 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-11 17:17:19,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 968 events. 52/968 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2813 event pairs, 19 based on Foata normal form. 68/874 useless extension candidates. Maximal degree in co-relation 700. Up to 65 conditions per place. [2024-10-11 17:17:19,699 INFO L140 encePairwiseOnDemand]: 728/808 looper letters, 14 selfloop transitions, 2 changer transitions 12/710 dead transitions. [2024-10-11 17:17:19,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 710 transitions, 1470 flow [2024-10-11 17:17:19,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:19,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:19,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2024-10-11 17:17:19,724 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9187293729372937 [2024-10-11 17:17:19,727 INFO L175 Difference]: Start difference. First operand has 758 places, 788 transitions, 1594 flow. Second operand 3 states and 2227 transitions. [2024-10-11 17:17:19,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 710 transitions, 1470 flow [2024-10-11 17:17:19,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1458 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-11 17:17:19,749 INFO L231 Difference]: Finished difference. Result has 702 places, 698 transitions, 1406 flow [2024-10-11 17:17:19,754 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1406, PETRI_PLACES=702, PETRI_TRANSITIONS=698} [2024-10-11 17:17:19,758 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -56 predicate places. [2024-10-11 17:17:19,760 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 698 transitions, 1406 flow [2024-10-11 17:17:19,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:19,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:19,763 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] [2024-10-11 17:17:19,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:17:19,764 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:19,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:19,765 INFO L85 PathProgramCache]: Analyzing trace with hash 140907687, now seen corresponding path program 1 times [2024-10-11 17:17:19,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:19,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835869901] [2024-10-11 17:17:19,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:19,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:19,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835869901] [2024-10-11 17:17:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835869901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:19,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:19,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:19,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852886465] [2024-10-11 17:17:19,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:19,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:19,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:19,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:19,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:19,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 808 [2024-10-11 17:17:19,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 698 transitions, 1406 flow. Second operand has 3 states, 3 states have (on average 707.3333333333334) internal successors, (2122), 3 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:19,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:19,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 808 [2024-10-11 17:17:19,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:20,151 INFO L124 PetriNetUnfolderBase]: 92/1019 cut-off events. [2024-10-11 17:17:20,151 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:17:20,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 1019 events. 92/1019 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3316 event pairs, 51 based on Foata normal form. 0/862 useless extension candidates. Maximal degree in co-relation 1144. Up to 134 conditions per place. [2024-10-11 17:17:20,166 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 19 selfloop transitions, 2 changer transitions 0/697 dead transitions. [2024-10-11 17:17:20,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 697 transitions, 1446 flow [2024-10-11 17:17:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:20,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2024-10-11 17:17:20,171 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828382838283828 [2024-10-11 17:17:20,171 INFO L175 Difference]: Start difference. First operand has 702 places, 698 transitions, 1406 flow. Second operand 3 states and 2140 transitions. [2024-10-11 17:17:20,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 697 transitions, 1446 flow [2024-10-11 17:17:20,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 697 transitions, 1442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:20,183 INFO L231 Difference]: Finished difference. Result has 689 places, 697 transitions, 1404 flow [2024-10-11 17:17:20,185 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1400, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1404, PETRI_PLACES=689, PETRI_TRANSITIONS=697} [2024-10-11 17:17:20,186 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -69 predicate places. [2024-10-11 17:17:20,186 INFO L471 AbstractCegarLoop]: Abstraction has has 689 places, 697 transitions, 1404 flow [2024-10-11 17:17:20,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 707.3333333333334) internal successors, (2122), 3 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:20,188 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:20,188 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] [2024-10-11 17:17:20,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:17:20,189 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:20,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:20,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1934330703, now seen corresponding path program 1 times [2024-10-11 17:17:20,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:20,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151351433] [2024-10-11 17:17:20,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:20,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:20,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:20,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:20,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:20,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151351433] [2024-10-11 17:17:20,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151351433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:20,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:20,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:20,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966043075] [2024-10-11 17:17:20,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:20,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:20,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:20,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:20,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:20,322 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 704 out of 808 [2024-10-11 17:17:20,325 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 697 transitions, 1404 flow. Second operand has 3 states, 3 states have (on average 705.0) internal successors, (2115), 3 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:20,325 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:20,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 704 of 808 [2024-10-11 17:17:20,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:20,665 INFO L124 PetriNetUnfolderBase]: 124/1107 cut-off events. [2024-10-11 17:17:20,666 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-11 17:17:20,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 1107 events. 124/1107 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3972 event pairs, 67 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1286. Up to 167 conditions per place. [2024-10-11 17:17:20,688 INFO L140 encePairwiseOnDemand]: 801/808 looper letters, 23 selfloop transitions, 3 changer transitions 0/698 dead transitions. [2024-10-11 17:17:20,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 698 transitions, 1460 flow [2024-10-11 17:17:20,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:20,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:20,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2024-10-11 17:17:20,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8836633663366337 [2024-10-11 17:17:20,694 INFO L175 Difference]: Start difference. First operand has 689 places, 697 transitions, 1404 flow. Second operand 3 states and 2142 transitions. [2024-10-11 17:17:20,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 698 transitions, 1460 flow [2024-10-11 17:17:20,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 698 transitions, 1456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:20,712 INFO L231 Difference]: Finished difference. Result has 685 places, 693 transitions, 1398 flow [2024-10-11 17:17:20,713 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=685, PETRI_TRANSITIONS=693} [2024-10-11 17:17:20,714 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -73 predicate places. [2024-10-11 17:17:20,714 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 693 transitions, 1398 flow [2024-10-11 17:17:20,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 705.0) internal successors, (2115), 3 states have internal predecessors, (2115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:20,716 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:20,716 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] [2024-10-11 17:17:20,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:17:20,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:20,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2081418111, now seen corresponding path program 1 times [2024-10-11 17:17:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575567964] [2024-10-11 17:17:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:20,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:20,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575567964] [2024-10-11 17:17:20,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575567964] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:20,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:20,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:20,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119926549] [2024-10-11 17:17:20,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:20,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:20,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:20,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:20,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:20,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 701 out of 808 [2024-10-11 17:17:20,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 693 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 702.3333333333334) internal successors, (2107), 3 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:20,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:20,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 701 of 808 [2024-10-11 17:17:20,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:21,340 INFO L124 PetriNetUnfolderBase]: 342/1908 cut-off events. [2024-10-11 17:17:21,340 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-10-11 17:17:21,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2452 conditions, 1908 events. 342/1908 cut-off events. For 104/104 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9449 event pairs, 199 based on Foata normal form. 0/1557 useless extension candidates. Maximal degree in co-relation 1779. Up to 475 conditions per place. [2024-10-11 17:17:21,358 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 24 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2024-10-11 17:17:21,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 692 transitions, 1448 flow [2024-10-11 17:17:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:21,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:21,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2130 transitions. [2024-10-11 17:17:21,362 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8787128712871287 [2024-10-11 17:17:21,363 INFO L175 Difference]: Start difference. First operand has 685 places, 693 transitions, 1398 flow. Second operand 3 states and 2130 transitions. [2024-10-11 17:17:21,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 692 transitions, 1448 flow [2024-10-11 17:17:21,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 692 transitions, 1442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:21,374 INFO L231 Difference]: Finished difference. Result has 684 places, 692 transitions, 1394 flow [2024-10-11 17:17:21,375 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=684, PETRI_TRANSITIONS=692} [2024-10-11 17:17:21,376 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -74 predicate places. [2024-10-11 17:17:21,376 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 692 transitions, 1394 flow [2024-10-11 17:17:21,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.3333333333334) internal successors, (2107), 3 states have internal predecessors, (2107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:21,378 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:21,378 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:21,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:17:21,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:21,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:21,379 INFO L85 PathProgramCache]: Analyzing trace with hash 37568012, now seen corresponding path program 1 times [2024-10-11 17:17:21,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:21,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82058573] [2024-10-11 17:17:21,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:21,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:21,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:21,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:21,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82058573] [2024-10-11 17:17:21,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82058573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:21,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:21,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:21,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017540419] [2024-10-11 17:17:21,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:21,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:21,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:21,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:21,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:21,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-11 17:17:21,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 692 transitions, 1394 flow. Second operand has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:21,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:21,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-11 17:17:21,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:21,650 INFO L124 PetriNetUnfolderBase]: 52/937 cut-off events. [2024-10-11 17:17:21,650 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-11 17:17:21,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1022 conditions, 937 events. 52/937 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2667 event pairs, 19 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 964. Up to 67 conditions per place. [2024-10-11 17:17:21,663 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2024-10-11 17:17:21,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 691 transitions, 1428 flow [2024-10-11 17:17:21,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-11 17:17:21,668 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-11 17:17:21,668 INFO L175 Difference]: Start difference. First operand has 684 places, 692 transitions, 1394 flow. Second operand 3 states and 2146 transitions. [2024-10-11 17:17:21,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 691 transitions, 1428 flow [2024-10-11 17:17:21,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 691 transitions, 1424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:21,678 INFO L231 Difference]: Finished difference. Result has 683 places, 691 transitions, 1392 flow [2024-10-11 17:17:21,679 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1392, PETRI_PLACES=683, PETRI_TRANSITIONS=691} [2024-10-11 17:17:21,680 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -75 predicate places. [2024-10-11 17:17:21,680 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 691 transitions, 1392 flow [2024-10-11 17:17:21,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:21,682 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:21,682 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:21,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:17:21,684 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:21,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:21,685 INFO L85 PathProgramCache]: Analyzing trace with hash 177217485, now seen corresponding path program 1 times [2024-10-11 17:17:21,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:21,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759388037] [2024-10-11 17:17:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:21,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:21,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:21,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759388037] [2024-10-11 17:17:21,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759388037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:21,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:21,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:21,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645019530] [2024-10-11 17:17:21,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:21,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:21,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:21,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:21,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:21,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-11 17:17:21,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 691 transitions, 1392 flow. Second operand has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:21,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:21,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-11 17:17:21,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:22,075 INFO L124 PetriNetUnfolderBase]: 83/1715 cut-off events. [2024-10-11 17:17:22,075 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-11 17:17:22,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1822 conditions, 1715 events. 83/1715 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7225 event pairs, 15 based on Foata normal form. 0/1419 useless extension candidates. Maximal degree in co-relation 1756. Up to 47 conditions per place. [2024-10-11 17:17:22,095 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 21 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2024-10-11 17:17:22,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 697 transitions, 1456 flow [2024-10-11 17:17:22,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:22,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:22,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2159 transitions. [2024-10-11 17:17:22,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8906765676567657 [2024-10-11 17:17:22,101 INFO L175 Difference]: Start difference. First operand has 683 places, 691 transitions, 1392 flow. Second operand 3 states and 2159 transitions. [2024-10-11 17:17:22,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 697 transitions, 1456 flow [2024-10-11 17:17:22,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 697 transitions, 1452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:22,112 INFO L231 Difference]: Finished difference. Result has 683 places, 691 transitions, 1404 flow [2024-10-11 17:17:22,113 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1404, PETRI_PLACES=683, PETRI_TRANSITIONS=691} [2024-10-11 17:17:22,114 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -75 predicate places. [2024-10-11 17:17:22,114 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 691 transitions, 1404 flow [2024-10-11 17:17:22,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:22,116 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:22,116 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:22,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:17:22,116 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:22,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:22,117 INFO L85 PathProgramCache]: Analyzing trace with hash 125491133, now seen corresponding path program 1 times [2024-10-11 17:17:22,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:22,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641352672] [2024-10-11 17:17:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:22,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641352672] [2024-10-11 17:17:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641352672] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960752517] [2024-10-11 17:17:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:22,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:22,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:22,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 808 [2024-10-11 17:17:22,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 691 transitions, 1404 flow. Second operand has 3 states, 3 states have (on average 707.3333333333334) internal successors, (2122), 3 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:22,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:22,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 808 [2024-10-11 17:17:22,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:22,490 INFO L124 PetriNetUnfolderBase]: 220/1479 cut-off events. [2024-10-11 17:17:22,490 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-10-11 17:17:22,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1883 conditions, 1479 events. 220/1479 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6880 event pairs, 131 based on Foata normal form. 0/1228 useless extension candidates. Maximal degree in co-relation 1270. Up to 310 conditions per place. [2024-10-11 17:17:22,506 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 20 selfloop transitions, 2 changer transitions 0/690 dead transitions. [2024-10-11 17:17:22,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 690 transitions, 1446 flow [2024-10-11 17:17:22,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2024-10-11 17:17:22,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828382838283828 [2024-10-11 17:17:22,511 INFO L175 Difference]: Start difference. First operand has 683 places, 691 transitions, 1404 flow. Second operand 3 states and 2140 transitions. [2024-10-11 17:17:22,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 690 transitions, 1446 flow [2024-10-11 17:17:22,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 690 transitions, 1440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:22,522 INFO L231 Difference]: Finished difference. Result has 682 places, 690 transitions, 1400 flow [2024-10-11 17:17:22,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1400, PETRI_PLACES=682, PETRI_TRANSITIONS=690} [2024-10-11 17:17:22,524 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -76 predicate places. [2024-10-11 17:17:22,524 INFO L471 AbstractCegarLoop]: Abstraction has has 682 places, 690 transitions, 1400 flow [2024-10-11 17:17:22,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 707.3333333333334) internal successors, (2122), 3 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:22,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:22,526 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] [2024-10-11 17:17:22,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:17:22,527 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:22,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:22,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1661568552, now seen corresponding path program 1 times [2024-10-11 17:17:22,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:22,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585503243] [2024-10-11 17:17:22,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:22,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:22,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:22,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:22,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585503243] [2024-10-11 17:17:22,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585503243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:22,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:22,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:22,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954498063] [2024-10-11 17:17:22,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:22,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:22,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:22,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:22,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:22,577 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 808 [2024-10-11 17:17:22,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 682 places, 690 transitions, 1400 flow. Second operand has 3 states, 3 states have (on average 711.3333333333334) internal successors, (2134), 3 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:22,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:22,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 808 [2024-10-11 17:17:22,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:22,823 INFO L124 PetriNetUnfolderBase]: 64/982 cut-off events. [2024-10-11 17:17:22,823 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 17:17:22,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1107 conditions, 982 events. 64/982 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3079 event pairs, 27 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 1032. Up to 86 conditions per place. [2024-10-11 17:17:22,838 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 2 changer transitions 0/689 dead transitions. [2024-10-11 17:17:22,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 689 transitions, 1434 flow [2024-10-11 17:17:22,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:22,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2148 transitions. [2024-10-11 17:17:22,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861386138613861 [2024-10-11 17:17:22,844 INFO L175 Difference]: Start difference. First operand has 682 places, 690 transitions, 1400 flow. Second operand 3 states and 2148 transitions. [2024-10-11 17:17:22,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 689 transitions, 1434 flow [2024-10-11 17:17:22,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 689 transitions, 1430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:22,856 INFO L231 Difference]: Finished difference. Result has 681 places, 689 transitions, 1398 flow [2024-10-11 17:17:22,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1394, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=681, PETRI_TRANSITIONS=689} [2024-10-11 17:17:22,858 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -77 predicate places. [2024-10-11 17:17:22,858 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 689 transitions, 1398 flow [2024-10-11 17:17:22,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.3333333333334) internal successors, (2134), 3 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:22,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:22,860 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] [2024-10-11 17:17:22,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:17:22,861 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:22,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:22,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1431674143, now seen corresponding path program 1 times [2024-10-11 17:17:22,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:22,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624029070] [2024-10-11 17:17:22,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:22,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:22,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:22,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:22,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624029070] [2024-10-11 17:17:22,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624029070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:22,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:22,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:22,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318062699] [2024-10-11 17:17:22,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:22,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:22,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:22,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:22,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:22,949 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-11 17:17:22,952 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 681 places, 689 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:22,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:22,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-11 17:17:22,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:23,167 INFO L124 PetriNetUnfolderBase]: 103/1105 cut-off events. [2024-10-11 17:17:23,168 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-11 17:17:23,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1294 conditions, 1105 events. 103/1105 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 4156 event pairs, 53 based on Foata normal form. 0/936 useless extension candidates. Maximal degree in co-relation 1211. Up to 142 conditions per place. [2024-10-11 17:17:23,179 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/688 dead transitions. [2024-10-11 17:17:23,180 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 688 transitions, 1434 flow [2024-10-11 17:17:23,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:23,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:23,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-11 17:17:23,184 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-11 17:17:23,184 INFO L175 Difference]: Start difference. First operand has 681 places, 689 transitions, 1398 flow. Second operand 3 states and 2146 transitions. [2024-10-11 17:17:23,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 688 transitions, 1434 flow [2024-10-11 17:17:23,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 688 transitions, 1430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:23,194 INFO L231 Difference]: Finished difference. Result has 680 places, 688 transitions, 1396 flow [2024-10-11 17:17:23,195 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1392, PETRI_DIFFERENCE_MINUEND_PLACES=678, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1396, PETRI_PLACES=680, PETRI_TRANSITIONS=688} [2024-10-11 17:17:23,196 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -78 predicate places. [2024-10-11 17:17:23,196 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 688 transitions, 1396 flow [2024-10-11 17:17:23,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,197 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:23,198 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] [2024-10-11 17:17:23,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:17:23,198 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:23,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:23,198 INFO L85 PathProgramCache]: Analyzing trace with hash -569978944, now seen corresponding path program 1 times [2024-10-11 17:17:23,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:23,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368124527] [2024-10-11 17:17:23,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:23,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:23,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:23,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:23,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:23,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368124527] [2024-10-11 17:17:23,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [368124527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:23,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:23,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:23,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146128886] [2024-10-11 17:17:23,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:23,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:23,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:23,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:23,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:23,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 707 out of 808 [2024-10-11 17:17:23,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 688 transitions, 1396 flow. Second operand has 3 states, 3 states have (on average 708.3333333333334) internal successors, (2125), 3 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:23,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 707 of 808 [2024-10-11 17:17:23,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:23,515 INFO L124 PetriNetUnfolderBase]: 124/1152 cut-off events. [2024-10-11 17:17:23,515 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 17:17:23,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1152 events. 124/1152 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4324 event pairs, 71 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1296. Up to 177 conditions per place. [2024-10-11 17:17:23,530 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 19 selfloop transitions, 2 changer transitions 0/687 dead transitions. [2024-10-11 17:17:23,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 687 transitions, 1436 flow [2024-10-11 17:17:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:23,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2024-10-11 17:17:23,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8836633663366337 [2024-10-11 17:17:23,535 INFO L175 Difference]: Start difference. First operand has 680 places, 688 transitions, 1396 flow. Second operand 3 states and 2142 transitions. [2024-10-11 17:17:23,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 687 transitions, 1436 flow [2024-10-11 17:17:23,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 687 transitions, 1432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:23,545 INFO L231 Difference]: Finished difference. Result has 679 places, 687 transitions, 1394 flow [2024-10-11 17:17:23,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1390, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=679, PETRI_TRANSITIONS=687} [2024-10-11 17:17:23,546 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -79 predicate places. [2024-10-11 17:17:23,547 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 687 transitions, 1394 flow [2024-10-11 17:17:23,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 708.3333333333334) internal successors, (2125), 3 states have internal predecessors, (2125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:23,548 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] [2024-10-11 17:17:23,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:17:23,549 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:23,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:23,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1912345871, now seen corresponding path program 1 times [2024-10-11 17:17:23,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:23,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527234170] [2024-10-11 17:17:23,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:23,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:23,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:23,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:23,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:23,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527234170] [2024-10-11 17:17:23,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527234170] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:23,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:23,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837437878] [2024-10-11 17:17:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:23,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:23,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:23,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:23,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:23,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 808 [2024-10-11 17:17:23,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 687 transitions, 1394 flow. Second operand has 3 states, 3 states have (on average 707.3333333333334) internal successors, (2122), 3 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:23,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 808 [2024-10-11 17:17:23,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:23,859 INFO L124 PetriNetUnfolderBase]: 103/1103 cut-off events. [2024-10-11 17:17:23,860 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-11 17:17:23,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1295 conditions, 1103 events. 103/1103 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4132 event pairs, 53 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1196. Up to 145 conditions per place. [2024-10-11 17:17:23,871 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 20 selfloop transitions, 2 changer transitions 0/686 dead transitions. [2024-10-11 17:17:23,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 686 transitions, 1436 flow [2024-10-11 17:17:23,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:23,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2024-10-11 17:17:23,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828382838283828 [2024-10-11 17:17:23,876 INFO L175 Difference]: Start difference. First operand has 679 places, 687 transitions, 1394 flow. Second operand 3 states and 2140 transitions. [2024-10-11 17:17:23,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 686 transitions, 1436 flow [2024-10-11 17:17:23,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 686 transitions, 1432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:23,886 INFO L231 Difference]: Finished difference. Result has 678 places, 686 transitions, 1392 flow [2024-10-11 17:17:23,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1392, PETRI_PLACES=678, PETRI_TRANSITIONS=686} [2024-10-11 17:17:23,888 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -80 predicate places. [2024-10-11 17:17:23,888 INFO L471 AbstractCegarLoop]: Abstraction has has 678 places, 686 transitions, 1392 flow [2024-10-11 17:17:23,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 707.3333333333334) internal successors, (2122), 3 states have internal predecessors, (2122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:23,892 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] [2024-10-11 17:17:23,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:17:23,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:23,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:23,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1515342057, now seen corresponding path program 1 times [2024-10-11 17:17:23,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:23,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984817072] [2024-10-11 17:17:23,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:23,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:23,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:23,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:23,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984817072] [2024-10-11 17:17:23,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984817072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:23,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:23,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:23,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897816239] [2024-10-11 17:17:23,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:23,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:23,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:23,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:23,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-11 17:17:23,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 678 places, 686 transitions, 1392 flow. Second operand has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:23,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:23,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-11 17:17:23,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:24,189 INFO L124 PetriNetUnfolderBase]: 103/1102 cut-off events. [2024-10-11 17:17:24,189 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-11 17:17:24,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 1102 events. 103/1102 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4002 event pairs, 53 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1184. Up to 142 conditions per place. [2024-10-11 17:17:24,202 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/685 dead transitions. [2024-10-11 17:17:24,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 685 transitions, 1428 flow [2024-10-11 17:17:24,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:24,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-11 17:17:24,206 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-11 17:17:24,207 INFO L175 Difference]: Start difference. First operand has 678 places, 686 transitions, 1392 flow. Second operand 3 states and 2146 transitions. [2024-10-11 17:17:24,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 685 transitions, 1428 flow [2024-10-11 17:17:24,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 685 transitions, 1424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:24,216 INFO L231 Difference]: Finished difference. Result has 677 places, 685 transitions, 1390 flow [2024-10-11 17:17:24,217 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=675, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1390, PETRI_PLACES=677, PETRI_TRANSITIONS=685} [2024-10-11 17:17:24,217 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -81 predicate places. [2024-10-11 17:17:24,217 INFO L471 AbstractCegarLoop]: Abstraction has has 677 places, 685 transitions, 1390 flow [2024-10-11 17:17:24,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:24,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:24,219 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] [2024-10-11 17:17:24,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:17:24,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:24,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:24,220 INFO L85 PathProgramCache]: Analyzing trace with hash 533166846, now seen corresponding path program 1 times [2024-10-11 17:17:24,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:24,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002499015] [2024-10-11 17:17:24,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:24,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:24,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002499015] [2024-10-11 17:17:24,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002499015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:24,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:24,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075801385] [2024-10-11 17:17:24,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:24,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:24,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-11 17:17:24,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 677 places, 685 transitions, 1390 flow. Second operand has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:24,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:24,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-11 17:17:24,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:25,080 INFO L124 PetriNetUnfolderBase]: 228/4387 cut-off events. [2024-10-11 17:17:25,080 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-11 17:17:25,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4656 conditions, 4387 events. 228/4387 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 31942 event pairs, 79 based on Foata normal form. 0/3519 useless extension candidates. Maximal degree in co-relation 4541. Up to 214 conditions per place. [2024-10-11 17:17:25,114 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 1 changer transitions 0/683 dead transitions. [2024-10-11 17:17:25,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 683 transitions, 1420 flow [2024-10-11 17:17:25,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:25,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2151 transitions. [2024-10-11 17:17:25,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873762376237624 [2024-10-11 17:17:25,120 INFO L175 Difference]: Start difference. First operand has 677 places, 685 transitions, 1390 flow. Second operand 3 states and 2151 transitions. [2024-10-11 17:17:25,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 683 transitions, 1420 flow [2024-10-11 17:17:25,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 683 transitions, 1416 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:25,133 INFO L231 Difference]: Finished difference. Result has 675 places, 683 transitions, 1384 flow [2024-10-11 17:17:25,135 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=673, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1384, PETRI_PLACES=675, PETRI_TRANSITIONS=683} [2024-10-11 17:17:25,136 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -83 predicate places. [2024-10-11 17:17:25,136 INFO L471 AbstractCegarLoop]: Abstraction has has 675 places, 683 transitions, 1384 flow [2024-10-11 17:17:25,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:25,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:25,138 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] [2024-10-11 17:17:25,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:17:25,138 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:25,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:25,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1110974690, now seen corresponding path program 1 times [2024-10-11 17:17:25,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:25,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525652997] [2024-10-11 17:17:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:25,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:25,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:25,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525652997] [2024-10-11 17:17:25,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525652997] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:25,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:25,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:25,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499198863] [2024-10-11 17:17:25,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:25,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:25,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:25,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:25,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:26,269 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 808 [2024-10-11 17:17:26,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 683 transitions, 1384 flow. Second operand has 6 states, 6 states have (on average 629.5) internal successors, (3777), 6 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:26,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:26,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 808 [2024-10-11 17:17:26,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:28,271 INFO L124 PetriNetUnfolderBase]: 2034/9305 cut-off events. [2024-10-11 17:17:28,272 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-10-11 17:17:28,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12639 conditions, 9305 events. 2034/9305 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 80814 event pairs, 1421 based on Foata normal form. 0/7705 useless extension candidates. Maximal degree in co-relation 12525. Up to 2842 conditions per place. [2024-10-11 17:17:28,344 INFO L140 encePairwiseOnDemand]: 784/808 looper letters, 78 selfloop transitions, 20 changer transitions 0/679 dead transitions. [2024-10-11 17:17:28,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 679 transitions, 1572 flow [2024-10-11 17:17:28,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3869 transitions. [2024-10-11 17:17:28,353 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7980610561056105 [2024-10-11 17:17:28,353 INFO L175 Difference]: Start difference. First operand has 675 places, 683 transitions, 1384 flow. Second operand 6 states and 3869 transitions. [2024-10-11 17:17:28,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 679 transitions, 1572 flow [2024-10-11 17:17:28,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 679 transitions, 1571 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:28,365 INFO L231 Difference]: Finished difference. Result has 675 places, 679 transitions, 1415 flow [2024-10-11 17:17:28,366 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1375, PETRI_DIFFERENCE_MINUEND_PLACES=670, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=659, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1415, PETRI_PLACES=675, PETRI_TRANSITIONS=679} [2024-10-11 17:17:28,366 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -83 predicate places. [2024-10-11 17:17:28,366 INFO L471 AbstractCegarLoop]: Abstraction has has 675 places, 679 transitions, 1415 flow [2024-10-11 17:17:28,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 629.5) internal successors, (3777), 6 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:28,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:28,369 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] [2024-10-11 17:17:28,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 17:17:28,369 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:28,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:28,370 INFO L85 PathProgramCache]: Analyzing trace with hash -801660191, now seen corresponding path program 1 times [2024-10-11 17:17:28,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:28,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125760945] [2024-10-11 17:17:28,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:28,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:28,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:28,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:28,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:28,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125760945] [2024-10-11 17:17:28,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125760945] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:28,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:28,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:28,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877826982] [2024-10-11 17:17:28,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:28,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:28,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:28,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:28,456 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-11 17:17:28,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 675 places, 679 transitions, 1415 flow. Second operand has 3 states, 3 states have (on average 709.3333333333334) internal successors, (2128), 3 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:28,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:28,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-11 17:17:28,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:28,861 INFO L124 PetriNetUnfolderBase]: 181/1343 cut-off events. [2024-10-11 17:17:28,861 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-11 17:17:28,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1678 conditions, 1343 events. 181/1343 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5950 event pairs, 105 based on Foata normal form. 0/1122 useless extension candidates. Maximal degree in co-relation 1614. Up to 253 conditions per place. [2024-10-11 17:17:28,873 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 18 selfloop transitions, 2 changer transitions 0/678 dead transitions. [2024-10-11 17:17:28,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 678 transitions, 1453 flow [2024-10-11 17:17:28,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:28,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:28,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2144 transitions. [2024-10-11 17:17:28,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8844884488448845 [2024-10-11 17:17:28,877 INFO L175 Difference]: Start difference. First operand has 675 places, 679 transitions, 1415 flow. Second operand 3 states and 2144 transitions. [2024-10-11 17:17:28,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 678 transitions, 1453 flow [2024-10-11 17:17:28,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 678 transitions, 1413 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:28,887 INFO L231 Difference]: Finished difference. Result has 671 places, 678 transitions, 1377 flow [2024-10-11 17:17:28,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1373, PETRI_DIFFERENCE_MINUEND_PLACES=669, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1377, PETRI_PLACES=671, PETRI_TRANSITIONS=678} [2024-10-11 17:17:28,889 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -87 predicate places. [2024-10-11 17:17:28,889 INFO L471 AbstractCegarLoop]: Abstraction has has 671 places, 678 transitions, 1377 flow [2024-10-11 17:17:28,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 709.3333333333334) internal successors, (2128), 3 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:28,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:28,890 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] [2024-10-11 17:17:28,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 17:17:28,890 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:28,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash -666293938, now seen corresponding path program 1 times [2024-10-11 17:17:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660728994] [2024-10-11 17:17:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:28,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:28,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:28,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660728994] [2024-10-11 17:17:28,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660728994] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:28,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:28,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:28,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998390483] [2024-10-11 17:17:28,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:28,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:28,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:28,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:28,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:28,958 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 705 out of 808 [2024-10-11 17:17:28,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 671 places, 678 transitions, 1377 flow. Second operand has 3 states, 3 states have (on average 706.0) internal successors, (2118), 3 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:28,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:28,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 705 of 808 [2024-10-11 17:17:28,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:30,177 INFO L124 PetriNetUnfolderBase]: 336/6174 cut-off events. [2024-10-11 17:17:30,177 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-11 17:17:30,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6582 conditions, 6174 events. 336/6174 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 50887 event pairs, 129 based on Foata normal form. 0/4959 useless extension candidates. Maximal degree in co-relation 6467. Up to 326 conditions per place. [2024-10-11 17:17:30,220 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 20 selfloop transitions, 1 changer transitions 0/674 dead transitions. [2024-10-11 17:17:30,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 674 transitions, 1411 flow [2024-10-11 17:17:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2139 transitions. [2024-10-11 17:17:30,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8824257425742574 [2024-10-11 17:17:30,225 INFO L175 Difference]: Start difference. First operand has 671 places, 678 transitions, 1377 flow. Second operand 3 states and 2139 transitions. [2024-10-11 17:17:30,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 674 transitions, 1411 flow [2024-10-11 17:17:30,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 674 transitions, 1407 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:30,234 INFO L231 Difference]: Finished difference. Result has 667 places, 674 transitions, 1367 flow [2024-10-11 17:17:30,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1365, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1367, PETRI_PLACES=667, PETRI_TRANSITIONS=674} [2024-10-11 17:17:30,235 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -91 predicate places. [2024-10-11 17:17:30,235 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 674 transitions, 1367 flow [2024-10-11 17:17:30,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 706.0) internal successors, (2118), 3 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:30,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:30,236 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] [2024-10-11 17:17:30,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 17:17:30,236 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:30,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:30,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1310710705, now seen corresponding path program 1 times [2024-10-11 17:17:30,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:30,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454254024] [2024-10-11 17:17:30,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:30,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:30,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:30,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454254024] [2024-10-11 17:17:30,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454254024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:30,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:30,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:30,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737660081] [2024-10-11 17:17:30,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:30,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:30,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:30,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:30,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:30,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-11 17:17:30,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 674 transitions, 1367 flow. Second operand has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:30,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:30,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-11 17:17:30,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:30,503 INFO L124 PetriNetUnfolderBase]: 124/1133 cut-off events. [2024-10-11 17:17:30,503 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-11 17:17:30,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 1133 events. 124/1133 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4213 event pairs, 71 based on Foata normal form. 0/964 useless extension candidates. Maximal degree in co-relation 1251. Up to 175 conditions per place. [2024-10-11 17:17:30,516 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2024-10-11 17:17:30,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 673 transitions, 1403 flow [2024-10-11 17:17:30,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:30,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-11 17:17:30,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-11 17:17:30,521 INFO L175 Difference]: Start difference. First operand has 667 places, 674 transitions, 1367 flow. Second operand 3 states and 2146 transitions. [2024-10-11 17:17:30,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 673 transitions, 1403 flow [2024-10-11 17:17:30,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 673 transitions, 1402 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:30,530 INFO L231 Difference]: Finished difference. Result has 667 places, 673 transitions, 1368 flow [2024-10-11 17:17:30,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1368, PETRI_PLACES=667, PETRI_TRANSITIONS=673} [2024-10-11 17:17:30,532 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -91 predicate places. [2024-10-11 17:17:30,532 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 673 transitions, 1368 flow [2024-10-11 17:17:30,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:30,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:30,533 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:30,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 17:17:30,533 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:30,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1116503893, now seen corresponding path program 1 times [2024-10-11 17:17:30,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:30,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149891290] [2024-10-11 17:17:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:30,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149891290] [2024-10-11 17:17:30,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149891290] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:30,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:30,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:30,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082558146] [2024-10-11 17:17:30,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:30,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:30,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:30,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:30,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:30,588 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 808 [2024-10-11 17:17:30,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 673 transitions, 1368 flow. Second operand has 3 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:30,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:30,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 808 [2024-10-11 17:17:30,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:30,766 INFO L124 PetriNetUnfolderBase]: 64/961 cut-off events. [2024-10-11 17:17:30,766 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 17:17:30,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 961 events. 64/961 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3012 event pairs, 27 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 970. Up to 83 conditions per place. [2024-10-11 17:17:30,773 INFO L140 encePairwiseOnDemand]: 806/808 looper letters, 14 selfloop transitions, 1 changer transitions 0/672 dead transitions. [2024-10-11 17:17:30,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 672 transitions, 1396 flow [2024-10-11 17:17:30,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:30,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2157 transitions. [2024-10-11 17:17:30,777 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8898514851485149 [2024-10-11 17:17:30,777 INFO L175 Difference]: Start difference. First operand has 667 places, 673 transitions, 1368 flow. Second operand 3 states and 2157 transitions. [2024-10-11 17:17:30,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 672 transitions, 1396 flow [2024-10-11 17:17:30,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 672 transitions, 1392 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:30,786 INFO L231 Difference]: Finished difference. Result has 666 places, 672 transitions, 1364 flow [2024-10-11 17:17:30,787 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1362, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1364, PETRI_PLACES=666, PETRI_TRANSITIONS=672} [2024-10-11 17:17:30,788 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -92 predicate places. [2024-10-11 17:17:30,788 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 672 transitions, 1364 flow [2024-10-11 17:17:30,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 715.0) internal successors, (2145), 3 states have internal predecessors, (2145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:30,789 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:30,789 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] [2024-10-11 17:17:30,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 17:17:30,789 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:30,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:30,790 INFO L85 PathProgramCache]: Analyzing trace with hash -1545101691, now seen corresponding path program 1 times [2024-10-11 17:17:30,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:30,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460754421] [2024-10-11 17:17:30,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:30,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:30,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:30,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:30,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460754421] [2024-10-11 17:17:30,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460754421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:30,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:30,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:30,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376114774] [2024-10-11 17:17:30,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:30,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:30,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:30,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:30,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:30,855 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-11 17:17:30,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 672 transitions, 1364 flow. Second operand has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:30,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:30,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-11 17:17:30,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:31,029 INFO L124 PetriNetUnfolderBase]: 64/960 cut-off events. [2024-10-11 17:17:31,029 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-11 17:17:31,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1085 conditions, 960 events. 64/960 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3004 event pairs, 27 based on Foata normal form. 0/845 useless extension candidates. Maximal degree in co-relation 970. Up to 85 conditions per place. [2024-10-11 17:17:31,041 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 15 selfloop transitions, 2 changer transitions 0/671 dead transitions. [2024-10-11 17:17:31,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 671 transitions, 1396 flow [2024-10-11 17:17:31,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:31,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:31,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2150 transitions. [2024-10-11 17:17:31,045 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.886963696369637 [2024-10-11 17:17:31,045 INFO L175 Difference]: Start difference. First operand has 666 places, 672 transitions, 1364 flow. Second operand 3 states and 2150 transitions. [2024-10-11 17:17:31,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 671 transitions, 1396 flow [2024-10-11 17:17:31,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 671 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:31,054 INFO L231 Difference]: Finished difference. Result has 666 places, 671 transitions, 1365 flow [2024-10-11 17:17:31,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1365, PETRI_PLACES=666, PETRI_TRANSITIONS=671} [2024-10-11 17:17:31,056 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -92 predicate places. [2024-10-11 17:17:31,056 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 671 transitions, 1365 flow [2024-10-11 17:17:31,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 712.3333333333334) internal successors, (2137), 3 states have internal predecessors, (2137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:31,056 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:31,057 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] [2024-10-11 17:17:31,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 17:17:31,057 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:31,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:31,057 INFO L85 PathProgramCache]: Analyzing trace with hash 265964137, now seen corresponding path program 1 times [2024-10-11 17:17:31,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:31,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233885639] [2024-10-11 17:17:31,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:31,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:31,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:31,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233885639] [2024-10-11 17:17:31,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233885639] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:31,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:31,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:31,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266408598] [2024-10-11 17:17:31,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:31,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:31,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:31,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:31,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:31,327 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 808 [2024-10-11 17:17:31,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 671 transitions, 1365 flow. Second operand has 3 states, 3 states have (on average 660.0) internal successors, (1980), 3 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:31,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:31,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 808 [2024-10-11 17:17:31,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:33,148 INFO L124 PetriNetUnfolderBase]: 2034/9258 cut-off events. [2024-10-11 17:17:33,148 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-10-11 17:17:33,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12569 conditions, 9258 events. 2034/9258 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 80216 event pairs, 1421 based on Foata normal form. 0/7705 useless extension candidates. Maximal degree in co-relation 12455. Up to 2833 conditions per place. [2024-10-11 17:17:33,221 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 69 selfloop transitions, 2 changer transitions 0/670 dead transitions. [2024-10-11 17:17:33,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 670 transitions, 1505 flow [2024-10-11 17:17:33,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:33,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:33,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2045 transitions. [2024-10-11 17:17:33,227 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8436468646864687 [2024-10-11 17:17:33,227 INFO L175 Difference]: Start difference. First operand has 666 places, 671 transitions, 1365 flow. Second operand 3 states and 2045 transitions. [2024-10-11 17:17:33,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 670 transitions, 1505 flow [2024-10-11 17:17:33,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 670 transitions, 1501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:33,239 INFO L231 Difference]: Finished difference. Result has 665 places, 670 transitions, 1363 flow [2024-10-11 17:17:33,240 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1359, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1363, PETRI_PLACES=665, PETRI_TRANSITIONS=670} [2024-10-11 17:17:33,240 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -93 predicate places. [2024-10-11 17:17:33,240 INFO L471 AbstractCegarLoop]: Abstraction has has 665 places, 670 transitions, 1363 flow [2024-10-11 17:17:33,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.0) internal successors, (1980), 3 states have internal predecessors, (1980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:33,241 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:33,241 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] [2024-10-11 17:17:33,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 17:17:33,242 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:33,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:33,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1153325754, now seen corresponding path program 1 times [2024-10-11 17:17:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:33,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501097189] [2024-10-11 17:17:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:33,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:33,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:33,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501097189] [2024-10-11 17:17:33,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501097189] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:33,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:33,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:33,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933361244] [2024-10-11 17:17:33,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:33,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:33,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:33,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:33,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:33,326 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 808 [2024-10-11 17:17:33,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 665 places, 670 transitions, 1363 flow. Second operand has 3 states, 3 states have (on average 711.3333333333334) internal successors, (2134), 3 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:33,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:33,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 808 [2024-10-11 17:17:33,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:33,607 INFO L124 PetriNetUnfolderBase]: 103/1081 cut-off events. [2024-10-11 17:17:33,608 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-11 17:17:33,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1272 conditions, 1081 events. 103/1081 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3725 event pairs, 53 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1259. Up to 141 conditions per place. [2024-10-11 17:17:33,621 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 2 changer transitions 0/669 dead transitions. [2024-10-11 17:17:33,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 669 transitions, 1397 flow [2024-10-11 17:17:33,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:33,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2148 transitions. [2024-10-11 17:17:33,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861386138613861 [2024-10-11 17:17:33,627 INFO L175 Difference]: Start difference. First operand has 665 places, 670 transitions, 1363 flow. Second operand 3 states and 2148 transitions. [2024-10-11 17:17:33,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 669 transitions, 1397 flow [2024-10-11 17:17:33,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 669 transitions, 1393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:33,639 INFO L231 Difference]: Finished difference. Result has 664 places, 669 transitions, 1361 flow [2024-10-11 17:17:33,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1357, PETRI_DIFFERENCE_MINUEND_PLACES=662, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1361, PETRI_PLACES=664, PETRI_TRANSITIONS=669} [2024-10-11 17:17:33,640 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -94 predicate places. [2024-10-11 17:17:33,640 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 669 transitions, 1361 flow [2024-10-11 17:17:33,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.3333333333334) internal successors, (2134), 3 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:33,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:33,642 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] [2024-10-11 17:17:33,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 17:17:33,642 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:33,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:33,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1206589921, now seen corresponding path program 1 times [2024-10-11 17:17:33,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:33,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536522793] [2024-10-11 17:17:33,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:33,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:33,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536522793] [2024-10-11 17:17:33,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536522793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:33,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:33,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:33,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526127664] [2024-10-11 17:17:33,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:33,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:33,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:33,735 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 808 [2024-10-11 17:17:33,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 669 transitions, 1361 flow. Second operand has 3 states, 3 states have (on average 703.0) internal successors, (2109), 3 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:33,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:33,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 808 [2024-10-11 17:17:33,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:34,359 INFO L124 PetriNetUnfolderBase]: 228/4329 cut-off events. [2024-10-11 17:17:34,359 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-11 17:17:34,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4607 conditions, 4329 events. 228/4329 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 31900 event pairs, 79 based on Foata normal form. 0/3524 useless extension candidates. Maximal degree in co-relation 4492. Up to 220 conditions per place. [2024-10-11 17:17:34,386 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 22 selfloop transitions, 1 changer transitions 0/664 dead transitions. [2024-10-11 17:17:34,386 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 664 transitions, 1397 flow [2024-10-11 17:17:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:34,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2024-10-11 17:17:34,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.879950495049505 [2024-10-11 17:17:34,391 INFO L175 Difference]: Start difference. First operand has 664 places, 669 transitions, 1361 flow. Second operand 3 states and 2133 transitions. [2024-10-11 17:17:34,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 664 transitions, 1397 flow [2024-10-11 17:17:34,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 664 transitions, 1393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:34,400 INFO L231 Difference]: Finished difference. Result has 659 places, 664 transitions, 1349 flow [2024-10-11 17:17:34,400 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1347, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=663, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1349, PETRI_PLACES=659, PETRI_TRANSITIONS=664} [2024-10-11 17:17:34,401 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -99 predicate places. [2024-10-11 17:17:34,401 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 664 transitions, 1349 flow [2024-10-11 17:17:34,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 703.0) internal successors, (2109), 3 states have internal predecessors, (2109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:34,402 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:34,402 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:34,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 17:17:34,402 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:34,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:34,403 INFO L85 PathProgramCache]: Analyzing trace with hash -628923738, now seen corresponding path program 1 times [2024-10-11 17:17:34,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:34,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758365575] [2024-10-11 17:17:34,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:34,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:34,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:34,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:34,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:34,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758365575] [2024-10-11 17:17:34,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758365575] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:34,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:34,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:34,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139841580] [2024-10-11 17:17:34,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:34,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:34,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:34,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-11 17:17:34,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 664 transitions, 1349 flow. Second operand has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:34,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:34,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-11 17:17:34,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:34,682 INFO L124 PetriNetUnfolderBase]: 103/1075 cut-off events. [2024-10-11 17:17:34,682 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-11 17:17:34,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1266 conditions, 1075 events. 103/1075 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3881 event pairs, 53 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1151. Up to 142 conditions per place. [2024-10-11 17:17:34,693 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/663 dead transitions. [2024-10-11 17:17:34,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 663 transitions, 1385 flow [2024-10-11 17:17:34,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-11 17:17:34,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-11 17:17:34,698 INFO L175 Difference]: Start difference. First operand has 659 places, 664 transitions, 1349 flow. Second operand 3 states and 2146 transitions. [2024-10-11 17:17:34,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 663 transitions, 1385 flow [2024-10-11 17:17:34,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 663 transitions, 1384 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:34,713 INFO L231 Difference]: Finished difference. Result has 659 places, 663 transitions, 1350 flow [2024-10-11 17:17:34,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1346, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1350, PETRI_PLACES=659, PETRI_TRANSITIONS=663} [2024-10-11 17:17:34,714 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -99 predicate places. [2024-10-11 17:17:34,715 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 663 transitions, 1350 flow [2024-10-11 17:17:34,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 710.3333333333334) internal successors, (2131), 3 states have internal predecessors, (2131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:34,715 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:34,716 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:34,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 17:17:34,716 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:34,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:34,716 INFO L85 PathProgramCache]: Analyzing trace with hash -660005856, now seen corresponding path program 1 times [2024-10-11 17:17:34,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:34,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91551195] [2024-10-11 17:17:34,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:34,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:34,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:34,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:34,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91551195] [2024-10-11 17:17:34,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91551195] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:34,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:34,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:34,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931096924] [2024-10-11 17:17:34,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:34,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:34,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:34,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:34,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:34,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-11 17:17:34,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 663 transitions, 1350 flow. Second operand has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:34,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:34,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-11 17:17:34,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:35,409 INFO L124 PetriNetUnfolderBase]: 267/4575 cut-off events. [2024-10-11 17:17:35,409 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-11 17:17:35,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4914 conditions, 4575 events. 267/4575 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 32942 event pairs, 40 based on Foata normal form. 0/3752 useless extension candidates. Maximal degree in co-relation 4800. Up to 227 conditions per place. [2024-10-11 17:17:35,444 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 26 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-10-11 17:17:35,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1436 flow [2024-10-11 17:17:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:35,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2163 transitions. [2024-10-11 17:17:35,449 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8923267326732673 [2024-10-11 17:17:35,449 INFO L175 Difference]: Start difference. First operand has 659 places, 663 transitions, 1350 flow. Second operand 3 states and 2163 transitions. [2024-10-11 17:17:35,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1436 flow [2024-10-11 17:17:35,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:35,459 INFO L231 Difference]: Finished difference. Result has 658 places, 664 transitions, 1365 flow [2024-10-11 17:17:35,459 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=661, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1365, PETRI_PLACES=658, PETRI_TRANSITIONS=664} [2024-10-11 17:17:35,460 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -100 predicate places. [2024-10-11 17:17:35,460 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 664 transitions, 1365 flow [2024-10-11 17:17:35,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,461 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:35,461 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:35,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 17:17:35,462 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:35,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:35,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1389606881, now seen corresponding path program 1 times [2024-10-11 17:17:35,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:35,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912189343] [2024-10-11 17:17:35,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:35,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:35,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:35,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:35,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:35,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912189343] [2024-10-11 17:17:35,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912189343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:35,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:35,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:35,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548655767] [2024-10-11 17:17:35,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:35,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:35,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:35,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:35,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:35,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-11 17:17:35,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 664 transitions, 1365 flow. Second operand has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:35,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:35,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-11 17:17:35,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,244 INFO L124 PetriNetUnfolderBase]: 318/4465 cut-off events. [2024-10-11 17:17:36,244 INFO L125 PetriNetUnfolderBase]: For 183/237 co-relation queries the response was YES. [2024-10-11 17:17:36,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4984 conditions, 4465 events. 318/4465 cut-off events. For 183/237 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 31448 event pairs, 62 based on Foata normal form. 0/3689 useless extension candidates. Maximal degree in co-relation 4869. Up to 294 conditions per place. [2024-10-11 17:17:36,266 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 27 selfloop transitions, 4 changer transitions 0/675 dead transitions. [2024-10-11 17:17:36,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 675 transitions, 1464 flow [2024-10-11 17:17:36,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2163 transitions. [2024-10-11 17:17:36,270 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8923267326732673 [2024-10-11 17:17:36,270 INFO L175 Difference]: Start difference. First operand has 658 places, 664 transitions, 1365 flow. Second operand 3 states and 2163 transitions. [2024-10-11 17:17:36,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 675 transitions, 1464 flow [2024-10-11 17:17:36,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 675 transitions, 1464 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:36,279 INFO L231 Difference]: Finished difference. Result has 659 places, 666 transitions, 1398 flow [2024-10-11 17:17:36,282 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1361, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=662, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1398, PETRI_PLACES=659, PETRI_TRANSITIONS=666} [2024-10-11 17:17:36,282 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -99 predicate places. [2024-10-11 17:17:36,282 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 666 transitions, 1398 flow [2024-10-11 17:17:36,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 712.0) internal successors, (2136), 3 states have internal predecessors, (2136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,283 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,283 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 17:17:36,284 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:36,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1350032944, now seen corresponding path program 1 times [2024-10-11 17:17:36,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516460864] [2024-10-11 17:17:36,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516460864] [2024-10-11 17:17:36,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516460864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538777894] [2024-10-11 17:17:36,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 808 [2024-10-11 17:17:36,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 666 transitions, 1398 flow. Second operand has 3 states, 3 states have (on average 716.0) internal successors, (2148), 3 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 808 [2024-10-11 17:17:36,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:36,772 INFO L124 PetriNetUnfolderBase]: 229/2791 cut-off events. [2024-10-11 17:17:36,772 INFO L125 PetriNetUnfolderBase]: For 419/771 co-relation queries the response was YES. [2024-10-11 17:17:36,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 2791 events. 229/2791 cut-off events. For 419/771 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15370 event pairs, 26 based on Foata normal form. 1/2329 useless extension candidates. Maximal degree in co-relation 3272. Up to 227 conditions per place. [2024-10-11 17:17:36,803 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 23 selfloop transitions, 4 changer transitions 0/675 dead transitions. [2024-10-11 17:17:36,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 675 transitions, 1502 flow [2024-10-11 17:17:36,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:36,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2165 transitions. [2024-10-11 17:17:36,808 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8931518151815182 [2024-10-11 17:17:36,808 INFO L175 Difference]: Start difference. First operand has 659 places, 666 transitions, 1398 flow. Second operand 3 states and 2165 transitions. [2024-10-11 17:17:36,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 675 transitions, 1502 flow [2024-10-11 17:17:36,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 675 transitions, 1502 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:36,816 INFO L231 Difference]: Finished difference. Result has 661 places, 668 transitions, 1420 flow [2024-10-11 17:17:36,817 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1396, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=665, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1420, PETRI_PLACES=661, PETRI_TRANSITIONS=668} [2024-10-11 17:17:36,817 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -97 predicate places. [2024-10-11 17:17:36,817 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 668 transitions, 1420 flow [2024-10-11 17:17:36,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 716.0) internal successors, (2148), 3 states have internal predecessors, (2148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,818 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:36,818 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:36,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 17:17:36,819 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:36,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:36,819 INFO L85 PathProgramCache]: Analyzing trace with hash -466383547, now seen corresponding path program 1 times [2024-10-11 17:17:36,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:36,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056660613] [2024-10-11 17:17:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:36,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:36,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:36,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056660613] [2024-10-11 17:17:36,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056660613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:36,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:36,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:36,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440647902] [2024-10-11 17:17:36,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:36,884 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:36,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:36,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:36,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:36,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 808 [2024-10-11 17:17:36,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 668 transitions, 1420 flow. Second operand has 3 states, 3 states have (on average 715.6666666666666) internal successors, (2147), 3 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:36,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:36,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 808 [2024-10-11 17:17:36,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:37,847 INFO L124 PetriNetUnfolderBase]: 526/7120 cut-off events. [2024-10-11 17:17:37,848 INFO L125 PetriNetUnfolderBase]: For 840/886 co-relation queries the response was YES. [2024-10-11 17:17:37,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8434 conditions, 7120 events. 526/7120 cut-off events. For 840/886 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 61035 event pairs, 82 based on Foata normal form. 0/5890 useless extension candidates. Maximal degree in co-relation 8318. Up to 306 conditions per place. [2024-10-11 17:17:37,898 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 30 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2024-10-11 17:17:37,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 679 transitions, 1544 flow [2024-10-11 17:17:37,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:37,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2164 transitions. [2024-10-11 17:17:37,902 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8927392739273927 [2024-10-11 17:17:37,902 INFO L175 Difference]: Start difference. First operand has 661 places, 668 transitions, 1420 flow. Second operand 3 states and 2164 transitions. [2024-10-11 17:17:37,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 679 transitions, 1544 flow [2024-10-11 17:17:37,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1537 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:37,912 INFO L231 Difference]: Finished difference. Result has 661 places, 667 transitions, 1418 flow [2024-10-11 17:17:37,913 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1414, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=667, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=665, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1418, PETRI_PLACES=661, PETRI_TRANSITIONS=667} [2024-10-11 17:17:37,914 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -97 predicate places. [2024-10-11 17:17:37,914 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 667 transitions, 1418 flow [2024-10-11 17:17:37,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 715.6666666666666) internal successors, (2147), 3 states have internal predecessors, (2147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:37,915 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:37,915 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:37,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 17:17:37,915 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:37,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:37,916 INFO L85 PathProgramCache]: Analyzing trace with hash 189925005, now seen corresponding path program 1 times [2024-10-11 17:17:37,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:37,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615749559] [2024-10-11 17:17:37,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:37,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:37,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:37,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:37,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615749559] [2024-10-11 17:17:37,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615749559] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:37,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:37,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918650902] [2024-10-11 17:17:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:37,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:37,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:37,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:38,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 704 out of 808 [2024-10-11 17:17:38,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 667 transitions, 1418 flow. Second operand has 3 states, 3 states have (on average 706.0) internal successors, (2118), 3 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:38,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:38,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 704 of 808 [2024-10-11 17:17:38,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:39,026 INFO L124 PetriNetUnfolderBase]: 832/7577 cut-off events. [2024-10-11 17:17:39,026 INFO L125 PetriNetUnfolderBase]: For 1312/1380 co-relation queries the response was YES. [2024-10-11 17:17:39,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9711 conditions, 7577 events. 832/7577 cut-off events. For 1312/1380 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 66842 event pairs, 76 based on Foata normal form. 3/6420 useless extension candidates. Maximal degree in co-relation 9593. Up to 744 conditions per place. [2024-10-11 17:17:39,090 INFO L140 encePairwiseOnDemand]: 801/808 looper letters, 34 selfloop transitions, 2 changer transitions 5/675 dead transitions. [2024-10-11 17:17:39,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 675 transitions, 1545 flow [2024-10-11 17:17:39,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:39,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2024-10-11 17:17:39,095 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.884075907590759 [2024-10-11 17:17:39,095 INFO L175 Difference]: Start difference. First operand has 661 places, 667 transitions, 1418 flow. Second operand 3 states and 2143 transitions. [2024-10-11 17:17:39,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 675 transitions, 1545 flow [2024-10-11 17:17:39,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 675 transitions, 1541 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:39,106 INFO L231 Difference]: Finished difference. Result has 657 places, 658 transitions, 1395 flow [2024-10-11 17:17:39,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1406, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=663, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=661, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1395, PETRI_PLACES=657, PETRI_TRANSITIONS=658} [2024-10-11 17:17:39,107 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -101 predicate places. [2024-10-11 17:17:39,107 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 658 transitions, 1395 flow [2024-10-11 17:17:39,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 706.0) internal successors, (2118), 3 states have internal predecessors, (2118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:39,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:39,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 17:17:39,109 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:39,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 51771163, now seen corresponding path program 1 times [2024-10-11 17:17:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:39,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365046717] [2024-10-11 17:17:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:39,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:39,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:39,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365046717] [2024-10-11 17:17:39,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365046717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:39,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:39,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:39,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240769272] [2024-10-11 17:17:39,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:39,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:39,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:39,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:39,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:39,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-11 17:17:39,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 658 transitions, 1395 flow. Second operand has 3 states, 3 states have (on average 712.6666666666666) internal successors, (2138), 3 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:39,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:39,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-11 17:17:39,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:40,744 INFO L124 PetriNetUnfolderBase]: 729/10422 cut-off events. [2024-10-11 17:17:40,745 INFO L125 PetriNetUnfolderBase]: For 1088/1454 co-relation queries the response was YES. [2024-10-11 17:17:40,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12138 conditions, 10422 events. 729/10422 cut-off events. For 1088/1454 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 98312 event pairs, 89 based on Foata normal form. 0/8669 useless extension candidates. Maximal degree in co-relation 12021. Up to 603 conditions per place. [2024-10-11 17:17:40,824 INFO L140 encePairwiseOnDemand]: 804/808 looper letters, 34 selfloop transitions, 2 changer transitions 0/671 dead transitions. [2024-10-11 17:17:40,824 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 671 transitions, 1533 flow [2024-10-11 17:17:40,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:40,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2160 transitions. [2024-10-11 17:17:40,828 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8910891089108911 [2024-10-11 17:17:40,828 INFO L175 Difference]: Start difference. First operand has 657 places, 658 transitions, 1395 flow. Second operand 3 states and 2160 transitions. [2024-10-11 17:17:40,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 671 transitions, 1533 flow [2024-10-11 17:17:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 671 transitions, 1529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:40,840 INFO L231 Difference]: Finished difference. Result has 652 places, 658 transitions, 1401 flow [2024-10-11 17:17:40,841 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1387, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1401, PETRI_PLACES=652, PETRI_TRANSITIONS=658} [2024-10-11 17:17:40,841 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -106 predicate places. [2024-10-11 17:17:40,842 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 658 transitions, 1401 flow [2024-10-11 17:17:40,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 712.6666666666666) internal successors, (2138), 3 states have internal predecessors, (2138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:40,842 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:40,842 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:40,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 17:17:40,843 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:40,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash 286383553, now seen corresponding path program 1 times [2024-10-11 17:17:40,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:40,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365478894] [2024-10-11 17:17:40,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:40,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:41,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:41,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:41,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365478894] [2024-10-11 17:17:41,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365478894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:41,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:41,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:17:41,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853670028] [2024-10-11 17:17:41,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:41,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:17:41,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:41,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:17:41,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:17:41,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 808 [2024-10-11 17:17:41,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 658 transitions, 1401 flow. Second operand has 4 states, 4 states have (on average 711.75) internal successors, (2847), 4 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:41,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:41,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 808 [2024-10-11 17:17:41,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:42,975 INFO L124 PetriNetUnfolderBase]: 668/9477 cut-off events. [2024-10-11 17:17:42,975 INFO L125 PetriNetUnfolderBase]: For 1337/1531 co-relation queries the response was YES. [2024-10-11 17:17:43,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11306 conditions, 9477 events. 668/9477 cut-off events. For 1337/1531 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 85501 event pairs, 86 based on Foata normal form. 14/8019 useless extension candidates. Maximal degree in co-relation 11187. Up to 244 conditions per place. [2024-10-11 17:17:43,069 INFO L140 encePairwiseOnDemand]: 801/808 looper letters, 35 selfloop transitions, 6 changer transitions 0/675 dead transitions. [2024-10-11 17:17:43,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 675 transitions, 1589 flow [2024-10-11 17:17:43,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:17:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 17:17:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2868 transitions. [2024-10-11 17:17:43,073 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873762376237624 [2024-10-11 17:17:43,073 INFO L175 Difference]: Start difference. First operand has 652 places, 658 transitions, 1401 flow. Second operand 4 states and 2868 transitions. [2024-10-11 17:17:43,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 675 transitions, 1589 flow [2024-10-11 17:17:43,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 675 transitions, 1589 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:17:43,084 INFO L231 Difference]: Finished difference. Result has 655 places, 657 transitions, 1411 flow [2024-10-11 17:17:43,084 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1399, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1411, PETRI_PLACES=655, PETRI_TRANSITIONS=657} [2024-10-11 17:17:43,085 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -103 predicate places. [2024-10-11 17:17:43,085 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 657 transitions, 1411 flow [2024-10-11 17:17:43,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 711.75) internal successors, (2847), 4 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:43,086 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:43,086 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:43,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 17:17:43,087 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:43,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:43,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1167074290, now seen corresponding path program 1 times [2024-10-11 17:17:43,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:43,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012087835] [2024-10-11 17:17:43,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:43,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:43,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:43,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:43,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012087835] [2024-10-11 17:17:43,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012087835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:43,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:43,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:43,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065950142] [2024-10-11 17:17:43,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:43,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:43,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:43,215 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 808 [2024-10-11 17:17:43,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 657 transitions, 1411 flow. Second operand has 3 states, 3 states have (on average 691.0) internal successors, (2073), 3 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:43,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:43,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 808 [2024-10-11 17:17:43,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:45,701 INFO L124 PetriNetUnfolderBase]: 2520/14068 cut-off events. [2024-10-11 17:17:45,701 INFO L125 PetriNetUnfolderBase]: For 4635/4698 co-relation queries the response was YES. [2024-10-11 17:17:45,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21211 conditions, 14068 events. 2520/14068 cut-off events. For 4635/4698 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 139448 event pairs, 112 based on Foata normal form. 0/12520 useless extension candidates. Maximal degree in co-relation 21090. Up to 3170 conditions per place. [2024-10-11 17:17:45,783 INFO L140 encePairwiseOnDemand]: 796/808 looper letters, 46 selfloop transitions, 3 changer transitions 0/661 dead transitions. [2024-10-11 17:17:45,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 661 transitions, 1554 flow [2024-10-11 17:17:45,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:45,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2114 transitions. [2024-10-11 17:17:45,785 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8721122112211221 [2024-10-11 17:17:45,785 INFO L175 Difference]: Start difference. First operand has 655 places, 657 transitions, 1411 flow. Second operand 3 states and 2114 transitions. [2024-10-11 17:17:45,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 661 transitions, 1554 flow [2024-10-11 17:17:45,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 661 transitions, 1540 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 17:17:45,795 INFO L231 Difference]: Finished difference. Result has 646 places, 649 transitions, 1394 flow [2024-10-11 17:17:45,796 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1381, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1394, PETRI_PLACES=646, PETRI_TRANSITIONS=649} [2024-10-11 17:17:45,796 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -112 predicate places. [2024-10-11 17:17:45,797 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 649 transitions, 1394 flow [2024-10-11 17:17:45,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 691.0) internal successors, (2073), 3 states have internal predecessors, (2073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:45,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:45,798 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:45,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 17:17:45,798 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:45,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:45,798 INFO L85 PathProgramCache]: Analyzing trace with hash 852871664, now seen corresponding path program 1 times [2024-10-11 17:17:45,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:45,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106765354] [2024-10-11 17:17:45,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:45,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:45,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:46,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:46,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106765354] [2024-10-11 17:17:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106765354] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:46,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 17:17:46,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479787650] [2024-10-11 17:17:46,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:46,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 17:17:46,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:46,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 17:17:46,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:17:46,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 808 [2024-10-11 17:17:46,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 646 places, 649 transitions, 1394 flow. Second operand has 8 states, 8 states have (on average 676.25) internal successors, (5410), 8 states have internal predecessors, (5410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:46,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:46,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 808 [2024-10-11 17:17:46,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:48,180 INFO L124 PetriNetUnfolderBase]: 674/6719 cut-off events. [2024-10-11 17:17:48,180 INFO L125 PetriNetUnfolderBase]: For 1844/2869 co-relation queries the response was YES. [2024-10-11 17:17:48,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9053 conditions, 6719 events. 674/6719 cut-off events. For 1844/2869 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 50874 event pairs, 269 based on Foata normal form. 16/5867 useless extension candidates. Maximal degree in co-relation 8931. Up to 740 conditions per place. [2024-10-11 17:17:48,415 INFO L140 encePairwiseOnDemand]: 797/808 looper letters, 94 selfloop transitions, 12 changer transitions 0/694 dead transitions. [2024-10-11 17:17:48,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 694 transitions, 1737 flow [2024-10-11 17:17:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 17:17:48,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-11 17:17:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6144 transitions. [2024-10-11 17:17:48,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8448844884488449 [2024-10-11 17:17:48,419 INFO L175 Difference]: Start difference. First operand has 646 places, 649 transitions, 1394 flow. Second operand 9 states and 6144 transitions. [2024-10-11 17:17:48,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 694 transitions, 1737 flow [2024-10-11 17:17:48,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 694 transitions, 1734 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 17:17:48,428 INFO L231 Difference]: Finished difference. Result has 656 places, 654 transitions, 1441 flow [2024-10-11 17:17:48,429 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=639, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1441, PETRI_PLACES=656, PETRI_TRANSITIONS=654} [2024-10-11 17:17:48,429 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -102 predicate places. [2024-10-11 17:17:48,429 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 654 transitions, 1441 flow [2024-10-11 17:17:48,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 676.25) internal successors, (5410), 8 states have internal predecessors, (5410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:48,431 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:48,431 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:48,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 17:17:48,431 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:48,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:48,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1474653682, now seen corresponding path program 1 times [2024-10-11 17:17:48,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:48,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569731315] [2024-10-11 17:17:48,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:48,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:49,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:49,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:49,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569731315] [2024-10-11 17:17:49,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569731315] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:49,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:49,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:17:49,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567686855] [2024-10-11 17:17:49,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:49,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:17:49,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:49,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:17:49,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:17:49,294 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 657 out of 808 [2024-10-11 17:17:49,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 654 transitions, 1441 flow. Second operand has 6 states, 6 states have (on average 658.6666666666666) internal successors, (3952), 6 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:49,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:49,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 808 [2024-10-11 17:17:49,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:55,534 INFO L124 PetriNetUnfolderBase]: 6430/27954 cut-off events. [2024-10-11 17:17:55,534 INFO L125 PetriNetUnfolderBase]: For 10787/10791 co-relation queries the response was YES. [2024-10-11 17:17:55,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45362 conditions, 27954 events. 6430/27954 cut-off events. For 10787/10791 co-relation queries the response was YES. Maximal size of possible extension queue 307. Compared 301549 event pairs, 3852 based on Foata normal form. 0/24961 useless extension candidates. Maximal degree in co-relation 45235. Up to 9158 conditions per place. [2024-10-11 17:17:55,841 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 70 selfloop transitions, 5 changer transitions 0/653 dead transitions. [2024-10-11 17:17:55,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 653 transitions, 1589 flow [2024-10-11 17:17:55,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:17:55,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:17:55,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4012 transitions. [2024-10-11 17:17:55,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8275577557755776 [2024-10-11 17:17:55,845 INFO L175 Difference]: Start difference. First operand has 656 places, 654 transitions, 1441 flow. Second operand 6 states and 4012 transitions. [2024-10-11 17:17:55,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 653 transitions, 1589 flow [2024-10-11 17:17:55,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 653 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:17:55,860 INFO L231 Difference]: Finished difference. Result has 658 places, 653 transitions, 1442 flow [2024-10-11 17:17:55,861 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1442, PETRI_PLACES=658, PETRI_TRANSITIONS=653} [2024-10-11 17:17:55,862 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -100 predicate places. [2024-10-11 17:17:55,862 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 653 transitions, 1442 flow [2024-10-11 17:17:55,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 658.6666666666666) internal successors, (3952), 6 states have internal predecessors, (3952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:55,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:55,863 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:55,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 17:17:55,863 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:55,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash 690663363, now seen corresponding path program 1 times [2024-10-11 17:17:55,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:55,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25043796] [2024-10-11 17:17:55,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:55,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:17:55,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:17:55,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:17:55,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25043796] [2024-10-11 17:17:55,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25043796] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:17:55,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:17:55,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:17:55,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962322407] [2024-10-11 17:17:55,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:17:55,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:17:55,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:17:55,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:17:55,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:17:55,948 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-11 17:17:55,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 653 transitions, 1442 flow. Second operand has 3 states, 3 states have (on average 710.0) internal successors, (2130), 3 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:55,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:17:55,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-11 17:17:55,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:17:59,372 INFO L124 PetriNetUnfolderBase]: 1770/18298 cut-off events. [2024-10-11 17:17:59,372 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2024-10-11 17:17:59,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23223 conditions, 18298 events. 1770/18298 cut-off events. For 2966/2970 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 198313 event pairs, 212 based on Foata normal form. 0/16392 useless extension candidates. Maximal degree in co-relation 23100. Up to 1988 conditions per place. [2024-10-11 17:17:59,477 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 33 selfloop transitions, 2 changer transitions 0/662 dead transitions. [2024-10-11 17:17:59,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 662 transitions, 1558 flow [2024-10-11 17:17:59,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:17:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:17:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2024-10-11 17:17:59,479 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8882013201320133 [2024-10-11 17:17:59,479 INFO L175 Difference]: Start difference. First operand has 658 places, 653 transitions, 1442 flow. Second operand 3 states and 2153 transitions. [2024-10-11 17:17:59,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 662 transitions, 1558 flow [2024-10-11 17:17:59,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 662 transitions, 1548 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:17:59,488 INFO L231 Difference]: Finished difference. Result has 653 places, 652 transitions, 1442 flow [2024-10-11 17:17:59,489 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=648, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1442, PETRI_PLACES=653, PETRI_TRANSITIONS=652} [2024-10-11 17:17:59,489 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -105 predicate places. [2024-10-11 17:17:59,489 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 652 transitions, 1442 flow [2024-10-11 17:17:59,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 710.0) internal successors, (2130), 3 states have internal predecessors, (2130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:17:59,490 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:17:59,490 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:17:59,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 17:17:59,491 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:17:59,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:17:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1111654041, now seen corresponding path program 1 times [2024-10-11 17:17:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:17:59,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264732139] [2024-10-11 17:17:59,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:17:59,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:17:59,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:18:00,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:18:00,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:18:00,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264732139] [2024-10-11 17:18:00,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264732139] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:18:00,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:18:00,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:18:00,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090322213] [2024-10-11 17:18:00,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:18:00,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:18:00,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:18:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:18:00,896 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 808 [2024-10-11 17:18:00,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 652 transitions, 1442 flow. Second operand has 6 states, 6 states have (on average 688.5) internal successors, (4131), 6 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:00,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:00,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 808 [2024-10-11 17:18:00,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:18:02,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2868] L52-->L57: Formula: (let ((.cse11 (* v_~front1~0_785 4)) (.cse12 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_191 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (+ v_~produce~0.offset_113 .cse15)) (.cse7 (+ v_~produce~0.offset_113 .cse15 1)) (.cse3 (+ .cse11 .cse12 v_~queue1~0.offset_453)) (.cse9 (+ 2 v_~produce~0.offset_113 .cse15)) (.cse6 (not |v_thread1_#t~short1#1_344|)) (.cse5 (+ v_~front1~0_785 v_~size1~0_505)) (.cse0 (select |v_#race_1773| v_~produce~0.base_113)) (.cse10 (+ 3 v_~produce~0.offset_113 .cse15))) (and (= 0 (select .cse0 .cse1)) (or (and (<= 0 v_~state11~0_191) |v_thread1_#t~short2#1_386|) (and (< v_~state11~0_191 0) .cse2)) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse1) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse3)) 1 0) 0)) (let ((.cse4 (= |v_#race~state11~0_441| 0))) (or (and (= |v_#race~n_produce~0_229| 0) .cse4 (or (and (< v_~state11~0_191 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_191) (not |v_thread1_#t~short2#1_385|))) |v_thread1_#t~short2#1_386|) (and .cse4 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (or (and (< .cse5 0) .cse6) (and |v_thread1_#t~short1#1_344| (<= 0 .cse5))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (= (select .cse0 .cse7) 0) (= (let ((.cse8 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse3 0) (+ .cse11 .cse12 v_~queue1~0.offset_453 1) 0) (+ 2 .cse11 .cse12 v_~queue1~0.offset_453) 0) (+ 3 .cse11 .cse12 v_~queue1~0.offset_453) 0)))) (store .cse8 v_~produce~0.base_113 (store (store (store (store (select .cse8 v_~produce~0.base_113) .cse1 0) .cse7 0) .cse9 0) .cse10 0))) |v_#race_1773|) (= (select .cse0 .cse9) 0) (let ((.cse13 (= |v_#race~front1~0_1640| 0)) (.cse14 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse13 .cse6 .cse14) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse13 .cse14 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse5)) (and |v_thread1_#t~short1#1_343| (< .cse5 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= |v_#race~state11~0_431| 0) (= |v_#race~queue1~0_976| 0) (= (select .cse0 .cse10) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_191, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_431|, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork2_#t~short1#1=|v_thread1Thread1of1ForFork2_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_7|, ~state11~0=v_~state11~0_191, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_3|, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_#race~state11~0_441|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork2_#t~mem4#1, thread1Thread1of1ForFork2_#t~short2#1, thread1Thread1of1ForFork2_#t~post5#1, ~size1~0, #race~size1~0, thread1Thread1of1ForFork2_#t~nondet6#1, thread1Thread1of1ForFork2_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #race~n_produce~0, #race~queue1~0, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][560], [326#L57true, Black: 862#true, 832#(= |#race~n_update~0| 0), 850#(= |#race~n1~0| 0), Black: 899#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 891#(<= ~n_produce~0 0), Black: 897#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), 325#L81true, Black: 872#true, 17#L94-1true, 917#true, Black: 913#true, 838#(= |#race~n_queue~0| 0), Black: 882#true, 915#(= |#race~produce~0| 0), Black: 854#true, 874#(= |#race~update~0| 0), 856#(= |#race~consume~0| 0), 820#(= |#race~n_produce~0| 0), Black: 858#true, 728#L133-4true, 860#(= |#race~n2~0| 0), Black: 797#(= |#race~state12~0| 0)]) [2024-10-11 17:18:02,496 INFO L294 olderBase$Statistics]: this new event has 497 ancestors and is cut-off event [2024-10-11 17:18:02,496 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-10-11 17:18:02,496 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is cut-off event [2024-10-11 17:18:02,496 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is cut-off event [2024-10-11 17:18:02,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2868] L52-->L57: Formula: (let ((.cse11 (* v_~front1~0_785 4)) (.cse12 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_191 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (+ v_~produce~0.offset_113 .cse15)) (.cse7 (+ v_~produce~0.offset_113 .cse15 1)) (.cse3 (+ .cse11 .cse12 v_~queue1~0.offset_453)) (.cse9 (+ 2 v_~produce~0.offset_113 .cse15)) (.cse6 (not |v_thread1_#t~short1#1_344|)) (.cse5 (+ v_~front1~0_785 v_~size1~0_505)) (.cse0 (select |v_#race_1773| v_~produce~0.base_113)) (.cse10 (+ 3 v_~produce~0.offset_113 .cse15))) (and (= 0 (select .cse0 .cse1)) (or (and (<= 0 v_~state11~0_191) |v_thread1_#t~short2#1_386|) (and (< v_~state11~0_191 0) .cse2)) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse1) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse3)) 1 0) 0)) (let ((.cse4 (= |v_#race~state11~0_441| 0))) (or (and (= |v_#race~n_produce~0_229| 0) .cse4 (or (and (< v_~state11~0_191 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_191) (not |v_thread1_#t~short2#1_385|))) |v_thread1_#t~short2#1_386|) (and .cse4 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (or (and (< .cse5 0) .cse6) (and |v_thread1_#t~short1#1_344| (<= 0 .cse5))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (= (select .cse0 .cse7) 0) (= (let ((.cse8 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse3 0) (+ .cse11 .cse12 v_~queue1~0.offset_453 1) 0) (+ 2 .cse11 .cse12 v_~queue1~0.offset_453) 0) (+ 3 .cse11 .cse12 v_~queue1~0.offset_453) 0)))) (store .cse8 v_~produce~0.base_113 (store (store (store (store (select .cse8 v_~produce~0.base_113) .cse1 0) .cse7 0) .cse9 0) .cse10 0))) |v_#race_1773|) (= (select .cse0 .cse9) 0) (let ((.cse13 (= |v_#race~front1~0_1640| 0)) (.cse14 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse13 .cse6 .cse14) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse13 .cse14 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse5)) (and |v_thread1_#t~short1#1_343| (< .cse5 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= |v_#race~state11~0_431| 0) (= |v_#race~queue1~0_976| 0) (= (select .cse0 .cse10) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_191, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_431|, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork2_#t~short1#1=|v_thread1Thread1of1ForFork2_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_7|, ~state11~0=v_~state11~0_191, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_3|, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_#race~state11~0_441|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork2_#t~mem4#1, thread1Thread1of1ForFork2_#t~short2#1, thread1Thread1of1ForFork2_#t~post5#1, ~size1~0, #race~size1~0, thread1Thread1of1ForFork2_#t~nondet6#1, thread1Thread1of1ForFork2_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #race~n_produce~0, #race~queue1~0, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][560], [326#L57true, Black: 862#true, 832#(= |#race~n_update~0| 0), 850#(= |#race~n1~0| 0), 224#L84true, Black: 899#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 891#(<= ~n_produce~0 0), Black: 897#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 872#true, 17#L94-1true, 917#true, Black: 913#true, 838#(= |#race~n_queue~0| 0), Black: 882#true, 915#(= |#race~produce~0| 0), 874#(= |#race~update~0| 0), Black: 854#true, 856#(= |#race~consume~0| 0), 820#(= |#race~n_produce~0| 0), Black: 858#true, 728#L133-4true, 860#(= |#race~n2~0| 0), Black: 797#(= |#race~state12~0| 0)]) [2024-10-11 17:18:02,504 INFO L294 olderBase$Statistics]: this new event has 498 ancestors and is cut-off event [2024-10-11 17:18:02,505 INFO L297 olderBase$Statistics]: existing Event has 461 ancestors and is cut-off event [2024-10-11 17:18:02,505 INFO L297 olderBase$Statistics]: existing Event has 498 ancestors and is cut-off event [2024-10-11 17:18:02,505 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-11 17:18:02,774 INFO L124 PetriNetUnfolderBase]: 635/7849 cut-off events. [2024-10-11 17:18:02,774 INFO L125 PetriNetUnfolderBase]: For 1750/2181 co-relation queries the response was YES. [2024-10-11 17:18:02,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10051 conditions, 7849 events. 635/7849 cut-off events. For 1750/2181 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 63731 event pairs, 114 based on Foata normal form. 52/7061 useless extension candidates. Maximal degree in co-relation 9925. Up to 464 conditions per place. [2024-10-11 17:18:02,853 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 79 selfloop transitions, 5 changer transitions 0/687 dead transitions. [2024-10-11 17:18:02,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 687 transitions, 1824 flow [2024-10-11 17:18:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:18:02,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:18:02,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4178 transitions. [2024-10-11 17:18:02,859 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8617986798679867 [2024-10-11 17:18:02,859 INFO L175 Difference]: Start difference. First operand has 653 places, 652 transitions, 1442 flow. Second operand 6 states and 4178 transitions. [2024-10-11 17:18:02,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 687 transitions, 1824 flow [2024-10-11 17:18:02,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 687 transitions, 1824 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-11 17:18:02,873 INFO L231 Difference]: Finished difference. Result has 657 places, 651 transitions, 1450 flow [2024-10-11 17:18:02,874 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1440, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=651, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1450, PETRI_PLACES=657, PETRI_TRANSITIONS=651} [2024-10-11 17:18:02,874 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -101 predicate places. [2024-10-11 17:18:02,874 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 651 transitions, 1450 flow [2024-10-11 17:18:02,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 688.5) internal successors, (4131), 6 states have internal predecessors, (4131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:02,875 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:18:02,876 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:18:02,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 17:18:02,876 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:18:02,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:18:02,877 INFO L85 PathProgramCache]: Analyzing trace with hash -716654359, now seen corresponding path program 1 times [2024-10-11 17:18:02,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:18:02,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046518862] [2024-10-11 17:18:02,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:18:02,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:18:02,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:18:03,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:18:03,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:18:03,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046518862] [2024-10-11 17:18:03,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046518862] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:18:03,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:18:03,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:18:03,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18389629] [2024-10-11 17:18:03,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:18:03,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:18:03,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:03,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:18:03,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:18:04,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 808 [2024-10-11 17:18:04,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 651 transitions, 1450 flow. Second operand has 6 states, 6 states have (on average 676.0) internal successors, (4056), 6 states have internal predecessors, (4056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:04,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:04,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 808 [2024-10-11 17:18:04,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:18:08,266 INFO L124 PetriNetUnfolderBase]: 3513/17633 cut-off events. [2024-10-11 17:18:08,266 INFO L125 PetriNetUnfolderBase]: For 7284/7310 co-relation queries the response was YES. [2024-10-11 17:18:08,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28203 conditions, 17633 events. 3513/17633 cut-off events. For 7284/7310 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 176559 event pairs, 147 based on Foata normal form. 0/16287 useless extension candidates. Maximal degree in co-relation 28076. Up to 3586 conditions per place. [2024-10-11 17:18:08,409 INFO L140 encePairwiseOnDemand]: 800/808 looper letters, 101 selfloop transitions, 5 changer transitions 0/696 dead transitions. [2024-10-11 17:18:08,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 696 transitions, 1908 flow [2024-10-11 17:18:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:18:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:18:08,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4126 transitions. [2024-10-11 17:18:08,413 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8510726072607261 [2024-10-11 17:18:08,414 INFO L175 Difference]: Start difference. First operand has 657 places, 651 transitions, 1450 flow. Second operand 6 states and 4126 transitions. [2024-10-11 17:18:08,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 696 transitions, 1908 flow [2024-10-11 17:18:08,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 696 transitions, 1898 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:18:08,429 INFO L231 Difference]: Finished difference. Result has 654 places, 648 transitions, 1444 flow [2024-10-11 17:18:08,430 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=643, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1444, PETRI_PLACES=654, PETRI_TRANSITIONS=648} [2024-10-11 17:18:08,431 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -104 predicate places. [2024-10-11 17:18:08,431 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 648 transitions, 1444 flow [2024-10-11 17:18:08,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 676.0) internal successors, (4056), 6 states have internal predecessors, (4056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:08,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:18:08,432 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:18:08,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 17:18:08,433 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:18:08,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:18:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1138579606, now seen corresponding path program 1 times [2024-10-11 17:18:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:18:08,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782026432] [2024-10-11 17:18:08,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:18:08,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:18:08,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:18:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 17:18:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:18:08,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782026432] [2024-10-11 17:18:08,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782026432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:18:08,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:18:08,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:18:08,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427446158] [2024-10-11 17:18:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:18:08,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:18:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:08,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:18:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:18:08,569 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-11 17:18:08,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 648 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 711.3333333333334) internal successors, (2134), 3 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:08,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:08,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-11 17:18:08,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:18:10,325 INFO L124 PetriNetUnfolderBase]: 714/7847 cut-off events. [2024-10-11 17:18:10,325 INFO L125 PetriNetUnfolderBase]: For 1869/2223 co-relation queries the response was YES. [2024-10-11 17:18:10,368 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10445 conditions, 7847 events. 714/7847 cut-off events. For 1869/2223 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 63689 event pairs, 230 based on Foata normal form. 13/7113 useless extension candidates. Maximal degree in co-relation 10319. Up to 691 conditions per place. [2024-10-11 17:18:10,389 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 33 selfloop transitions, 2 changer transitions 0/656 dead transitions. [2024-10-11 17:18:10,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 656 transitions, 1566 flow [2024-10-11 17:18:10,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:18:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:18:10,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2149 transitions. [2024-10-11 17:18:10,391 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865511551155115 [2024-10-11 17:18:10,391 INFO L175 Difference]: Start difference. First operand has 654 places, 648 transitions, 1444 flow. Second operand 3 states and 2149 transitions. [2024-10-11 17:18:10,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 656 transitions, 1566 flow [2024-10-11 17:18:10,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 656 transitions, 1556 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:18:10,401 INFO L231 Difference]: Finished difference. Result has 650 places, 647 transitions, 1436 flow [2024-10-11 17:18:10,402 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1432, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=647, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=645, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1436, PETRI_PLACES=650, PETRI_TRANSITIONS=647} [2024-10-11 17:18:10,403 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -108 predicate places. [2024-10-11 17:18:10,403 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 647 transitions, 1436 flow [2024-10-11 17:18:10,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.3333333333334) internal successors, (2134), 3 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:10,403 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:18:10,404 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:18:10,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 17:18:10,404 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:18:10,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:18:10,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1118901865, now seen corresponding path program 1 times [2024-10-11 17:18:10,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:18:10,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390976767] [2024-10-11 17:18:10,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:18:10,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:18:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:18:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:18:11,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:18:11,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390976767] [2024-10-11 17:18:11,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390976767] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:18:11,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:18:11,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:18:11,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484500171] [2024-10-11 17:18:11,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:18:11,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:18:11,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:11,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:18:11,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:18:11,481 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 808 [2024-10-11 17:18:11,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 647 transitions, 1436 flow. Second operand has 6 states, 6 states have (on average 688.0) internal successors, (4128), 6 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:11,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:11,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 808 [2024-10-11 17:18:11,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:18:14,170 INFO L124 PetriNetUnfolderBase]: 1532/10227 cut-off events. [2024-10-11 17:18:14,170 INFO L125 PetriNetUnfolderBase]: For 3385/3630 co-relation queries the response was YES. [2024-10-11 17:18:14,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14908 conditions, 10227 events. 1532/10227 cut-off events. For 3385/3630 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 88766 event pairs, 192 based on Foata normal form. 0/9378 useless extension candidates. Maximal degree in co-relation 14781. Up to 682 conditions per place. [2024-10-11 17:18:14,270 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 87 selfloop transitions, 5 changer transitions 0/690 dead transitions. [2024-10-11 17:18:14,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 690 transitions, 1830 flow [2024-10-11 17:18:14,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:18:14,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:18:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4186 transitions. [2024-10-11 17:18:14,274 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8634488448844885 [2024-10-11 17:18:14,274 INFO L175 Difference]: Start difference. First operand has 650 places, 647 transitions, 1436 flow. Second operand 6 states and 4186 transitions. [2024-10-11 17:18:14,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 690 transitions, 1830 flow [2024-10-11 17:18:14,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 690 transitions, 1826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 17:18:14,285 INFO L231 Difference]: Finished difference. Result has 652 places, 646 transitions, 1440 flow [2024-10-11 17:18:14,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=641, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1440, PETRI_PLACES=652, PETRI_TRANSITIONS=646} [2024-10-11 17:18:14,286 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -106 predicate places. [2024-10-11 17:18:14,286 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 646 transitions, 1440 flow [2024-10-11 17:18:14,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 688.0) internal successors, (4128), 6 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:14,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:18:14,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:18:14,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-11 17:18:14,287 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:18:14,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:18:14,288 INFO L85 PathProgramCache]: Analyzing trace with hash -840419165, now seen corresponding path program 1 times [2024-10-11 17:18:14,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:18:14,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860359196] [2024-10-11 17:18:14,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:18:14,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:18:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:18:14,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:18:14,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:18:14,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860359196] [2024-10-11 17:18:14,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860359196] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:18:14,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:18:14,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:18:14,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883469748] [2024-10-11 17:18:14,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:18:14,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:18:14,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:14,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:18:14,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:18:15,334 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 687 out of 808 [2024-10-11 17:18:15,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 646 transitions, 1440 flow. Second operand has 6 states, 6 states have (on average 688.6666666666666) internal successors, (4132), 6 states have internal predecessors, (4132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:15,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:15,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 687 of 808 [2024-10-11 17:18:15,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:18:18,346 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2868] L52-->L57: Formula: (let ((.cse11 (* v_~front1~0_785 4)) (.cse12 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_191 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (+ v_~produce~0.offset_113 .cse15)) (.cse7 (+ v_~produce~0.offset_113 .cse15 1)) (.cse3 (+ .cse11 .cse12 v_~queue1~0.offset_453)) (.cse9 (+ 2 v_~produce~0.offset_113 .cse15)) (.cse6 (not |v_thread1_#t~short1#1_344|)) (.cse5 (+ v_~front1~0_785 v_~size1~0_505)) (.cse0 (select |v_#race_1773| v_~produce~0.base_113)) (.cse10 (+ 3 v_~produce~0.offset_113 .cse15))) (and (= 0 (select .cse0 .cse1)) (or (and (<= 0 v_~state11~0_191) |v_thread1_#t~short2#1_386|) (and (< v_~state11~0_191 0) .cse2)) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse1) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse3)) 1 0) 0)) (let ((.cse4 (= |v_#race~state11~0_441| 0))) (or (and (= |v_#race~n_produce~0_229| 0) .cse4 (or (and (< v_~state11~0_191 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_191) (not |v_thread1_#t~short2#1_385|))) |v_thread1_#t~short2#1_386|) (and .cse4 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (or (and (< .cse5 0) .cse6) (and |v_thread1_#t~short1#1_344| (<= 0 .cse5))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (= (select .cse0 .cse7) 0) (= (let ((.cse8 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse3 0) (+ .cse11 .cse12 v_~queue1~0.offset_453 1) 0) (+ 2 .cse11 .cse12 v_~queue1~0.offset_453) 0) (+ 3 .cse11 .cse12 v_~queue1~0.offset_453) 0)))) (store .cse8 v_~produce~0.base_113 (store (store (store (store (select .cse8 v_~produce~0.base_113) .cse1 0) .cse7 0) .cse9 0) .cse10 0))) |v_#race_1773|) (= (select .cse0 .cse9) 0) (let ((.cse13 (= |v_#race~front1~0_1640| 0)) (.cse14 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse13 .cse6 .cse14) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse13 .cse14 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse5)) (and |v_thread1_#t~short1#1_343| (< .cse5 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= |v_#race~state11~0_431| 0) (= |v_#race~queue1~0_976| 0) (= (select .cse0 .cse10) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_191, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_431|, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork2_#t~short1#1=|v_thread1Thread1of1ForFork2_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_7|, ~state11~0=v_~state11~0_191, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_3|, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_#race~state11~0_441|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork2_#t~mem4#1, thread1Thread1of1ForFork2_#t~short2#1, thread1Thread1of1ForFork2_#t~post5#1, ~size1~0, #race~size1~0, thread1Thread1of1ForFork2_#t~nondet6#1, thread1Thread1of1ForFork2_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #race~n_produce~0, #race~queue1~0, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][537], [326#L57true, 932#true, Black: 862#true, 832#(= |#race~n_update~0| 0), 850#(= |#race~n1~0| 0), Black: 899#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 891#(<= ~n_produce~0 0), 938#true, Black: 897#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 872#true, 325#L81true, 17#L94-1true, Black: 913#true, 838#(= |#race~n_queue~0| 0), Black: 882#true, 915#(= |#race~produce~0| 0), 874#(= |#race~update~0| 0), Black: 854#true, 856#(= |#race~consume~0| 0), 820#(= |#race~n_produce~0| 0), 728#L133-4true, Black: 858#true, Black: 797#(= |#race~state12~0| 0), 860#(= |#race~n2~0| 0)]) [2024-10-11 17:18:18,347 INFO L294 olderBase$Statistics]: this new event has 497 ancestors and is cut-off event [2024-10-11 17:18:18,347 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is cut-off event [2024-10-11 17:18:18,347 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-10-11 17:18:18,347 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is cut-off event [2024-10-11 17:18:18,360 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2868] L52-->L57: Formula: (let ((.cse11 (* v_~front1~0_785 4)) (.cse12 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_191 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (+ v_~produce~0.offset_113 .cse15)) (.cse7 (+ v_~produce~0.offset_113 .cse15 1)) (.cse3 (+ .cse11 .cse12 v_~queue1~0.offset_453)) (.cse9 (+ 2 v_~produce~0.offset_113 .cse15)) (.cse6 (not |v_thread1_#t~short1#1_344|)) (.cse5 (+ v_~front1~0_785 v_~size1~0_505)) (.cse0 (select |v_#race_1773| v_~produce~0.base_113)) (.cse10 (+ 3 v_~produce~0.offset_113 .cse15))) (and (= 0 (select .cse0 .cse1)) (or (and (<= 0 v_~state11~0_191) |v_thread1_#t~short2#1_386|) (and (< v_~state11~0_191 0) .cse2)) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse1) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse3)) 1 0) 0)) (let ((.cse4 (= |v_#race~state11~0_441| 0))) (or (and (= |v_#race~n_produce~0_229| 0) .cse4 (or (and (< v_~state11~0_191 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_191) (not |v_thread1_#t~short2#1_385|))) |v_thread1_#t~short2#1_386|) (and .cse4 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (or (and (< .cse5 0) .cse6) (and |v_thread1_#t~short1#1_344| (<= 0 .cse5))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (= (select .cse0 .cse7) 0) (= (let ((.cse8 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse3 0) (+ .cse11 .cse12 v_~queue1~0.offset_453 1) 0) (+ 2 .cse11 .cse12 v_~queue1~0.offset_453) 0) (+ 3 .cse11 .cse12 v_~queue1~0.offset_453) 0)))) (store .cse8 v_~produce~0.base_113 (store (store (store (store (select .cse8 v_~produce~0.base_113) .cse1 0) .cse7 0) .cse9 0) .cse10 0))) |v_#race_1773|) (= (select .cse0 .cse9) 0) (let ((.cse13 (= |v_#race~front1~0_1640| 0)) (.cse14 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse13 .cse6 .cse14) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse13 .cse14 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse5)) (and |v_thread1_#t~short1#1_343| (< .cse5 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= |v_#race~state11~0_431| 0) (= |v_#race~queue1~0_976| 0) (= (select .cse0 .cse10) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_191, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_431|, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork2_#t~short1#1=|v_thread1Thread1of1ForFork2_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_7|, ~state11~0=v_~state11~0_191, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_3|, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_#race~state11~0_441|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork2_#t~mem4#1, thread1Thread1of1ForFork2_#t~short2#1, thread1Thread1of1ForFork2_#t~post5#1, ~size1~0, #race~size1~0, thread1Thread1of1ForFork2_#t~nondet6#1, thread1Thread1of1ForFork2_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #race~n_produce~0, #race~queue1~0, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][537], [326#L57true, 932#true, Black: 862#true, 832#(= |#race~n_update~0| 0), 850#(= |#race~n1~0| 0), 224#L84true, Black: 899#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 891#(<= ~n_produce~0 0), 938#true, Black: 897#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 872#true, 17#L94-1true, Black: 913#true, Black: 882#true, 838#(= |#race~n_queue~0| 0), 915#(= |#race~produce~0| 0), Black: 854#true, 874#(= |#race~update~0| 0), 856#(= |#race~consume~0| 0), 820#(= |#race~n_produce~0| 0), 728#L133-4true, Black: 858#true, Black: 797#(= |#race~state12~0| 0), 860#(= |#race~n2~0| 0)]) [2024-10-11 17:18:18,360 INFO L294 olderBase$Statistics]: this new event has 498 ancestors and is cut-off event [2024-10-11 17:18:18,360 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-11 17:18:18,360 INFO L297 olderBase$Statistics]: existing Event has 461 ancestors and is cut-off event [2024-10-11 17:18:18,360 INFO L297 olderBase$Statistics]: existing Event has 498 ancestors and is cut-off event [2024-10-11 17:18:18,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2868] L52-->L57: Formula: (let ((.cse11 (* v_~front1~0_785 4)) (.cse12 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_191 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (+ v_~produce~0.offset_113 .cse15)) (.cse7 (+ v_~produce~0.offset_113 .cse15 1)) (.cse3 (+ .cse11 .cse12 v_~queue1~0.offset_453)) (.cse9 (+ 2 v_~produce~0.offset_113 .cse15)) (.cse6 (not |v_thread1_#t~short1#1_344|)) (.cse5 (+ v_~front1~0_785 v_~size1~0_505)) (.cse0 (select |v_#race_1773| v_~produce~0.base_113)) (.cse10 (+ 3 v_~produce~0.offset_113 .cse15))) (and (= 0 (select .cse0 .cse1)) (or (and (<= 0 v_~state11~0_191) |v_thread1_#t~short2#1_386|) (and (< v_~state11~0_191 0) .cse2)) (not (= (ite (= (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse1) (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse3)) 1 0) 0)) (let ((.cse4 (= |v_#race~state11~0_441| 0))) (or (and (= |v_#race~n_produce~0_229| 0) .cse4 (or (and (< v_~state11~0_191 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_191) (not |v_thread1_#t~short2#1_385|))) |v_thread1_#t~short2#1_386|) (and .cse4 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (or (and (< .cse5 0) .cse6) (and |v_thread1_#t~short1#1_344| (<= 0 .cse5))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (= (select .cse0 .cse7) 0) (= (let ((.cse8 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse3 0) (+ .cse11 .cse12 v_~queue1~0.offset_453 1) 0) (+ 2 .cse11 .cse12 v_~queue1~0.offset_453) 0) (+ 3 .cse11 .cse12 v_~queue1~0.offset_453) 0)))) (store .cse8 v_~produce~0.base_113 (store (store (store (store (select .cse8 v_~produce~0.base_113) .cse1 0) .cse7 0) .cse9 0) .cse10 0))) |v_#race_1773|) (= (select .cse0 .cse9) 0) (let ((.cse13 (= |v_#race~front1~0_1640| 0)) (.cse14 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse13 .cse6 .cse14) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse13 .cse14 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse5)) (and |v_thread1_#t~short1#1_343| (< .cse5 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= |v_#race~state11~0_431| 0) (= |v_#race~queue1~0_976| 0) (= (select .cse0 .cse10) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_191, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_431|, thread1Thread1of1ForFork2_#t~short2#1=|v_thread1Thread1of1ForFork2_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork2_#t~short1#1=|v_thread1Thread1of1ForFork2_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, thread1Thread1of1ForFork2_#t~mem3#1=|v_thread1Thread1of1ForFork2_#t~mem3#1_13|, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1_25|, #race=|v_#race_1773|, thread1Thread1of1ForFork2_#t~mem4#1=|v_thread1Thread1of1ForFork2_#t~mem4#1_7|, ~state11~0=v_~state11~0_191, thread1Thread1of1ForFork2_#t~post5#1=|v_thread1Thread1of1ForFork2_#t~post5#1_3|, ~size1~0=v_~size1~0_504, thread1Thread1of1ForFork2_#t~nondet6#1=|v_thread1Thread1of1ForFork2_#t~nondet6#1_3|, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_#race~state11~0_441|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork2_#t~mem4#1, thread1Thread1of1ForFork2_#t~short2#1, thread1Thread1of1ForFork2_#t~post5#1, ~size1~0, #race~size1~0, thread1Thread1of1ForFork2_#t~nondet6#1, thread1Thread1of1ForFork2_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork2_assume_abort_if_not_#in~cond#1, #race~n_produce~0, #race~queue1~0, thread1Thread1of1ForFork2_#t~mem3#1, thread1Thread1of1ForFork2_assume_abort_if_not_~cond#1][537], [326#L57true, 932#true, Black: 862#true, 832#(= |#race~n_update~0| 0), 850#(= |#race~n1~0| 0), 224#L84true, Black: 899#(and (<= ~n_produce~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 891#(<= ~n_produce~0 0), 938#true, Black: 897#(and (= |ULTIMATE.start_create_fresh_int_array_~i~1#1| 0) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n_produce~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 872#true, 17#L94-1true, Black: 913#true, 838#(= |#race~n_queue~0| 0), Black: 882#true, 915#(= |#race~produce~0| 0), 874#(= |#race~update~0| 0), Black: 854#true, 856#(= |#race~consume~0| 0), 820#(= |#race~n_produce~0| 0), 728#L133-4true, Black: 858#true, Black: 795#true, 860#(= |#race~n2~0| 0)]) [2024-10-11 17:18:18,701 INFO L294 olderBase$Statistics]: this new event has 508 ancestors and is cut-off event [2024-10-11 17:18:18,701 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-10-11 17:18:18,701 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2024-10-11 17:18:18,701 INFO L297 olderBase$Statistics]: existing Event has 508 ancestors and is cut-off event [2024-10-11 17:18:18,884 INFO L124 PetriNetUnfolderBase]: 2243/16047 cut-off events. [2024-10-11 17:18:18,884 INFO L125 PetriNetUnfolderBase]: For 4372/4528 co-relation queries the response was YES. [2024-10-11 17:18:18,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22845 conditions, 16047 events. 2243/16047 cut-off events. For 4372/4528 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 163280 event pairs, 496 based on Foata normal form. 0/14630 useless extension candidates. Maximal degree in co-relation 22721. Up to 1506 conditions per place. [2024-10-11 17:18:18,964 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 86 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2024-10-11 17:18:18,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 689 transitions, 1832 flow [2024-10-11 17:18:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:18:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-11 17:18:18,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4191 transitions. [2024-10-11 17:18:18,968 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.864480198019802 [2024-10-11 17:18:18,968 INFO L175 Difference]: Start difference. First operand has 652 places, 646 transitions, 1440 flow. Second operand 6 states and 4191 transitions. [2024-10-11 17:18:18,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 689 transitions, 1832 flow [2024-10-11 17:18:18,974 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 689 transitions, 1822 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:18:18,979 INFO L231 Difference]: Finished difference. Result has 651 places, 645 transitions, 1438 flow [2024-10-11 17:18:18,980 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=645, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1438, PETRI_PLACES=651, PETRI_TRANSITIONS=645} [2024-10-11 17:18:18,980 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -107 predicate places. [2024-10-11 17:18:18,980 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 645 transitions, 1438 flow [2024-10-11 17:18:18,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 688.6666666666666) internal successors, (4132), 6 states have internal predecessors, (4132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:18,981 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:18:18,981 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:18:18,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-11 17:18:18,982 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:18:18,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:18:18,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1111726618, now seen corresponding path program 1 times [2024-10-11 17:18:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:18:18,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221151099] [2024-10-11 17:18:18,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:18:18,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:18:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:18:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:18:19,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:18:19,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221151099] [2024-10-11 17:18:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221151099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:18:19,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:18:19,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:18:19,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525588911] [2024-10-11 17:18:19,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:18:19,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:18:19,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:19,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:18:19,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:18:19,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-11 17:18:19,081 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 645 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 711.0) internal successors, (2133), 3 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:19,081 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:19,081 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-11 17:18:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 17:18:22,364 INFO L124 PetriNetUnfolderBase]: 2005/16090 cut-off events. [2024-10-11 17:18:22,365 INFO L125 PetriNetUnfolderBase]: For 3762/3864 co-relation queries the response was YES. [2024-10-11 17:18:22,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22167 conditions, 16090 events. 2005/16090 cut-off events. For 3762/3864 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 164587 event pairs, 684 based on Foata normal form. 0/14734 useless extension candidates. Maximal degree in co-relation 22042. Up to 1903 conditions per place. [2024-10-11 17:18:22,463 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 34 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2024-10-11 17:18:22,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 655 transitions, 1561 flow [2024-10-11 17:18:22,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:18:22,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 17:18:22,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2150 transitions. [2024-10-11 17:18:22,465 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.886963696369637 [2024-10-11 17:18:22,465 INFO L175 Difference]: Start difference. First operand has 651 places, 645 transitions, 1438 flow. Second operand 3 states and 2150 transitions. [2024-10-11 17:18:22,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 655 transitions, 1561 flow [2024-10-11 17:18:22,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 655 transitions, 1551 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-11 17:18:22,473 INFO L231 Difference]: Finished difference. Result has 647 places, 644 transitions, 1430 flow [2024-10-11 17:18:22,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=808, PETRI_DIFFERENCE_MINUEND_FLOW=1426, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=642, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1430, PETRI_PLACES=647, PETRI_TRANSITIONS=644} [2024-10-11 17:18:22,474 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -111 predicate places. [2024-10-11 17:18:22,474 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 644 transitions, 1430 flow [2024-10-11 17:18:22,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 711.0) internal successors, (2133), 3 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:22,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 17:18:22,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:18:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-11 17:18:22,475 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 218 more)] === [2024-10-11 17:18:22,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:18:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1897090723, now seen corresponding path program 1 times [2024-10-11 17:18:22,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:18:22,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132557412] [2024-10-11 17:18:22,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:18:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:18:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:18:23,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:18:23,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:18:23,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132557412] [2024-10-11 17:18:23,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132557412] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:18:23,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:18:23,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:18:23,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835514977] [2024-10-11 17:18:23,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:18:23,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:18:23,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:18:23,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:18:23,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:18:23,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 808 [2024-10-11 17:18:23,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 644 transitions, 1430 flow. Second operand has 6 states, 6 states have (on average 688.0) internal successors, (4128), 6 states have internal predecessors, (4128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:18:23,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 17:18:23,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 808 [2024-10-11 17:18:23,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand