./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 a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:00:34,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:00:34,093 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 10:00:34,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:00:34,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:00:34,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:00:34,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:00:34,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:00:34,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:00:34,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:00:34,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:00:34,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:00:34,135 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:00:34,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:00:34,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 10:00:34,138 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 10:00:34,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:00:34,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 10:00:34,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:00:34,140 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 10:00:34,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:00:34,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 10:00:34,144 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 10:00:34,144 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:00:34,144 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:00:34,144 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 10:00:34,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 10:00:34,145 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:00:34,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:00:34,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:00:34,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:00:34,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:34,146 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:00:34,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:00:34,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 10:00:34,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:00:34,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:00:34,150 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:00:34,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:00:34,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:00:34,151 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:00:34,151 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1ecd7c8e693c00e4ad1aa87421fd475cfc129d605eef5f310568fee0c97eadf4 [2024-10-13 10:00:34,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:00:34,456 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:00:34,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:00:34,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:00:34,461 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:00:34,462 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-13 10:00:35,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:00:36,086 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:00:36,087 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-10-13 10:00:36,104 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ba2aa89/0d65798a6c9643ada859728336cdff8b/FLAGe322bc4d7 [2024-10-13 10:00:36,441 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/62ba2aa89/0d65798a6c9643ada859728336cdff8b [2024-10-13 10:00:36,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:00:36,444 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:00:36,445 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:36,445 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:00:36,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:00:36,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:36,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f494aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36, skipping insertion in model container [2024-10-13 10:00:36,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:36,484 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:00:36,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:36,774 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:00:36,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:00:36,851 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:00:36,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36 WrapperNode [2024-10-13 10:00:36,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:00:36,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:36,854 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:00:36,854 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:00:36,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:36,891 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:36,956 INFO L138 Inliner]: procedures = 27, calls = 66, calls flagged for inlining = 27, calls inlined = 33, statements flattened = 810 [2024-10-13 10:00:36,957 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:00:36,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:00:36,960 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:00:36,961 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:00:36,970 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:36,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:36,984 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:36,984 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:37,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:37,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:37,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:37,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:37,054 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:00:37,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:00:37,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:00:37,057 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:00:37,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (1/1) ... [2024-10-13 10:00:37,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:00:37,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:00:37,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:00:37,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:00:37,152 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 10:00:37,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-10-13 10:00:37,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-13 10:00:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-13 10:00:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-10-13 10:00:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-13 10:00:37,153 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-13 10:00:37,153 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-13 10:00:37,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-13 10:00:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-13 10:00:37,154 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-13 10:00:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 10:00:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-13 10:00:37,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-13 10:00:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 10:00:37,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:00:37,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:00:37,158 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 10:00:37,351 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:00:37,357 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:00:38,558 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 10:00:38,558 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:00:39,480 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:00:39,482 INFO L314 CfgBuilder]: Removed 9 assume(true) statements. [2024-10-13 10:00:39,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:39 BoogieIcfgContainer [2024-10-13 10:00:39,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:00:39,487 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:00:39,487 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:00:39,491 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:00:39,491 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:00:36" (1/3) ... [2024-10-13 10:00:39,492 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcd4978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:39, skipping insertion in model container [2024-10-13 10:00:39,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:00:36" (2/3) ... [2024-10-13 10:00:39,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bcd4978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:00:39, skipping insertion in model container [2024-10-13 10:00:39,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:00:39" (3/3) ... [2024-10-13 10:00:39,495 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-10-13 10:00:39,511 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:00:39,511 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 127 error locations. [2024-10-13 10:00:39,512 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 10:00:39,697 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-13 10:00:39,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 777 places, 808 transitions, 1637 flow [2024-10-13 10:00:40,040 INFO L124 PetriNetUnfolderBase]: 41/805 cut-off events. [2024-10-13 10:00:40,041 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 10:00:40,054 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-13 10:00:40,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 777 places, 808 transitions, 1637 flow [2024-10-13 10:00:40,071 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 758 places, 788 transitions, 1594 flow [2024-10-13 10:00:40,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:00:40,088 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;@1abee26a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:00:40,089 INFO L334 AbstractCegarLoop]: Starting to check reachability of 222 error locations. [2024-10-13 10:00:40,094 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 10:00:40,094 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-10-13 10:00:40,094 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 10:00:40,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:40,095 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:40,096 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-13 10:00:40,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:40,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1257042968, now seen corresponding path program 1 times [2024-10-13 10:00:40,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:40,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434988794] [2024-10-13 10:00:40,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:40,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:40,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:40,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:40,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:40,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434988794] [2024-10-13 10:00:40,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434988794] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:40,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:40,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:40,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835533469] [2024-10-13 10:00:40,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:40,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:40,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:40,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:40,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:40,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-13 10:00:40,415 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-13 10:00:40,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:40,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-13 10:00:40,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:40,813 INFO L124 PetriNetUnfolderBase]: 52/968 cut-off events. [2024-10-13 10:00:40,814 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-13 10:00:40,823 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-13 10:00:40,831 INFO L140 encePairwiseOnDemand]: 728/808 looper letters, 14 selfloop transitions, 2 changer transitions 12/710 dead transitions. [2024-10-13 10:00:40,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 710 transitions, 1470 flow [2024-10-13 10:00:40,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:40,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2024-10-13 10:00:40,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9187293729372937 [2024-10-13 10:00:40,858 INFO L175 Difference]: Start difference. First operand has 758 places, 788 transitions, 1594 flow. Second operand 3 states and 2227 transitions. [2024-10-13 10:00:40,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 710 transitions, 1470 flow [2024-10-13 10:00:40,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1458 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-13 10:00:40,880 INFO L231 Difference]: Finished difference. Result has 702 places, 698 transitions, 1406 flow [2024-10-13 10:00:40,884 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-13 10:00:40,890 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -56 predicate places. [2024-10-13 10:00:40,891 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 698 transitions, 1406 flow [2024-10-13 10:00:40,893 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-13 10:00:40,893 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:40,893 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-13 10:00:40,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:00:40,893 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-13 10:00:40,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:40,894 INFO L85 PathProgramCache]: Analyzing trace with hash 140907687, now seen corresponding path program 1 times [2024-10-13 10:00:40,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125583106] [2024-10-13 10:00:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:40,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:40,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:40,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:40,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125583106] [2024-10-13 10:00:40,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125583106] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:40,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:40,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:40,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717061566] [2024-10-13 10:00:40,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:40,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:40,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:40,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:40,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:41,044 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 808 [2024-10-13 10:00:41,046 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-13 10:00:41,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:41,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 808 [2024-10-13 10:00:41,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:41,396 INFO L124 PetriNetUnfolderBase]: 92/1019 cut-off events. [2024-10-13 10:00:41,397 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 10:00:41,404 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-13 10:00:41,413 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 19 selfloop transitions, 2 changer transitions 0/697 dead transitions. [2024-10-13 10:00:41,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 697 transitions, 1446 flow [2024-10-13 10:00:41,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:41,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2024-10-13 10:00:41,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828382838283828 [2024-10-13 10:00:41,420 INFO L175 Difference]: Start difference. First operand has 702 places, 698 transitions, 1406 flow. Second operand 3 states and 2140 transitions. [2024-10-13 10:00:41,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 697 transitions, 1446 flow [2024-10-13 10:00:41,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 697 transitions, 1442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:41,437 INFO L231 Difference]: Finished difference. Result has 689 places, 697 transitions, 1404 flow [2024-10-13 10:00:41,438 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-13 10:00:41,439 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -69 predicate places. [2024-10-13 10:00:41,439 INFO L471 AbstractCegarLoop]: Abstraction has has 689 places, 697 transitions, 1404 flow [2024-10-13 10:00:41,441 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-13 10:00:41,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:41,442 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-13 10:00:41,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:00:41,443 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-13 10:00:41,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1934330703, now seen corresponding path program 1 times [2024-10-13 10:00:41,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:41,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901930546] [2024-10-13 10:00:41,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:41,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:41,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:41,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:41,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:41,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901930546] [2024-10-13 10:00:41,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901930546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:41,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:41,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:41,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021270583] [2024-10-13 10:00:41,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:41,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:41,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:41,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:41,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 704 out of 808 [2024-10-13 10:00:41,555 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-13 10:00:41,556 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:41,556 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 704 of 808 [2024-10-13 10:00:41,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:41,895 INFO L124 PetriNetUnfolderBase]: 124/1107 cut-off events. [2024-10-13 10:00:41,896 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-13 10:00:41,908 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-13 10:00:41,918 INFO L140 encePairwiseOnDemand]: 801/808 looper letters, 23 selfloop transitions, 3 changer transitions 0/698 dead transitions. [2024-10-13 10:00:41,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 687 places, 698 transitions, 1460 flow [2024-10-13 10:00:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:41,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2024-10-13 10:00:41,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8836633663366337 [2024-10-13 10:00:41,924 INFO L175 Difference]: Start difference. First operand has 689 places, 697 transitions, 1404 flow. Second operand 3 states and 2142 transitions. [2024-10-13 10:00:41,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 687 places, 698 transitions, 1460 flow [2024-10-13 10:00:41,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 698 transitions, 1456 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:41,940 INFO L231 Difference]: Finished difference. Result has 685 places, 693 transitions, 1398 flow [2024-10-13 10:00:41,942 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-13 10:00:41,942 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -73 predicate places. [2024-10-13 10:00:41,943 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 693 transitions, 1398 flow [2024-10-13 10:00:41,945 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-13 10:00:41,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:41,945 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-13 10:00:41,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:00:41,946 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-13 10:00:41,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:41,947 INFO L85 PathProgramCache]: Analyzing trace with hash -2081418111, now seen corresponding path program 1 times [2024-10-13 10:00:41,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:41,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023372061] [2024-10-13 10:00:41,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:41,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:41,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:42,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:42,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023372061] [2024-10-13 10:00:42,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023372061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:42,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:42,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:42,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259491870] [2024-10-13 10:00:42,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:42,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:42,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:42,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:42,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:42,081 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 701 out of 808 [2024-10-13 10:00:42,084 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-13 10:00:42,084 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:42,084 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 701 of 808 [2024-10-13 10:00:42,084 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:42,534 INFO L124 PetriNetUnfolderBase]: 342/1908 cut-off events. [2024-10-13 10:00:42,535 INFO L125 PetriNetUnfolderBase]: For 104/104 co-relation queries the response was YES. [2024-10-13 10:00:42,543 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-13 10:00:42,552 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 24 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2024-10-13 10:00:42,553 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 692 transitions, 1448 flow [2024-10-13 10:00:42,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:42,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2130 transitions. [2024-10-13 10:00:42,557 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8787128712871287 [2024-10-13 10:00:42,557 INFO L175 Difference]: Start difference. First operand has 685 places, 693 transitions, 1398 flow. Second operand 3 states and 2130 transitions. [2024-10-13 10:00:42,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 692 transitions, 1448 flow [2024-10-13 10:00:42,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 692 transitions, 1442 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:42,568 INFO L231 Difference]: Finished difference. Result has 684 places, 692 transitions, 1394 flow [2024-10-13 10:00:42,569 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-13 10:00:42,570 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -74 predicate places. [2024-10-13 10:00:42,570 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 692 transitions, 1394 flow [2024-10-13 10:00:42,572 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-13 10:00:42,572 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:42,572 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:42,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:00:42,573 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-13 10:00:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 37568012, now seen corresponding path program 1 times [2024-10-13 10:00:42,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:42,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591249235] [2024-10-13 10:00:42,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:42,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:42,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:42,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:42,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591249235] [2024-10-13 10:00:42,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591249235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:42,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:42,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:42,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643431153] [2024-10-13 10:00:42,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:42,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:42,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:42,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:42,642 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-13 10:00:42,644 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-13 10:00:42,645 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:42,645 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-13 10:00:42,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:42,853 INFO L124 PetriNetUnfolderBase]: 52/937 cut-off events. [2024-10-13 10:00:42,853 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 10:00:42,858 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-13 10:00:42,869 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 2 changer transitions 0/691 dead transitions. [2024-10-13 10:00:42,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 685 places, 691 transitions, 1428 flow [2024-10-13 10:00:42,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:42,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-13 10:00:42,874 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-13 10:00:42,874 INFO L175 Difference]: Start difference. First operand has 684 places, 692 transitions, 1394 flow. Second operand 3 states and 2146 transitions. [2024-10-13 10:00:42,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 685 places, 691 transitions, 1428 flow [2024-10-13 10:00:42,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 683 places, 691 transitions, 1424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:42,885 INFO L231 Difference]: Finished difference. Result has 683 places, 691 transitions, 1392 flow [2024-10-13 10:00:42,886 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-13 10:00:42,888 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -75 predicate places. [2024-10-13 10:00:42,889 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 691 transitions, 1392 flow [2024-10-13 10:00:42,890 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-13 10:00:42,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:42,891 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-13 10:00:42,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:00:42,891 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-13 10:00:42,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:42,891 INFO L85 PathProgramCache]: Analyzing trace with hash 177217485, now seen corresponding path program 1 times [2024-10-13 10:00:42,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:42,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904277569] [2024-10-13 10:00:42,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:42,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:42,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:42,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904277569] [2024-10-13 10:00:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904277569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91880104] [2024-10-13 10:00:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:42,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:42,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:42,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:42,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:42,967 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-13 10:00:42,970 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-13 10:00:42,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:42,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-13 10:00:42,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:43,350 INFO L124 PetriNetUnfolderBase]: 83/1715 cut-off events. [2024-10-13 10:00:43,350 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-13 10:00:43,360 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-13 10:00:43,369 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 21 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2024-10-13 10:00:43,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 697 transitions, 1456 flow [2024-10-13 10:00:43,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:43,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:43,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2159 transitions. [2024-10-13 10:00:43,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8906765676567657 [2024-10-13 10:00:43,375 INFO L175 Difference]: Start difference. First operand has 683 places, 691 transitions, 1392 flow. Second operand 3 states and 2159 transitions. [2024-10-13 10:00:43,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 697 transitions, 1456 flow [2024-10-13 10:00:43,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 697 transitions, 1452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:43,388 INFO L231 Difference]: Finished difference. Result has 683 places, 691 transitions, 1404 flow [2024-10-13 10:00:43,389 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-13 10:00:43,390 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -75 predicate places. [2024-10-13 10:00:43,390 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 691 transitions, 1404 flow [2024-10-13 10:00:43,392 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-13 10:00:43,392 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:43,392 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-13 10:00:43,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:00:43,392 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-13 10:00:43,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash 125491133, now seen corresponding path program 1 times [2024-10-13 10:00:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:43,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269654036] [2024-10-13 10:00:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:43,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:43,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:43,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269654036] [2024-10-13 10:00:43,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269654036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:43,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:43,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:43,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486835121] [2024-10-13 10:00:43,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:43,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:43,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:43,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:43,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:43,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 808 [2024-10-13 10:00:43,504 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-13 10:00:43,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:43,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 808 [2024-10-13 10:00:43,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:43,850 INFO L124 PetriNetUnfolderBase]: 220/1479 cut-off events. [2024-10-13 10:00:43,851 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-10-13 10:00:43,858 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-13 10:00:43,863 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 20 selfloop transitions, 2 changer transitions 0/690 dead transitions. [2024-10-13 10:00:43,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 690 transitions, 1446 flow [2024-10-13 10:00:43,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2024-10-13 10:00:43,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828382838283828 [2024-10-13 10:00:43,868 INFO L175 Difference]: Start difference. First operand has 683 places, 691 transitions, 1404 flow. Second operand 3 states and 2140 transitions. [2024-10-13 10:00:43,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 690 transitions, 1446 flow [2024-10-13 10:00:43,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 690 transitions, 1440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:43,884 INFO L231 Difference]: Finished difference. Result has 682 places, 690 transitions, 1400 flow [2024-10-13 10:00:43,886 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-13 10:00:43,887 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -76 predicate places. [2024-10-13 10:00:43,888 INFO L471 AbstractCegarLoop]: Abstraction has has 682 places, 690 transitions, 1400 flow [2024-10-13 10:00:43,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-13 10:00:43,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:43,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] [2024-10-13 10:00:43,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 10:00:43,890 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-13 10:00:43,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:43,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1661568552, now seen corresponding path program 1 times [2024-10-13 10:00:43,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:43,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879467069] [2024-10-13 10:00:43,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:43,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:43,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:43,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:43,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879467069] [2024-10-13 10:00:43,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879467069] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:43,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525348539] [2024-10-13 10:00:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:43,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:43,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:43,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:43,959 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 808 [2024-10-13 10:00:43,961 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-13 10:00:43,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:43,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 808 [2024-10-13 10:00:43,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:44,149 INFO L124 PetriNetUnfolderBase]: 64/982 cut-off events. [2024-10-13 10:00:44,150 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-13 10:00:44,157 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-13 10:00:44,163 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 2 changer transitions 0/689 dead transitions. [2024-10-13 10:00:44,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 683 places, 689 transitions, 1434 flow [2024-10-13 10:00:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2148 transitions. [2024-10-13 10:00:44,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861386138613861 [2024-10-13 10:00:44,169 INFO L175 Difference]: Start difference. First operand has 682 places, 690 transitions, 1400 flow. Second operand 3 states and 2148 transitions. [2024-10-13 10:00:44,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 683 places, 689 transitions, 1434 flow [2024-10-13 10:00:44,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 681 places, 689 transitions, 1430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:44,181 INFO L231 Difference]: Finished difference. Result has 681 places, 689 transitions, 1398 flow [2024-10-13 10:00:44,182 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-13 10:00:44,183 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -77 predicate places. [2024-10-13 10:00:44,183 INFO L471 AbstractCegarLoop]: Abstraction has has 681 places, 689 transitions, 1398 flow [2024-10-13 10:00:44,184 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-13 10:00:44,184 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:44,185 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-13 10:00:44,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:00:44,185 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-13 10:00:44,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:44,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1431674143, now seen corresponding path program 1 times [2024-10-13 10:00:44,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:44,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684570042] [2024-10-13 10:00:44,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:44,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:44,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:44,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:44,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684570042] [2024-10-13 10:00:44,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684570042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:44,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:44,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:44,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524446531] [2024-10-13 10:00:44,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:44,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:44,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:44,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:44,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:44,247 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-13 10:00:44,249 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-13 10:00:44,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:44,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-13 10:00:44,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:44,457 INFO L124 PetriNetUnfolderBase]: 103/1105 cut-off events. [2024-10-13 10:00:44,457 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-13 10:00:44,464 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-13 10:00:44,469 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/688 dead transitions. [2024-10-13 10:00:44,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 688 transitions, 1434 flow [2024-10-13 10:00:44,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-13 10:00:44,474 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-13 10:00:44,475 INFO L175 Difference]: Start difference. First operand has 681 places, 689 transitions, 1398 flow. Second operand 3 states and 2146 transitions. [2024-10-13 10:00:44,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 688 transitions, 1434 flow [2024-10-13 10:00:44,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 680 places, 688 transitions, 1430 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:44,485 INFO L231 Difference]: Finished difference. Result has 680 places, 688 transitions, 1396 flow [2024-10-13 10:00:44,486 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-13 10:00:44,487 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -78 predicate places. [2024-10-13 10:00:44,487 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 688 transitions, 1396 flow [2024-10-13 10:00:44,489 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-13 10:00:44,489 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:44,489 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:44,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:00:44,489 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-13 10:00:44,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:44,490 INFO L85 PathProgramCache]: Analyzing trace with hash -569978944, now seen corresponding path program 1 times [2024-10-13 10:00:44,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:44,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760569266] [2024-10-13 10:00:44,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:44,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:44,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:44,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:44,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:44,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760569266] [2024-10-13 10:00:44,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760569266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:44,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19780239] [2024-10-13 10:00:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:44,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:44,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:44,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:44,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:44,573 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 707 out of 808 [2024-10-13 10:00:44,576 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-13 10:00:44,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:44,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 707 of 808 [2024-10-13 10:00:44,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:44,796 INFO L124 PetriNetUnfolderBase]: 124/1152 cut-off events. [2024-10-13 10:00:44,796 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-13 10:00:44,806 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-13 10:00:44,812 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 19 selfloop transitions, 2 changer transitions 0/687 dead transitions. [2024-10-13 10:00:44,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 681 places, 687 transitions, 1436 flow [2024-10-13 10:00:44,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:44,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:44,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2142 transitions. [2024-10-13 10:00:44,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8836633663366337 [2024-10-13 10:00:44,818 INFO L175 Difference]: Start difference. First operand has 680 places, 688 transitions, 1396 flow. Second operand 3 states and 2142 transitions. [2024-10-13 10:00:44,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 681 places, 687 transitions, 1436 flow [2024-10-13 10:00:44,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 687 transitions, 1432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:44,829 INFO L231 Difference]: Finished difference. Result has 679 places, 687 transitions, 1394 flow [2024-10-13 10:00:44,830 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-13 10:00:44,831 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -79 predicate places. [2024-10-13 10:00:44,832 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 687 transitions, 1394 flow [2024-10-13 10:00:44,834 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-13 10:00:44,834 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:44,834 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-13 10:00:44,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:00:44,834 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-13 10:00:44,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:44,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1912345871, now seen corresponding path program 1 times [2024-10-13 10:00:44,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:44,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466625450] [2024-10-13 10:00:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:44,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:44,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:44,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466625450] [2024-10-13 10:00:44,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466625450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:44,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:44,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:44,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916376767] [2024-10-13 10:00:44,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:44,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:44,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:44,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:44,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:44,908 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 808 [2024-10-13 10:00:44,911 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-13 10:00:44,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:44,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 808 [2024-10-13 10:00:44,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:45,131 INFO L124 PetriNetUnfolderBase]: 103/1103 cut-off events. [2024-10-13 10:00:45,131 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-13 10:00:45,139 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-13 10:00:45,144 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 20 selfloop transitions, 2 changer transitions 0/686 dead transitions. [2024-10-13 10:00:45,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 686 transitions, 1436 flow [2024-10-13 10:00:45,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:45,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:45,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2140 transitions. [2024-10-13 10:00:45,150 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8828382838283828 [2024-10-13 10:00:45,150 INFO L175 Difference]: Start difference. First operand has 679 places, 687 transitions, 1394 flow. Second operand 3 states and 2140 transitions. [2024-10-13 10:00:45,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 686 transitions, 1436 flow [2024-10-13 10:00:45,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 686 transitions, 1432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:45,161 INFO L231 Difference]: Finished difference. Result has 678 places, 686 transitions, 1392 flow [2024-10-13 10:00:45,162 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-13 10:00:45,162 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -80 predicate places. [2024-10-13 10:00:45,163 INFO L471 AbstractCegarLoop]: Abstraction has has 678 places, 686 transitions, 1392 flow [2024-10-13 10:00:45,164 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-13 10:00:45,164 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:45,164 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-13 10:00:45,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:00:45,165 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-13 10:00:45,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1515342057, now seen corresponding path program 1 times [2024-10-13 10:00:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352222178] [2024-10-13 10:00:45,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:45,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:45,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:45,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352222178] [2024-10-13 10:00:45,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352222178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:45,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:45,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:45,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614787329] [2024-10-13 10:00:45,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:45,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:45,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:45,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:45,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:45,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-13 10:00:45,229 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-13 10:00:45,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:45,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-13 10:00:45,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:45,464 INFO L124 PetriNetUnfolderBase]: 103/1102 cut-off events. [2024-10-13 10:00:45,464 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-13 10:00:45,470 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-13 10:00:45,474 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/685 dead transitions. [2024-10-13 10:00:45,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 679 places, 685 transitions, 1428 flow [2024-10-13 10:00:45,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:45,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-13 10:00:45,480 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-13 10:00:45,480 INFO L175 Difference]: Start difference. First operand has 678 places, 686 transitions, 1392 flow. Second operand 3 states and 2146 transitions. [2024-10-13 10:00:45,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 679 places, 685 transitions, 1428 flow [2024-10-13 10:00:45,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 677 places, 685 transitions, 1424 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:45,489 INFO L231 Difference]: Finished difference. Result has 677 places, 685 transitions, 1390 flow [2024-10-13 10:00:45,490 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-13 10:00:45,491 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -81 predicate places. [2024-10-13 10:00:45,491 INFO L471 AbstractCegarLoop]: Abstraction has has 677 places, 685 transitions, 1390 flow [2024-10-13 10:00:45,493 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-13 10:00:45,493 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:45,493 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-13 10:00:45,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 10:00:45,493 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-13 10:00:45,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:45,495 INFO L85 PathProgramCache]: Analyzing trace with hash 533166846, now seen corresponding path program 1 times [2024-10-13 10:00:45,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:45,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730529218] [2024-10-13 10:00:45,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:45,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:45,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:45,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:45,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730529218] [2024-10-13 10:00:45,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730529218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:45,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:45,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:45,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437368338] [2024-10-13 10:00:45,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:45,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:45,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:45,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:45,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:45,545 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-13 10:00:45,547 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-13 10:00:45,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:45,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-13 10:00:45,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:46,388 INFO L124 PetriNetUnfolderBase]: 228/4387 cut-off events. [2024-10-13 10:00:46,388 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-13 10:00:46,410 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-13 10:00:46,428 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 1 changer transitions 0/683 dead transitions. [2024-10-13 10:00:46,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 677 places, 683 transitions, 1420 flow [2024-10-13 10:00:46,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:46,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2151 transitions. [2024-10-13 10:00:46,433 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873762376237624 [2024-10-13 10:00:46,434 INFO L175 Difference]: Start difference. First operand has 677 places, 685 transitions, 1390 flow. Second operand 3 states and 2151 transitions. [2024-10-13 10:00:46,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 677 places, 683 transitions, 1420 flow [2024-10-13 10:00:46,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 683 transitions, 1416 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:46,445 INFO L231 Difference]: Finished difference. Result has 675 places, 683 transitions, 1384 flow [2024-10-13 10:00:46,446 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-13 10:00:46,447 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -83 predicate places. [2024-10-13 10:00:46,447 INFO L471 AbstractCegarLoop]: Abstraction has has 675 places, 683 transitions, 1384 flow [2024-10-13 10:00:46,449 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-13 10:00:46,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:46,449 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-13 10:00:46,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 10:00:46,449 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-13 10:00:46,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:46,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1110974690, now seen corresponding path program 1 times [2024-10-13 10:00:46,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:46,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573709070] [2024-10-13 10:00:46,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:46,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:46,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573709070] [2024-10-13 10:00:46,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573709070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:46,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:46,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:00:46,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061119827] [2024-10-13 10:00:46,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:46,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:00:46,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:46,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:00:46,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:00:47,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 808 [2024-10-13 10:00:47,467 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-13 10:00:47,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:47,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 808 [2024-10-13 10:00:47,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:49,541 INFO L124 PetriNetUnfolderBase]: 2034/9305 cut-off events. [2024-10-13 10:00:49,542 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-10-13 10:00:49,577 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-13 10:00:49,706 INFO L140 encePairwiseOnDemand]: 784/808 looper letters, 78 selfloop transitions, 20 changer transitions 0/679 dead transitions. [2024-10-13 10:00:49,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 679 transitions, 1572 flow [2024-10-13 10:00:49,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:00:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:00:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3869 transitions. [2024-10-13 10:00:49,716 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7980610561056105 [2024-10-13 10:00:49,716 INFO L175 Difference]: Start difference. First operand has 675 places, 683 transitions, 1384 flow. Second operand 6 states and 3869 transitions. [2024-10-13 10:00:49,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 679 transitions, 1572 flow [2024-10-13 10:00:49,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 675 places, 679 transitions, 1571 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:49,729 INFO L231 Difference]: Finished difference. Result has 675 places, 679 transitions, 1415 flow [2024-10-13 10:00:49,730 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-13 10:00:49,731 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -83 predicate places. [2024-10-13 10:00:49,731 INFO L471 AbstractCegarLoop]: Abstraction has has 675 places, 679 transitions, 1415 flow [2024-10-13 10:00:49,738 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-13 10:00:49,739 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:49,739 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-13 10:00:49,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 10:00:49,739 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-13 10:00:49,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:49,739 INFO L85 PathProgramCache]: Analyzing trace with hash -801660191, now seen corresponding path program 1 times [2024-10-13 10:00:49,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:49,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102953912] [2024-10-13 10:00:49,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:49,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:49,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:49,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:49,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102953912] [2024-10-13 10:00:49,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102953912] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:49,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:49,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:49,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409045976] [2024-10-13 10:00:49,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:49,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:49,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:49,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:49,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:49,820 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-13 10:00:49,827 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-13 10:00:49,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:49,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-13 10:00:49,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:50,091 INFO L124 PetriNetUnfolderBase]: 181/1343 cut-off events. [2024-10-13 10:00:50,091 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-10-13 10:00:50,100 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-13 10:00:50,107 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 18 selfloop transitions, 2 changer transitions 0/678 dead transitions. [2024-10-13 10:00:50,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 676 places, 678 transitions, 1453 flow [2024-10-13 10:00:50,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:50,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2144 transitions. [2024-10-13 10:00:50,112 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8844884488448845 [2024-10-13 10:00:50,112 INFO L175 Difference]: Start difference. First operand has 675 places, 679 transitions, 1415 flow. Second operand 3 states and 2144 transitions. [2024-10-13 10:00:50,112 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 676 places, 678 transitions, 1453 flow [2024-10-13 10:00:50,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 671 places, 678 transitions, 1413 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:00:50,124 INFO L231 Difference]: Finished difference. Result has 671 places, 678 transitions, 1377 flow [2024-10-13 10:00:50,126 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-13 10:00:50,127 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -87 predicate places. [2024-10-13 10:00:50,127 INFO L471 AbstractCegarLoop]: Abstraction has has 671 places, 678 transitions, 1377 flow [2024-10-13 10:00:50,128 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-13 10:00:50,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:50,129 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:00:50,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 10:00:50,129 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-13 10:00:50,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:50,129 INFO L85 PathProgramCache]: Analyzing trace with hash -666293938, now seen corresponding path program 1 times [2024-10-13 10:00:50,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298928698] [2024-10-13 10:00:50,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:50,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:50,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:50,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298928698] [2024-10-13 10:00:50,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298928698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:50,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:50,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:50,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019097826] [2024-10-13 10:00:50,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:50,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:50,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:50,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:50,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:50,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 705 out of 808 [2024-10-13 10:00:50,198 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-13 10:00:50,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:50,199 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 705 of 808 [2024-10-13 10:00:50,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:51,490 INFO L124 PetriNetUnfolderBase]: 336/6174 cut-off events. [2024-10-13 10:00:51,490 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-13 10:00:51,509 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-13 10:00:51,528 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 20 selfloop transitions, 1 changer transitions 0/674 dead transitions. [2024-10-13 10:00:51,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 669 places, 674 transitions, 1411 flow [2024-10-13 10:00:51,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:51,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:51,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2139 transitions. [2024-10-13 10:00:51,534 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8824257425742574 [2024-10-13 10:00:51,535 INFO L175 Difference]: Start difference. First operand has 671 places, 678 transitions, 1377 flow. Second operand 3 states and 2139 transitions. [2024-10-13 10:00:51,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 669 places, 674 transitions, 1411 flow [2024-10-13 10:00:51,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 674 transitions, 1407 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:51,545 INFO L231 Difference]: Finished difference. Result has 667 places, 674 transitions, 1367 flow [2024-10-13 10:00:51,546 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-13 10:00:51,546 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -91 predicate places. [2024-10-13 10:00:51,547 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 674 transitions, 1367 flow [2024-10-13 10:00:51,549 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-13 10:00:51,549 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:51,550 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-13 10:00:51,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 10:00:51,550 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-13 10:00:51,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:51,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1310710705, now seen corresponding path program 1 times [2024-10-13 10:00:51,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:51,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803187700] [2024-10-13 10:00:51,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:51,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:51,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:51,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803187700] [2024-10-13 10:00:51,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803187700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:51,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:51,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876173688] [2024-10-13 10:00:51,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:51,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:51,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:51,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:51,634 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-13 10:00:51,637 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-13 10:00:51,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:51,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-13 10:00:51,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:51,891 INFO L124 PetriNetUnfolderBase]: 124/1133 cut-off events. [2024-10-13 10:00:51,891 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-10-13 10:00:51,896 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-13 10:00:51,902 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2024-10-13 10:00:51,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 673 transitions, 1403 flow [2024-10-13 10:00:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:51,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:51,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-13 10:00:51,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-13 10:00:51,908 INFO L175 Difference]: Start difference. First operand has 667 places, 674 transitions, 1367 flow. Second operand 3 states and 2146 transitions. [2024-10-13 10:00:51,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 673 transitions, 1403 flow [2024-10-13 10:00:51,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 673 transitions, 1402 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:51,920 INFO L231 Difference]: Finished difference. Result has 667 places, 673 transitions, 1368 flow [2024-10-13 10:00:51,921 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-13 10:00:51,922 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -91 predicate places. [2024-10-13 10:00:51,922 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 673 transitions, 1368 flow [2024-10-13 10:00:51,923 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-13 10:00:51,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:51,923 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-13 10:00:51,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 10:00:51,923 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-13 10:00:51,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:51,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1116503893, now seen corresponding path program 1 times [2024-10-13 10:00:51,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:51,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68348872] [2024-10-13 10:00:51,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:51,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:51,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:51,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:51,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:51,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68348872] [2024-10-13 10:00:51,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68348872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:51,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:51,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:51,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076019040] [2024-10-13 10:00:51,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:51,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:51,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:51,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:51,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:51,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 808 [2024-10-13 10:00:51,989 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-13 10:00:51,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:51,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 808 [2024-10-13 10:00:51,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:52,207 INFO L124 PetriNetUnfolderBase]: 64/961 cut-off events. [2024-10-13 10:00:52,207 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-13 10:00:52,213 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-13 10:00:52,217 INFO L140 encePairwiseOnDemand]: 806/808 looper letters, 14 selfloop transitions, 1 changer transitions 0/672 dead transitions. [2024-10-13 10:00:52,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 672 transitions, 1396 flow [2024-10-13 10:00:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:52,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2157 transitions. [2024-10-13 10:00:52,223 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8898514851485149 [2024-10-13 10:00:52,223 INFO L175 Difference]: Start difference. First operand has 667 places, 673 transitions, 1368 flow. Second operand 3 states and 2157 transitions. [2024-10-13 10:00:52,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 672 transitions, 1396 flow [2024-10-13 10:00:52,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 672 transitions, 1392 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:52,235 INFO L231 Difference]: Finished difference. Result has 666 places, 672 transitions, 1364 flow [2024-10-13 10:00:52,235 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-13 10:00:52,236 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -92 predicate places. [2024-10-13 10:00:52,236 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 672 transitions, 1364 flow [2024-10-13 10:00:52,236 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-13 10:00:52,237 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:52,237 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-13 10:00:52,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 10:00:52,237 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-13 10:00:52,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:52,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1545101691, now seen corresponding path program 1 times [2024-10-13 10:00:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:52,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282952801] [2024-10-13 10:00:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:52,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:52,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:52,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:52,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282952801] [2024-10-13 10:00:52,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282952801] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:52,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:52,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:52,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741127357] [2024-10-13 10:00:52,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:52,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:52,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:52,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:52,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:52,321 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-13 10:00:52,323 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-13 10:00:52,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:52,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-13 10:00:52,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:52,559 INFO L124 PetriNetUnfolderBase]: 64/960 cut-off events. [2024-10-13 10:00:52,559 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-10-13 10:00:52,567 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-13 10:00:52,572 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 15 selfloop transitions, 2 changer transitions 0/671 dead transitions. [2024-10-13 10:00:52,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 671 transitions, 1396 flow [2024-10-13 10:00:52,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:52,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2150 transitions. [2024-10-13 10:00:52,577 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.886963696369637 [2024-10-13 10:00:52,577 INFO L175 Difference]: Start difference. First operand has 666 places, 672 transitions, 1364 flow. Second operand 3 states and 2150 transitions. [2024-10-13 10:00:52,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 671 transitions, 1396 flow [2024-10-13 10:00:52,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 671 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:52,588 INFO L231 Difference]: Finished difference. Result has 666 places, 671 transitions, 1365 flow [2024-10-13 10:00:52,588 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-13 10:00:52,589 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -92 predicate places. [2024-10-13 10:00:52,589 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 671 transitions, 1365 flow [2024-10-13 10:00:52,590 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-13 10:00:52,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:52,590 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-13 10:00:52,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 10:00:52,591 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-13 10:00:52,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:52,591 INFO L85 PathProgramCache]: Analyzing trace with hash 265964137, now seen corresponding path program 1 times [2024-10-13 10:00:52,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866126515] [2024-10-13 10:00:52,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:52,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:52,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:52,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:52,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866126515] [2024-10-13 10:00:52,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866126515] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:52,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:52,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:52,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543966696] [2024-10-13 10:00:52,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:52,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:52,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:52,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:52,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:52,929 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 808 [2024-10-13 10:00:52,931 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-13 10:00:52,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:52,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 808 [2024-10-13 10:00:52,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:54,562 INFO L124 PetriNetUnfolderBase]: 2034/9258 cut-off events. [2024-10-13 10:00:54,562 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-10-13 10:00:54,594 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-13 10:00:54,620 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 69 selfloop transitions, 2 changer transitions 0/670 dead transitions. [2024-10-13 10:00:54,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 670 transitions, 1505 flow [2024-10-13 10:00:54,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2045 transitions. [2024-10-13 10:00:54,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8436468646864687 [2024-10-13 10:00:54,625 INFO L175 Difference]: Start difference. First operand has 666 places, 671 transitions, 1365 flow. Second operand 3 states and 2045 transitions. [2024-10-13 10:00:54,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 670 transitions, 1505 flow [2024-10-13 10:00:54,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 665 places, 670 transitions, 1501 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:54,635 INFO L231 Difference]: Finished difference. Result has 665 places, 670 transitions, 1363 flow [2024-10-13 10:00:54,636 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-13 10:00:54,636 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -93 predicate places. [2024-10-13 10:00:54,637 INFO L471 AbstractCegarLoop]: Abstraction has has 665 places, 670 transitions, 1363 flow [2024-10-13 10:00:54,637 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-13 10:00:54,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:54,638 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-13 10:00:54,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 10:00:54,638 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-13 10:00:54,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:54,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1153325754, now seen corresponding path program 1 times [2024-10-13 10:00:54,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:54,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824417457] [2024-10-13 10:00:54,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:54,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:54,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:54,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:54,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:54,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824417457] [2024-10-13 10:00:54,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824417457] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:54,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:54,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:54,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623553400] [2024-10-13 10:00:54,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:54,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:54,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:54,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:54,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:54,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 808 [2024-10-13 10:00:54,717 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-13 10:00:54,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:54,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 808 [2024-10-13 10:00:54,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:54,988 INFO L124 PetriNetUnfolderBase]: 103/1081 cut-off events. [2024-10-13 10:00:54,988 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-13 10:00:54,994 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-13 10:00:54,998 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 16 selfloop transitions, 2 changer transitions 0/669 dead transitions. [2024-10-13 10:00:54,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 669 transitions, 1397 flow [2024-10-13 10:00:54,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:54,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2148 transitions. [2024-10-13 10:00:55,003 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861386138613861 [2024-10-13 10:00:55,003 INFO L175 Difference]: Start difference. First operand has 665 places, 670 transitions, 1363 flow. Second operand 3 states and 2148 transitions. [2024-10-13 10:00:55,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 669 transitions, 1397 flow [2024-10-13 10:00:55,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 669 transitions, 1393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:55,012 INFO L231 Difference]: Finished difference. Result has 664 places, 669 transitions, 1361 flow [2024-10-13 10:00:55,013 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-13 10:00:55,013 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -94 predicate places. [2024-10-13 10:00:55,014 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 669 transitions, 1361 flow [2024-10-13 10:00:55,014 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-13 10:00:55,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:55,015 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-13 10:00:55,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 10:00:55,015 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-13 10:00:55,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:55,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1206589921, now seen corresponding path program 1 times [2024-10-13 10:00:55,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:55,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680124003] [2024-10-13 10:00:55,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:55,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680124003] [2024-10-13 10:00:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680124003] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822625590] [2024-10-13 10:00:55,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:55,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:55,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:55,089 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 702 out of 808 [2024-10-13 10:00:55,091 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-13 10:00:55,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:55,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 702 of 808 [2024-10-13 10:00:55,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:55,672 INFO L124 PetriNetUnfolderBase]: 228/4329 cut-off events. [2024-10-13 10:00:55,673 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-10-13 10:00:55,693 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-13 10:00:55,706 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 22 selfloop transitions, 1 changer transitions 0/664 dead transitions. [2024-10-13 10:00:55,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 664 transitions, 1397 flow [2024-10-13 10:00:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:55,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2133 transitions. [2024-10-13 10:00:55,710 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.879950495049505 [2024-10-13 10:00:55,710 INFO L175 Difference]: Start difference. First operand has 664 places, 669 transitions, 1361 flow. Second operand 3 states and 2133 transitions. [2024-10-13 10:00:55,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 664 transitions, 1397 flow [2024-10-13 10:00:55,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 664 transitions, 1393 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:55,721 INFO L231 Difference]: Finished difference. Result has 659 places, 664 transitions, 1349 flow [2024-10-13 10:00:55,722 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-13 10:00:55,722 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -99 predicate places. [2024-10-13 10:00:55,723 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 664 transitions, 1349 flow [2024-10-13 10:00:55,723 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-13 10:00:55,723 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:55,724 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-13 10:00:55,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 10:00:55,724 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-13 10:00:55,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:55,725 INFO L85 PathProgramCache]: Analyzing trace with hash -628923738, now seen corresponding path program 1 times [2024-10-13 10:00:55,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:55,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292857645] [2024-10-13 10:00:55,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:55,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:55,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-13 10:00:55,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:55,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292857645] [2024-10-13 10:00:55,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292857645] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:55,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:55,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78987455] [2024-10-13 10:00:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:55,810 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 709 out of 808 [2024-10-13 10:00:55,812 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-13 10:00:55,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:55,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 709 of 808 [2024-10-13 10:00:55,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:56,024 INFO L124 PetriNetUnfolderBase]: 103/1075 cut-off events. [2024-10-13 10:00:56,024 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-13 10:00:56,030 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-13 10:00:56,032 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 17 selfloop transitions, 2 changer transitions 0/663 dead transitions. [2024-10-13 10:00:56,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 663 transitions, 1385 flow [2024-10-13 10:00:56,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:56,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:56,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2146 transitions. [2024-10-13 10:00:56,037 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8853135313531353 [2024-10-13 10:00:56,037 INFO L175 Difference]: Start difference. First operand has 659 places, 664 transitions, 1349 flow. Second operand 3 states and 2146 transitions. [2024-10-13 10:00:56,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 663 transitions, 1385 flow [2024-10-13 10:00:56,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 663 transitions, 1384 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:56,047 INFO L231 Difference]: Finished difference. Result has 659 places, 663 transitions, 1350 flow [2024-10-13 10:00:56,048 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-13 10:00:56,048 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -99 predicate places. [2024-10-13 10:00:56,049 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 663 transitions, 1350 flow [2024-10-13 10:00:56,049 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-13 10:00:56,049 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:56,050 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-13 10:00:56,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 10:00:56,050 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-13 10:00:56,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash -660005856, now seen corresponding path program 1 times [2024-10-13 10:00:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088593668] [2024-10-13 10:00:56,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:56,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:56,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:56,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088593668] [2024-10-13 10:00:56,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088593668] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:56,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:56,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:56,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438338098] [2024-10-13 10:00:56,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:56,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:56,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:56,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:56,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:56,129 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-13 10:00:56,131 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-13 10:00:56,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:56,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-13 10:00:56,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:56,719 INFO L124 PetriNetUnfolderBase]: 267/4575 cut-off events. [2024-10-13 10:00:56,720 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-10-13 10:00:56,737 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-13 10:00:56,837 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 26 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-10-13 10:00:56,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1436 flow [2024-10-13 10:00:56,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:56,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:56,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2163 transitions. [2024-10-13 10:00:56,841 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8923267326732673 [2024-10-13 10:00:56,841 INFO L175 Difference]: Start difference. First operand has 659 places, 663 transitions, 1350 flow. Second operand 3 states and 2163 transitions. [2024-10-13 10:00:56,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1436 flow [2024-10-13 10:00:56,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1432 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:00:56,850 INFO L231 Difference]: Finished difference. Result has 658 places, 664 transitions, 1365 flow [2024-10-13 10:00:56,850 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-13 10:00:56,851 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -100 predicate places. [2024-10-13 10:00:56,851 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 664 transitions, 1365 flow [2024-10-13 10:00:56,852 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-13 10:00:56,852 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:56,852 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-13 10:00:56,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 10:00:56,852 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-13 10:00:56,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:56,853 INFO L85 PathProgramCache]: Analyzing trace with hash 1389606881, now seen corresponding path program 1 times [2024-10-13 10:00:56,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:56,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994496759] [2024-10-13 10:00:56,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:56,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:56,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:56,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994496759] [2024-10-13 10:00:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994496759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:56,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:56,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547407642] [2024-10-13 10:00:56,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:56,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:56,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:56,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:56,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:56,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-13 10:00:56,924 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-13 10:00:56,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:56,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-13 10:00:56,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:57,577 INFO L124 PetriNetUnfolderBase]: 318/4465 cut-off events. [2024-10-13 10:00:57,577 INFO L125 PetriNetUnfolderBase]: For 183/237 co-relation queries the response was YES. [2024-10-13 10:00:57,603 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-13 10:00:57,616 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 27 selfloop transitions, 4 changer transitions 0/675 dead transitions. [2024-10-13 10:00:57,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 675 transitions, 1464 flow [2024-10-13 10:00:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2163 transitions. [2024-10-13 10:00:57,619 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8923267326732673 [2024-10-13 10:00:57,619 INFO L175 Difference]: Start difference. First operand has 658 places, 664 transitions, 1365 flow. Second operand 3 states and 2163 transitions. [2024-10-13 10:00:57,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 675 transitions, 1464 flow [2024-10-13 10:00:57,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 675 transitions, 1464 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:57,627 INFO L231 Difference]: Finished difference. Result has 659 places, 666 transitions, 1398 flow [2024-10-13 10:00:57,628 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-13 10:00:57,629 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -99 predicate places. [2024-10-13 10:00:57,629 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 666 transitions, 1398 flow [2024-10-13 10:00:57,630 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-13 10:00:57,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:57,630 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-13 10:00:57,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 10:00:57,630 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-13 10:00:57,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1350032944, now seen corresponding path program 1 times [2024-10-13 10:00:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:57,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501125373] [2024-10-13 10:00:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:57,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:57,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:57,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:57,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501125373] [2024-10-13 10:00:57,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501125373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:57,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:57,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:57,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322308149] [2024-10-13 10:00:57,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:57,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:57,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:57,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:57,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:57,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 715 out of 808 [2024-10-13 10:00:57,699 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-13 10:00:57,699 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:57,699 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 715 of 808 [2024-10-13 10:00:57,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:58,134 INFO L124 PetriNetUnfolderBase]: 229/2791 cut-off events. [2024-10-13 10:00:58,135 INFO L125 PetriNetUnfolderBase]: For 419/771 co-relation queries the response was YES. [2024-10-13 10:00:58,155 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-13 10:00:58,166 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 23 selfloop transitions, 4 changer transitions 0/675 dead transitions. [2024-10-13 10:00:58,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 675 transitions, 1502 flow [2024-10-13 10:00:58,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:58,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2165 transitions. [2024-10-13 10:00:58,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8931518151815182 [2024-10-13 10:00:58,169 INFO L175 Difference]: Start difference. First operand has 659 places, 666 transitions, 1398 flow. Second operand 3 states and 2165 transitions. [2024-10-13 10:00:58,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 675 transitions, 1502 flow [2024-10-13 10:00:58,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 675 transitions, 1502 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:00:58,175 INFO L231 Difference]: Finished difference. Result has 661 places, 668 transitions, 1420 flow [2024-10-13 10:00:58,176 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-13 10:00:58,177 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -97 predicate places. [2024-10-13 10:00:58,177 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 668 transitions, 1420 flow [2024-10-13 10:00:58,177 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-13 10:00:58,177 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:58,177 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-13 10:00:58,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 10:00:58,178 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-13 10:00:58,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:58,178 INFO L85 PathProgramCache]: Analyzing trace with hash -466383547, now seen corresponding path program 1 times [2024-10-13 10:00:58,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:58,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856514991] [2024-10-13 10:00:58,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:58,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:58,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:58,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:58,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856514991] [2024-10-13 10:00:58,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856514991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:58,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:58,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:58,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058298995] [2024-10-13 10:00:58,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:58,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:58,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:58,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:58,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:58,265 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 808 [2024-10-13 10:00:58,266 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-13 10:00:58,267 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:58,267 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 808 [2024-10-13 10:00:58,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:00:59,544 INFO L124 PetriNetUnfolderBase]: 526/7120 cut-off events. [2024-10-13 10:00:59,544 INFO L125 PetriNetUnfolderBase]: For 840/886 co-relation queries the response was YES. [2024-10-13 10:00:59,580 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-13 10:00:59,601 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 30 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2024-10-13 10:00:59,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 679 transitions, 1544 flow [2024-10-13 10:00:59,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:00:59,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:00:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2164 transitions. [2024-10-13 10:00:59,605 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8927392739273927 [2024-10-13 10:00:59,605 INFO L175 Difference]: Start difference. First operand has 661 places, 668 transitions, 1420 flow. Second operand 3 states and 2164 transitions. [2024-10-13 10:00:59,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 679 transitions, 1544 flow [2024-10-13 10:00:59,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1537 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:00:59,616 INFO L231 Difference]: Finished difference. Result has 661 places, 667 transitions, 1418 flow [2024-10-13 10:00:59,617 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-13 10:00:59,618 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -97 predicate places. [2024-10-13 10:00:59,618 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 667 transitions, 1418 flow [2024-10-13 10:00:59,619 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-13 10:00:59,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:00:59,619 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-13 10:00:59,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 10:00:59,620 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-13 10:00:59,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:00:59,620 INFO L85 PathProgramCache]: Analyzing trace with hash 189925005, now seen corresponding path program 1 times [2024-10-13 10:00:59,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:00:59,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617776165] [2024-10-13 10:00:59,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:00:59,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:00:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:00:59,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:00:59,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:00:59,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617776165] [2024-10-13 10:00:59,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617776165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:00:59,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:00:59,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:00:59,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118264986] [2024-10-13 10:00:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:00:59,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:00:59,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:00:59,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:00:59,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:00:59,733 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 704 out of 808 [2024-10-13 10:00:59,739 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-13 10:00:59,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:00:59,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 704 of 808 [2024-10-13 10:00:59,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:01,192 INFO L124 PetriNetUnfolderBase]: 832/7577 cut-off events. [2024-10-13 10:01:01,192 INFO L125 PetriNetUnfolderBase]: For 1312/1380 co-relation queries the response was YES. [2024-10-13 10:01:01,234 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-13 10:01:01,260 INFO L140 encePairwiseOnDemand]: 801/808 looper letters, 34 selfloop transitions, 2 changer transitions 5/675 dead transitions. [2024-10-13 10:01:01,260 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 675 transitions, 1545 flow [2024-10-13 10:01:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:01,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2143 transitions. [2024-10-13 10:01:01,264 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.884075907590759 [2024-10-13 10:01:01,265 INFO L175 Difference]: Start difference. First operand has 661 places, 667 transitions, 1418 flow. Second operand 3 states and 2143 transitions. [2024-10-13 10:01:01,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 675 transitions, 1545 flow [2024-10-13 10:01:01,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 675 transitions, 1541 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:01,275 INFO L231 Difference]: Finished difference. Result has 657 places, 658 transitions, 1395 flow [2024-10-13 10:01:01,275 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-13 10:01:01,276 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -101 predicate places. [2024-10-13 10:01:01,276 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 658 transitions, 1395 flow [2024-10-13 10:01:01,277 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-13 10:01:01,277 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:01,277 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-13 10:01:01,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 10:01:01,277 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-13 10:01:01,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:01,278 INFO L85 PathProgramCache]: Analyzing trace with hash 51771163, now seen corresponding path program 1 times [2024-10-13 10:01:01,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:01,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159488443] [2024-10-13 10:01:01,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:01,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:01,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:01,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:01,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159488443] [2024-10-13 10:01:01,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159488443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:01,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:01,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:01,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974728313] [2024-10-13 10:01:01,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:01,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:01,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:01,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:01,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:01,398 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 711 out of 808 [2024-10-13 10:01:01,401 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-13 10:01:01,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:01,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 711 of 808 [2024-10-13 10:01:01,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:03,537 INFO L124 PetriNetUnfolderBase]: 729/10422 cut-off events. [2024-10-13 10:01:03,537 INFO L125 PetriNetUnfolderBase]: For 1088/1454 co-relation queries the response was YES. [2024-10-13 10:01:03,573 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-13 10:01:03,599 INFO L140 encePairwiseOnDemand]: 804/808 looper letters, 34 selfloop transitions, 2 changer transitions 0/671 dead transitions. [2024-10-13 10:01:03,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 671 transitions, 1533 flow [2024-10-13 10:01:03,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:03,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:03,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2160 transitions. [2024-10-13 10:01:03,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8910891089108911 [2024-10-13 10:01:03,601 INFO L175 Difference]: Start difference. First operand has 657 places, 658 transitions, 1395 flow. Second operand 3 states and 2160 transitions. [2024-10-13 10:01:03,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 671 transitions, 1533 flow [2024-10-13 10:01:03,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 671 transitions, 1529 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:03,610 INFO L231 Difference]: Finished difference. Result has 652 places, 658 transitions, 1401 flow [2024-10-13 10:01:03,610 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-13 10:01:03,611 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -106 predicate places. [2024-10-13 10:01:03,611 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 658 transitions, 1401 flow [2024-10-13 10:01:03,612 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-13 10:01:03,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:03,612 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:03,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 10:01:03,613 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-13 10:01:03,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:03,613 INFO L85 PathProgramCache]: Analyzing trace with hash 286383553, now seen corresponding path program 1 times [2024-10-13 10:01:03,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487417992] [2024-10-13 10:01:03,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:03,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:03,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:03,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487417992] [2024-10-13 10:01:03,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487417992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:03,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:03,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:01:03,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461159461] [2024-10-13 10:01:03,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:03,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:01:03,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:03,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:01:03,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:01:03,895 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 710 out of 808 [2024-10-13 10:01:03,897 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-13 10:01:03,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:03,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 710 of 808 [2024-10-13 10:01:03,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:05,386 INFO L124 PetriNetUnfolderBase]: 668/9477 cut-off events. [2024-10-13 10:01:05,386 INFO L125 PetriNetUnfolderBase]: For 1337/1531 co-relation queries the response was YES. [2024-10-13 10:01:05,455 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-13 10:01:05,490 INFO L140 encePairwiseOnDemand]: 801/808 looper letters, 35 selfloop transitions, 6 changer transitions 0/675 dead transitions. [2024-10-13 10:01:05,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 675 transitions, 1589 flow [2024-10-13 10:01:05,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:01:05,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-13 10:01:05,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 2868 transitions. [2024-10-13 10:01:05,493 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873762376237624 [2024-10-13 10:01:05,493 INFO L175 Difference]: Start difference. First operand has 652 places, 658 transitions, 1401 flow. Second operand 4 states and 2868 transitions. [2024-10-13 10:01:05,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 675 transitions, 1589 flow [2024-10-13 10:01:05,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 675 transitions, 1589 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:05,503 INFO L231 Difference]: Finished difference. Result has 655 places, 657 transitions, 1411 flow [2024-10-13 10:01:05,504 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-13 10:01:05,504 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -103 predicate places. [2024-10-13 10:01:05,505 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 657 transitions, 1411 flow [2024-10-13 10:01:05,505 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-13 10:01:05,506 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:05,506 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-13 10:01:05,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 10:01:05,506 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-13 10:01:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:05,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1167074290, now seen corresponding path program 1 times [2024-10-13 10:01:05,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518358824] [2024-10-13 10:01:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:05,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:05,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:05,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518358824] [2024-10-13 10:01:05,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518358824] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:05,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:05,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:05,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615846092] [2024-10-13 10:01:05,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:05,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:05,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:05,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:05,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 689 out of 808 [2024-10-13 10:01:05,618 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-13 10:01:05,618 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:05,618 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 689 of 808 [2024-10-13 10:01:05,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:07,761 INFO L124 PetriNetUnfolderBase]: 2520/14068 cut-off events. [2024-10-13 10:01:07,762 INFO L125 PetriNetUnfolderBase]: For 4635/4698 co-relation queries the response was YES. [2024-10-13 10:01:07,826 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-13 10:01:07,865 INFO L140 encePairwiseOnDemand]: 796/808 looper letters, 46 selfloop transitions, 3 changer transitions 0/661 dead transitions. [2024-10-13 10:01:07,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 661 transitions, 1554 flow [2024-10-13 10:01:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:07,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2114 transitions. [2024-10-13 10:01:07,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8721122112211221 [2024-10-13 10:01:07,868 INFO L175 Difference]: Start difference. First operand has 655 places, 657 transitions, 1411 flow. Second operand 3 states and 2114 transitions. [2024-10-13 10:01:07,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 661 transitions, 1554 flow [2024-10-13 10:01:07,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 661 transitions, 1540 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-13 10:01:07,876 INFO L231 Difference]: Finished difference. Result has 646 places, 649 transitions, 1394 flow [2024-10-13 10:01:07,877 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-13 10:01:07,877 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -112 predicate places. [2024-10-13 10:01:07,877 INFO L471 AbstractCegarLoop]: Abstraction has has 646 places, 649 transitions, 1394 flow [2024-10-13 10:01:07,878 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-13 10:01:07,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:07,878 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-13 10:01:07,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 10:01:07,879 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-13 10:01:07,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash 852871664, now seen corresponding path program 1 times [2024-10-13 10:01:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191981328] [2024-10-13 10:01:07,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:07,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:08,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:08,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191981328] [2024-10-13 10:01:08,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191981328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:08,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:08,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 10:01:08,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208801337] [2024-10-13 10:01:08,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:08,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:01:08,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:08,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:01:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:01:08,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 672 out of 808 [2024-10-13 10:01:08,647 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-13 10:01:08,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:08,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 672 of 808 [2024-10-13 10:01:08,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:10,095 INFO L124 PetriNetUnfolderBase]: 674/6719 cut-off events. [2024-10-13 10:01:10,095 INFO L125 PetriNetUnfolderBase]: For 1844/2869 co-relation queries the response was YES. [2024-10-13 10:01:10,167 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-13 10:01:10,200 INFO L140 encePairwiseOnDemand]: 797/808 looper letters, 94 selfloop transitions, 12 changer transitions 0/694 dead transitions. [2024-10-13 10:01:10,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 694 transitions, 1737 flow [2024-10-13 10:01:10,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:01:10,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-10-13 10:01:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6144 transitions. [2024-10-13 10:01:10,205 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8448844884488449 [2024-10-13 10:01:10,205 INFO L175 Difference]: Start difference. First operand has 646 places, 649 transitions, 1394 flow. Second operand 9 states and 6144 transitions. [2024-10-13 10:01:10,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 694 transitions, 1737 flow [2024-10-13 10:01:10,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 694 transitions, 1734 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 10:01:10,215 INFO L231 Difference]: Finished difference. Result has 656 places, 654 transitions, 1441 flow [2024-10-13 10:01:10,216 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-13 10:01:10,217 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -102 predicate places. [2024-10-13 10:01:10,217 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 654 transitions, 1441 flow [2024-10-13 10:01:10,219 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-13 10:01:10,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:10,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:10,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 10:01:10,219 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-13 10:01:10,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:10,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1474653682, now seen corresponding path program 1 times [2024-10-13 10:01:10,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:10,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410408250] [2024-10-13 10:01:10,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:10,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:10,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:10,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:10,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:10,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410408250] [2024-10-13 10:01:10,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410408250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:10,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:10,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:10,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667037878] [2024-10-13 10:01:10,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:10,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:10,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:11,136 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 657 out of 808 [2024-10-13 10:01:11,137 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-13 10:01:11,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:11,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 657 of 808 [2024-10-13 10:01:11,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:17,093 INFO L124 PetriNetUnfolderBase]: 6430/27954 cut-off events. [2024-10-13 10:01:17,093 INFO L125 PetriNetUnfolderBase]: For 10787/10791 co-relation queries the response was YES. [2024-10-13 10:01:17,242 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-13 10:01:17,310 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 70 selfloop transitions, 5 changer transitions 0/653 dead transitions. [2024-10-13 10:01:17,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 653 transitions, 1589 flow [2024-10-13 10:01:17,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:17,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4012 transitions. [2024-10-13 10:01:17,313 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8275577557755776 [2024-10-13 10:01:17,313 INFO L175 Difference]: Start difference. First operand has 656 places, 654 transitions, 1441 flow. Second operand 6 states and 4012 transitions. [2024-10-13 10:01:17,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 653 transitions, 1589 flow [2024-10-13 10:01:17,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 653 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:17,325 INFO L231 Difference]: Finished difference. Result has 658 places, 653 transitions, 1442 flow [2024-10-13 10:01:17,326 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-13 10:01:17,327 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -100 predicate places. [2024-10-13 10:01:17,327 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 653 transitions, 1442 flow [2024-10-13 10:01:17,328 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-13 10:01:17,328 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:17,329 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-13 10:01:17,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-13 10:01:17,329 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-13 10:01:17,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:17,329 INFO L85 PathProgramCache]: Analyzing trace with hash 690663363, now seen corresponding path program 1 times [2024-10-13 10:01:17,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:17,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592473673] [2024-10-13 10:01:17,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:17,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592473673] [2024-10-13 10:01:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592473673] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774187532] [2024-10-13 10:01:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:17,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:17,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:17,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:17,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:17,415 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-13 10:01:17,417 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-13 10:01:17,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:17,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-13 10:01:17,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:20,743 INFO L124 PetriNetUnfolderBase]: 1770/18298 cut-off events. [2024-10-13 10:01:20,743 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2024-10-13 10:01:20,815 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-13 10:01:20,858 INFO L140 encePairwiseOnDemand]: 803/808 looper letters, 33 selfloop transitions, 2 changer transitions 0/662 dead transitions. [2024-10-13 10:01:20,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 662 transitions, 1558 flow [2024-10-13 10:01:20,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:20,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2153 transitions. [2024-10-13 10:01:20,861 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8882013201320133 [2024-10-13 10:01:20,861 INFO L175 Difference]: Start difference. First operand has 658 places, 653 transitions, 1442 flow. Second operand 3 states and 2153 transitions. [2024-10-13 10:01:20,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 662 transitions, 1558 flow [2024-10-13 10:01:20,867 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 662 transitions, 1548 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:20,872 INFO L231 Difference]: Finished difference. Result has 653 places, 652 transitions, 1442 flow [2024-10-13 10:01:20,872 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-13 10:01:20,873 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -105 predicate places. [2024-10-13 10:01:20,873 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 652 transitions, 1442 flow [2024-10-13 10:01:20,874 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-13 10:01:20,874 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:20,874 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-13 10:01:20,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 10:01:20,874 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-13 10:01:20,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:20,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1111654041, now seen corresponding path program 1 times [2024-10-13 10:01:20,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:20,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856730678] [2024-10-13 10:01:20,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:20,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:20,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:21,874 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-13 10:01:21,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:21,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856730678] [2024-10-13 10:01:21,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856730678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:21,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:21,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:21,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979511541] [2024-10-13 10:01:21,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:21,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:21,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:22,261 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 808 [2024-10-13 10:01:22,263 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-13 10:01:22,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:22,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 808 [2024-10-13 10:01:22,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:23,854 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-13 10:01:23,854 INFO L294 olderBase$Statistics]: this new event has 497 ancestors and is cut-off event [2024-10-13 10:01:23,855 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-10-13 10:01:23,855 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is cut-off event [2024-10-13 10:01:23,855 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is cut-off event [2024-10-13 10:01:23,860 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-13 10:01:23,860 INFO L294 olderBase$Statistics]: this new event has 498 ancestors and is cut-off event [2024-10-13 10:01:23,860 INFO L297 olderBase$Statistics]: existing Event has 461 ancestors and is cut-off event [2024-10-13 10:01:23,860 INFO L297 olderBase$Statistics]: existing Event has 498 ancestors and is cut-off event [2024-10-13 10:01:23,860 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-13 10:01:24,031 INFO L124 PetriNetUnfolderBase]: 635/7849 cut-off events. [2024-10-13 10:01:24,032 INFO L125 PetriNetUnfolderBase]: For 1750/2181 co-relation queries the response was YES. [2024-10-13 10:01:24,075 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-13 10:01:24,095 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 79 selfloop transitions, 5 changer transitions 0/687 dead transitions. [2024-10-13 10:01:24,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 687 transitions, 1824 flow [2024-10-13 10:01:24,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:24,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:24,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4178 transitions. [2024-10-13 10:01:24,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8617986798679867 [2024-10-13 10:01:24,098 INFO L175 Difference]: Start difference. First operand has 653 places, 652 transitions, 1442 flow. Second operand 6 states and 4178 transitions. [2024-10-13 10:01:24,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 687 transitions, 1824 flow [2024-10-13 10:01:24,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 687 transitions, 1824 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-13 10:01:24,106 INFO L231 Difference]: Finished difference. Result has 657 places, 651 transitions, 1450 flow [2024-10-13 10:01:24,107 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-13 10:01:24,107 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -101 predicate places. [2024-10-13 10:01:24,107 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 651 transitions, 1450 flow [2024-10-13 10:01:24,108 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-13 10:01:24,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:24,108 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-13 10:01:24,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-13 10:01:24,109 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-13 10:01:24,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:24,109 INFO L85 PathProgramCache]: Analyzing trace with hash -716654359, now seen corresponding path program 1 times [2024-10-13 10:01:24,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:24,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756442637] [2024-10-13 10:01:24,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:24,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:24,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:24,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:24,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756442637] [2024-10-13 10:01:24,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756442637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:24,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:24,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:24,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337926261] [2024-10-13 10:01:24,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:24,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:24,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:24,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:24,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:25,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 808 [2024-10-13 10:01:25,251 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-13 10:01:25,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:25,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 808 [2024-10-13 10:01:25,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:29,063 INFO L124 PetriNetUnfolderBase]: 3513/17633 cut-off events. [2024-10-13 10:01:29,063 INFO L125 PetriNetUnfolderBase]: For 7284/7310 co-relation queries the response was YES. [2024-10-13 10:01:29,141 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-13 10:01:29,183 INFO L140 encePairwiseOnDemand]: 800/808 looper letters, 101 selfloop transitions, 5 changer transitions 0/696 dead transitions. [2024-10-13 10:01:29,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 696 transitions, 1908 flow [2024-10-13 10:01:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:29,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:29,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4126 transitions. [2024-10-13 10:01:29,186 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8510726072607261 [2024-10-13 10:01:29,186 INFO L175 Difference]: Start difference. First operand has 657 places, 651 transitions, 1450 flow. Second operand 6 states and 4126 transitions. [2024-10-13 10:01:29,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 696 transitions, 1908 flow [2024-10-13 10:01:29,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 696 transitions, 1898 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:29,200 INFO L231 Difference]: Finished difference. Result has 654 places, 648 transitions, 1444 flow [2024-10-13 10:01:29,202 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-13 10:01:29,202 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -104 predicate places. [2024-10-13 10:01:29,202 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 648 transitions, 1444 flow [2024-10-13 10:01:29,203 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-13 10:01:29,203 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:29,203 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-13 10:01:29,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-13 10:01:29,204 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-13 10:01:29,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:29,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1138579606, now seen corresponding path program 1 times [2024-10-13 10:01:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:29,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885377285] [2024-10-13 10:01:29,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:29,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:29,289 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-13 10:01:29,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:29,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885377285] [2024-10-13 10:01:29,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885377285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:29,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:29,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:29,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403711924] [2024-10-13 10:01:29,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:29,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:29,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:29,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:29,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:29,317 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-13 10:01:29,319 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-13 10:01:29,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:29,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-13 10:01:29,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:31,369 INFO L124 PetriNetUnfolderBase]: 714/7847 cut-off events. [2024-10-13 10:01:31,369 INFO L125 PetriNetUnfolderBase]: For 1869/2223 co-relation queries the response was YES. [2024-10-13 10:01:31,410 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-13 10:01:31,430 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 33 selfloop transitions, 2 changer transitions 0/656 dead transitions. [2024-10-13 10:01:31,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 656 transitions, 1566 flow [2024-10-13 10:01:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2149 transitions. [2024-10-13 10:01:31,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865511551155115 [2024-10-13 10:01:31,432 INFO L175 Difference]: Start difference. First operand has 654 places, 648 transitions, 1444 flow. Second operand 3 states and 2149 transitions. [2024-10-13 10:01:31,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 656 transitions, 1566 flow [2024-10-13 10:01:31,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 656 transitions, 1556 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:31,438 INFO L231 Difference]: Finished difference. Result has 650 places, 647 transitions, 1436 flow [2024-10-13 10:01:31,439 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-13 10:01:31,439 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -108 predicate places. [2024-10-13 10:01:31,439 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 647 transitions, 1436 flow [2024-10-13 10:01:31,440 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-13 10:01:31,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:31,440 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-13 10:01:31,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-13 10:01:31,441 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-13 10:01:31,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:31,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1118901865, now seen corresponding path program 1 times [2024-10-13 10:01:31,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:31,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28264169] [2024-10-13 10:01:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:31,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:32,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:32,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:32,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28264169] [2024-10-13 10:01:32,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28264169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:32,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:32,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:32,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735350697] [2024-10-13 10:01:32,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:32,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:32,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:32,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:32,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:32,497 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 808 [2024-10-13 10:01:32,499 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-13 10:01:32,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:32,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 808 [2024-10-13 10:01:32,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:34,782 INFO L124 PetriNetUnfolderBase]: 1532/10227 cut-off events. [2024-10-13 10:01:34,782 INFO L125 PetriNetUnfolderBase]: For 3385/3630 co-relation queries the response was YES. [2024-10-13 10:01:34,834 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-13 10:01:34,857 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 87 selfloop transitions, 5 changer transitions 0/690 dead transitions. [2024-10-13 10:01:34,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 690 transitions, 1830 flow [2024-10-13 10:01:34,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:34,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4186 transitions. [2024-10-13 10:01:34,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8634488448844885 [2024-10-13 10:01:34,860 INFO L175 Difference]: Start difference. First operand has 650 places, 647 transitions, 1436 flow. Second operand 6 states and 4186 transitions. [2024-10-13 10:01:34,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 690 transitions, 1830 flow [2024-10-13 10:01:34,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 690 transitions, 1826 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 10:01:34,870 INFO L231 Difference]: Finished difference. Result has 652 places, 646 transitions, 1440 flow [2024-10-13 10:01:34,871 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-13 10:01:34,871 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -106 predicate places. [2024-10-13 10:01:34,871 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 646 transitions, 1440 flow [2024-10-13 10:01:34,872 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-13 10:01:34,872 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:34,872 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-13 10:01:34,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-13 10:01:34,873 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-13 10:01:34,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:34,873 INFO L85 PathProgramCache]: Analyzing trace with hash -840419165, now seen corresponding path program 1 times [2024-10-13 10:01:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:34,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043769318] [2024-10-13 10:01:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:34,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:34,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:35,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:35,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:35,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043769318] [2024-10-13 10:01:35,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043769318] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:35,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:35,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:35,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908323157] [2024-10-13 10:01:35,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:35,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:35,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:35,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:36,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 687 out of 808 [2024-10-13 10:01:36,184 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-13 10:01:36,185 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:36,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 687 of 808 [2024-10-13 10:01:36,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:39,289 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-13 10:01:39,289 INFO L294 olderBase$Statistics]: this new event has 497 ancestors and is cut-off event [2024-10-13 10:01:39,290 INFO L297 olderBase$Statistics]: existing Event has 460 ancestors and is cut-off event [2024-10-13 10:01:39,290 INFO L297 olderBase$Statistics]: existing Event has 377 ancestors and is cut-off event [2024-10-13 10:01:39,290 INFO L297 olderBase$Statistics]: existing Event has 497 ancestors and is cut-off event [2024-10-13 10:01:39,302 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-13 10:01:39,302 INFO L294 olderBase$Statistics]: this new event has 498 ancestors and is cut-off event [2024-10-13 10:01:39,302 INFO L297 olderBase$Statistics]: existing Event has 378 ancestors and is cut-off event [2024-10-13 10:01:39,302 INFO L297 olderBase$Statistics]: existing Event has 461 ancestors and is cut-off event [2024-10-13 10:01:39,302 INFO L297 olderBase$Statistics]: existing Event has 498 ancestors and is cut-off event [2024-10-13 10:01:39,429 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-13 10:01:39,429 INFO L294 olderBase$Statistics]: this new event has 508 ancestors and is cut-off event [2024-10-13 10:01:39,429 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-10-13 10:01:39,429 INFO L297 olderBase$Statistics]: existing Event has 420 ancestors and is cut-off event [2024-10-13 10:01:39,429 INFO L297 olderBase$Statistics]: existing Event has 508 ancestors and is cut-off event [2024-10-13 10:01:39,625 INFO L124 PetriNetUnfolderBase]: 2243/16047 cut-off events. [2024-10-13 10:01:39,625 INFO L125 PetriNetUnfolderBase]: For 4372/4528 co-relation queries the response was YES. [2024-10-13 10:01:39,679 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-13 10:01:39,705 INFO L140 encePairwiseOnDemand]: 802/808 looper letters, 86 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2024-10-13 10:01:39,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 689 transitions, 1832 flow [2024-10-13 10:01:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:01:39,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-13 10:01:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4191 transitions. [2024-10-13 10:01:39,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.864480198019802 [2024-10-13 10:01:39,708 INFO L175 Difference]: Start difference. First operand has 652 places, 646 transitions, 1440 flow. Second operand 6 states and 4191 transitions. [2024-10-13 10:01:39,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 689 transitions, 1832 flow [2024-10-13 10:01:39,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 689 transitions, 1822 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:39,718 INFO L231 Difference]: Finished difference. Result has 651 places, 645 transitions, 1438 flow [2024-10-13 10:01:39,718 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-13 10:01:39,719 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -107 predicate places. [2024-10-13 10:01:39,719 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 645 transitions, 1438 flow [2024-10-13 10:01:39,720 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-13 10:01:39,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:39,720 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-13 10:01:39,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-13 10:01:39,720 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-13 10:01:39,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1111726618, now seen corresponding path program 1 times [2024-10-13 10:01:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199912598] [2024-10-13 10:01:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:39,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199912598] [2024-10-13 10:01:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199912598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:39,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:01:39,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152088725] [2024-10-13 10:01:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:01:39,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:39,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:01:39,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:01:39,819 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 708 out of 808 [2024-10-13 10:01:39,820 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-13 10:01:39,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:39,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 708 of 808 [2024-10-13 10:01:39,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 10:01:42,811 INFO L124 PetriNetUnfolderBase]: 2005/16090 cut-off events. [2024-10-13 10:01:42,811 INFO L125 PetriNetUnfolderBase]: For 3762/3864 co-relation queries the response was YES. [2024-10-13 10:01:42,904 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-13 10:01:42,943 INFO L140 encePairwiseOnDemand]: 805/808 looper letters, 34 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2024-10-13 10:01:42,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 655 transitions, 1561 flow [2024-10-13 10:01:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:01:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 10:01:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2150 transitions. [2024-10-13 10:01:42,945 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.886963696369637 [2024-10-13 10:01:42,945 INFO L175 Difference]: Start difference. First operand has 651 places, 645 transitions, 1438 flow. Second operand 3 states and 2150 transitions. [2024-10-13 10:01:42,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 655 transitions, 1561 flow [2024-10-13 10:01:43,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 655 transitions, 1551 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-13 10:01:43,136 INFO L231 Difference]: Finished difference. Result has 647 places, 644 transitions, 1430 flow [2024-10-13 10:01:43,137 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-13 10:01:43,137 INFO L277 CegarLoopForPetriNet]: 758 programPoint places, -111 predicate places. [2024-10-13 10:01:43,138 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 644 transitions, 1430 flow [2024-10-13 10:01:43,138 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-13 10:01:43,139 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 10:01:43,139 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:01:43,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-13 10:01:43,139 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-13 10:01:43,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:01:43,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1897090723, now seen corresponding path program 1 times [2024-10-13 10:01:43,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:01:43,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754877082] [2024-10-13 10:01:43,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:01:43,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:01:43,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:01:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:01:43,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:01:43,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754877082] [2024-10-13 10:01:43,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754877082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:01:43,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:01:43,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:01:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264871585] [2024-10-13 10:01:43,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:01:43,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:01:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:01:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:01:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:01:44,235 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 686 out of 808 [2024-10-13 10:01:44,237 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-13 10:01:44,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 10:01:44,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 686 of 808 [2024-10-13 10:01:44,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand