./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-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 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:46:36,572 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:46:36,636 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:46:36,640 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:46:36,641 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:46:36,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:46:36,678 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:46:36,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:46:36,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:46:36,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:46:36,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:46:36,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:46:36,684 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:46:36,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:46:36,686 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:46:36,687 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:46:36,687 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:46:36,687 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:46:36,687 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:46:36,688 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:46:36,688 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:46:36,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:46:36,691 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:46:36,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:46:36,691 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:46:36,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:46:36,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:46:36,692 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:46:36,692 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:46:36,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:46:36,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:46:36,693 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:36,693 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:46:36,693 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:46:36,693 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:46:36,693 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:46:36,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:46:36,694 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:46:36,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:46:36,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:46:36,696 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:46:36,696 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 -> 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea [2024-11-16 23:46:36,945 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:46:36,972 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:46:36,976 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:46:36,977 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:46:36,978 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:46:36,979 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-11-16 23:46:38,414 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:46:38,616 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:46:38,616 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-11-16 23:46:38,624 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd171afd/80cefd68e3604dc3ba08831d0bc9ff66/FLAG488f8849e [2024-11-16 23:46:38,643 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebd171afd/80cefd68e3604dc3ba08831d0bc9ff66 [2024-11-16 23:46:38,646 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:46:38,647 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:46:38,648 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:38,648 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:46:38,654 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:46:38,654 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:38" (1/1) ... [2024-11-16 23:46:38,655 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5001864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:38, skipping insertion in model container [2024-11-16 23:46:38,655 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:46:38" (1/1) ... [2024-11-16 23:46:38,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:46:38,946 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:38,955 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:46:39,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:46:39,038 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:46:39,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39 WrapperNode [2024-11-16 23:46:39,039 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:46:39,040 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:39,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:46:39,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:46:39,047 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,142 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 829 [2024-11-16 23:46:39,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:46:39,156 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:46:39,156 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:46:39,156 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:46:39,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,180 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,233 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,239 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,249 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,256 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:46:39,269 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:46:39,269 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:46:39,270 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:46:39,270 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (1/1) ... [2024-11-16 23:46:39,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:46:39,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:46:39,309 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 23:46:39,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 23:46:39,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:46:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-16 23:46:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-16 23:46:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-16 23:46:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-16 23:46:39,362 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:46:39,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:46:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:46:39,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:46:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-16 23:46:39,363 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-16 23:46:39,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:46:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-16 23:46:39,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-16 23:46:39,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 23:46:39,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:46:39,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:46:39,367 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:46:39,497 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:46:39,499 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:46:40,555 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:46:40,555 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:46:41,036 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:46:41,037 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:46:41,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:41 BoogieIcfgContainer [2024-11-16 23:46:41,038 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:46:41,040 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:46:41,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:46:41,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:46:41,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:46:38" (1/3) ... [2024-11-16 23:46:41,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670ecafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:41, skipping insertion in model container [2024-11-16 23:46:41,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:46:39" (2/3) ... [2024-11-16 23:46:41,047 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670ecafd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:46:41, skipping insertion in model container [2024-11-16 23:46:41,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:46:41" (3/3) ... [2024-11-16 23:46:41,048 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-11-16 23:46:41,066 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:46:41,066 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 133 error locations. [2024-11-16 23:46:41,066 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:46:41,274 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-16 23:46:41,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 823 places, 858 transitions, 1737 flow [2024-11-16 23:46:41,639 INFO L124 PetriNetUnfolderBase]: 45/855 cut-off events. [2024-11-16 23:46:41,639 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:46:41,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 855 events. 45/855 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1708 event pairs, 0 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 611. Up to 2 conditions per place. [2024-11-16 23:46:41,658 INFO L82 GeneralOperation]: Start removeDead. Operand has 823 places, 858 transitions, 1737 flow [2024-11-16 23:46:41,678 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 804 places, 838 transitions, 1694 flow [2024-11-16 23:46:41,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:46:41,699 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;@5bd11bf1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:46:41,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 234 error locations. [2024-11-16 23:46:41,705 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:46:41,705 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2024-11-16 23:46:41,706 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:46:41,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:41,706 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-11-16 23:46:41,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:41,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:41,713 INFO L85 PathProgramCache]: Analyzing trace with hash 719895610, now seen corresponding path program 1 times [2024-11-16 23:46:41,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:41,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157203853] [2024-11-16 23:46:41,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:41,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:41,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157203853] [2024-11-16 23:46:41,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157203853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:41,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:41,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757878393] [2024-11-16 23:46:41,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:41,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:41,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:42,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:42,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:42,032 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 858 [2024-11-16 23:46:42,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 804 places, 838 transitions, 1694 flow. Second operand has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:42,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:42,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 858 [2024-11-16 23:46:42,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:42,402 INFO L124 PetriNetUnfolderBase]: 58/1104 cut-off events. [2024-11-16 23:46:42,403 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-16 23:46:42,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1207 conditions, 1104 events. 58/1104 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3670 event pairs, 19 based on Foata normal form. 77/990 useless extension candidates. Maximal degree in co-relation 790. Up to 65 conditions per place. [2024-11-16 23:46:42,421 INFO L140 encePairwiseOnDemand]: 776/858 looper letters, 14 selfloop transitions, 2 changer transitions 12/758 dead transitions. [2024-11-16 23:46:42,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 754 places, 758 transitions, 1566 flow [2024-11-16 23:46:42,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:42,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:42,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2373 transitions. [2024-11-16 23:46:42,446 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.921911421911422 [2024-11-16 23:46:42,448 INFO L175 Difference]: Start difference. First operand has 804 places, 838 transitions, 1694 flow. Second operand 3 states and 2373 transitions. [2024-11-16 23:46:42,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 754 places, 758 transitions, 1566 flow [2024-11-16 23:46:42,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 748 places, 758 transitions, 1554 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-16 23:46:42,474 INFO L231 Difference]: Finished difference. Result has 748 places, 746 transitions, 1502 flow [2024-11-16 23:46:42,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1522, PETRI_DIFFERENCE_MINUEND_PLACES=746, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=758, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=756, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1502, PETRI_PLACES=748, PETRI_TRANSITIONS=746} [2024-11-16 23:46:42,483 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -56 predicate places. [2024-11-16 23:46:42,484 INFO L471 AbstractCegarLoop]: Abstraction has has 748 places, 746 transitions, 1502 flow [2024-11-16 23:46:42,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:42,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:42,486 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-11-16 23:46:42,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:46:42,487 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:42,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:42,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1271698521, now seen corresponding path program 1 times [2024-11-16 23:46:42,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:42,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326185052] [2024-11-16 23:46:42,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:42,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:42,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:42,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:42,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326185052] [2024-11-16 23:46:42,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326185052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:42,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:42,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:42,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592722058] [2024-11-16 23:46:42,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:42,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:42,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:42,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:42,673 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 858 [2024-11-16 23:46:42,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 748 places, 746 transitions, 1502 flow. Second operand has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:42,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:42,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 858 [2024-11-16 23:46:42,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,027 INFO L124 PetriNetUnfolderBase]: 118/1193 cut-off events. [2024-11-16 23:46:43,028 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-16 23:46:43,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1403 conditions, 1193 events. 118/1193 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4513 event pairs, 67 based on Foata normal form. 0/1002 useless extension candidates. Maximal degree in co-relation 1360. Up to 168 conditions per place. [2024-11-16 23:46:43,051 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 21 selfloop transitions, 2 changer transitions 0/745 dead transitions. [2024-11-16 23:46:43,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 737 places, 745 transitions, 1546 flow [2024-11-16 23:46:43,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:43,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2280 transitions. [2024-11-16 23:46:43,057 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8857808857808858 [2024-11-16 23:46:43,058 INFO L175 Difference]: Start difference. First operand has 748 places, 746 transitions, 1502 flow. Second operand 3 states and 2280 transitions. [2024-11-16 23:46:43,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 737 places, 745 transitions, 1546 flow [2024-11-16 23:46:43,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 735 places, 745 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:43,071 INFO L231 Difference]: Finished difference. Result has 735 places, 745 transitions, 1500 flow [2024-11-16 23:46:43,073 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1496, PETRI_DIFFERENCE_MINUEND_PLACES=733, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=745, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=743, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1500, PETRI_PLACES=735, PETRI_TRANSITIONS=745} [2024-11-16 23:46:43,073 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -69 predicate places. [2024-11-16 23:46:43,074 INFO L471 AbstractCegarLoop]: Abstraction has has 735 places, 745 transitions, 1500 flow [2024-11-16 23:46:43,075 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.3333333333334) internal successors, (2260), 3 states have internal predecessors, (2260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:43,075 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,076 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-11-16 23:46:43,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:46:43,076 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:43,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1392932914, now seen corresponding path program 1 times [2024-11-16 23:46:43,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918606230] [2024-11-16 23:46:43,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918606230] [2024-11-16 23:46:43,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918606230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:43,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:43,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:43,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032204579] [2024-11-16 23:46:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:43,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:43,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:43,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:43,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 858 [2024-11-16 23:46:43,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 735 places, 745 transitions, 1500 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:43,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:43,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 858 [2024-11-16 23:46:43,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:43,585 INFO L124 PetriNetUnfolderBase]: 172/1314 cut-off events. [2024-11-16 23:46:43,586 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-16 23:46:43,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1628 conditions, 1314 events. 172/1314 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5471 event pairs, 99 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1577. Up to 235 conditions per place. [2024-11-16 23:46:43,614 INFO L140 encePairwiseOnDemand]: 849/858 looper letters, 27 selfloop transitions, 3 changer transitions 0/744 dead transitions. [2024-11-16 23:46:43,614 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 744 transitions, 1560 flow [2024-11-16 23:46:43,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2024-11-16 23:46:43,622 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8834498834498834 [2024-11-16 23:46:43,622 INFO L175 Difference]: Start difference. First operand has 735 places, 745 transitions, 1500 flow. Second operand 3 states and 2274 transitions. [2024-11-16 23:46:43,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 744 transitions, 1560 flow [2024-11-16 23:46:43,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 744 transitions, 1556 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:43,638 INFO L231 Difference]: Finished difference. Result has 729 places, 739 transitions, 1490 flow [2024-11-16 23:46:43,640 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=729, PETRI_TRANSITIONS=739} [2024-11-16 23:46:43,641 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -75 predicate places. [2024-11-16 23:46:43,641 INFO L471 AbstractCegarLoop]: Abstraction has has 729 places, 739 transitions, 1490 flow [2024-11-16 23:46:43,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:43,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:43,642 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:43,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:46:43,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:43,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:43,644 INFO L85 PathProgramCache]: Analyzing trace with hash 18732247, now seen corresponding path program 1 times [2024-11-16 23:46:43,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:43,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699039984] [2024-11-16 23:46:43,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:43,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:43,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:43,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:43,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699039984] [2024-11-16 23:46:43,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699039984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:43,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:43,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:43,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112665045] [2024-11-16 23:46:43,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:43,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:43,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:43,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:43,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:43,769 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 858 [2024-11-16 23:46:43,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 739 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:43,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:43,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 858 [2024-11-16 23:46:43,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:44,261 INFO L124 PetriNetUnfolderBase]: 418/2492 cut-off events. [2024-11-16 23:46:44,261 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-16 23:46:44,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 2492 events. 418/2492 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 13699 event pairs, 235 based on Foata normal form. 0/2062 useless extension candidates. Maximal degree in co-relation 2017. Up to 557 conditions per place. [2024-11-16 23:46:44,291 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 26 selfloop transitions, 2 changer transitions 0/738 dead transitions. [2024-11-16 23:46:44,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 730 places, 738 transitions, 1544 flow [2024-11-16 23:46:44,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:44,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2270 transitions. [2024-11-16 23:46:44,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8818958818958819 [2024-11-16 23:46:44,301 INFO L175 Difference]: Start difference. First operand has 729 places, 739 transitions, 1490 flow. Second operand 3 states and 2270 transitions. [2024-11-16 23:46:44,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 730 places, 738 transitions, 1544 flow [2024-11-16 23:46:44,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 728 places, 738 transitions, 1538 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:44,316 INFO L231 Difference]: Finished difference. Result has 728 places, 738 transitions, 1486 flow [2024-11-16 23:46:44,318 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=726, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=738, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=736, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=728, PETRI_TRANSITIONS=738} [2024-11-16 23:46:44,318 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -76 predicate places. [2024-11-16 23:46:44,319 INFO L471 AbstractCegarLoop]: Abstraction has has 728 places, 738 transitions, 1486 flow [2024-11-16 23:46:44,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.3333333333334) internal successors, (2245), 3 states have internal predecessors, (2245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:44,320 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:44,320 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:44,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:46:44,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:44,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:44,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1031793666, now seen corresponding path program 1 times [2024-11-16 23:46:44,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:44,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265132928] [2024-11-16 23:46:44,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:44,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:44,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:44,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:44,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265132928] [2024-11-16 23:46:44,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265132928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:44,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:44,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:44,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692932993] [2024-11-16 23:46:44,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:44,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:44,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:44,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:44,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 858 [2024-11-16 23:46:44,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 728 places, 738 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:44,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:44,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 858 [2024-11-16 23:46:44,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:44,628 INFO L124 PetriNetUnfolderBase]: 58/1063 cut-off events. [2024-11-16 23:46:44,628 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-16 23:46:44,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1148 conditions, 1063 events. 58/1063 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3399 event pairs, 19 based on Foata normal form. 0/913 useless extension candidates. Maximal degree in co-relation 1090. Up to 67 conditions per place. [2024-11-16 23:46:44,642 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 16 selfloop transitions, 2 changer transitions 0/737 dead transitions. [2024-11-16 23:46:44,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 729 places, 737 transitions, 1520 flow [2024-11-16 23:46:44,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:44,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:44,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2024-11-16 23:46:44,649 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896658896658897 [2024-11-16 23:46:44,649 INFO L175 Difference]: Start difference. First operand has 728 places, 738 transitions, 1486 flow. Second operand 3 states and 2290 transitions. [2024-11-16 23:46:44,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 729 places, 737 transitions, 1520 flow [2024-11-16 23:46:44,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 727 places, 737 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:44,661 INFO L231 Difference]: Finished difference. Result has 727 places, 737 transitions, 1484 flow [2024-11-16 23:46:44,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=725, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=737, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=735, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=727, PETRI_TRANSITIONS=737} [2024-11-16 23:46:44,664 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -77 predicate places. [2024-11-16 23:46:44,665 INFO L471 AbstractCegarLoop]: Abstraction has has 727 places, 737 transitions, 1484 flow [2024-11-16 23:46:44,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:44,667 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:44,667 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-11-16 23:46:44,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:46:44,668 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:44,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:44,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1617257241, now seen corresponding path program 1 times [2024-11-16 23:46:44,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770231845] [2024-11-16 23:46:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:44,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:44,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:44,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770231845] [2024-11-16 23:46:44,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770231845] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:44,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:44,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:44,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239567090] [2024-11-16 23:46:44,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:44,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:44,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:44,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:44,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:44,749 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 858 [2024-11-16 23:46:44,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 737 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:44,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:44,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 858 [2024-11-16 23:46:44,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:44,987 INFO L124 PetriNetUnfolderBase]: 68/1053 cut-off events. [2024-11-16 23:46:44,987 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-16 23:46:44,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1160 conditions, 1053 events. 68/1053 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3367 event pairs, 11 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1094. Up to 47 conditions per place. [2024-11-16 23:46:44,998 INFO L140 encePairwiseOnDemand]: 853/858 looper letters, 21 selfloop transitions, 3 changer transitions 0/743 dead transitions. [2024-11-16 23:46:44,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 743 transitions, 1548 flow [2024-11-16 23:46:44,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:44,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:45,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2303 transitions. [2024-11-16 23:46:45,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8947163947163947 [2024-11-16 23:46:45,005 INFO L175 Difference]: Start difference. First operand has 727 places, 737 transitions, 1484 flow. Second operand 3 states and 2303 transitions. [2024-11-16 23:46:45,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 743 transitions, 1548 flow [2024-11-16 23:46:45,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 743 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:45,019 INFO L231 Difference]: Finished difference. Result has 727 places, 737 transitions, 1496 flow [2024-11-16 23:46:45,020 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=727, PETRI_TRANSITIONS=737} [2024-11-16 23:46:45,022 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -77 predicate places. [2024-11-16 23:46:45,022 INFO L471 AbstractCegarLoop]: Abstraction has has 727 places, 737 transitions, 1496 flow [2024-11-16 23:46:45,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:45,024 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:45,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:45,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:46:45,025 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:45,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:45,026 INFO L85 PathProgramCache]: Analyzing trace with hash -395974420, now seen corresponding path program 1 times [2024-11-16 23:46:45,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:45,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133359211] [2024-11-16 23:46:45,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:45,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:45,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-11-16 23:46:45,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:45,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133359211] [2024-11-16 23:46:45,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133359211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:45,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:45,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:45,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940847374] [2024-11-16 23:46:45,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:45,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:45,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:45,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:45,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:45,104 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 858 [2024-11-16 23:46:45,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 727 places, 737 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:45,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:45,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 858 [2024-11-16 23:46:45,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:45,508 INFO L124 PetriNetUnfolderBase]: 230/1712 cut-off events. [2024-11-16 23:46:45,508 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-16 23:46:45,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2116 conditions, 1712 events. 230/1712 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8578 event pairs, 131 based on Foata normal form. 0/1438 useless extension candidates. Maximal degree in co-relation 1465. Up to 310 conditions per place. [2024-11-16 23:46:45,529 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 20 selfloop transitions, 2 changer transitions 0/736 dead transitions. [2024-11-16 23:46:45,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 728 places, 736 transitions, 1538 flow [2024-11-16 23:46:45,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:45,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2284 transitions. [2024-11-16 23:46:45,535 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873348873348873 [2024-11-16 23:46:45,535 INFO L175 Difference]: Start difference. First operand has 727 places, 737 transitions, 1496 flow. Second operand 3 states and 2284 transitions. [2024-11-16 23:46:45,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 728 places, 736 transitions, 1538 flow [2024-11-16 23:46:45,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 726 places, 736 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:45,546 INFO L231 Difference]: Finished difference. Result has 726 places, 736 transitions, 1492 flow [2024-11-16 23:46:45,547 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1488, PETRI_DIFFERENCE_MINUEND_PLACES=724, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1492, PETRI_PLACES=726, PETRI_TRANSITIONS=736} [2024-11-16 23:46:45,548 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -78 predicate places. [2024-11-16 23:46:45,548 INFO L471 AbstractCegarLoop]: Abstraction has has 726 places, 736 transitions, 1492 flow [2024-11-16 23:46:45,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:45,550 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:45,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] [2024-11-16 23:46:45,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:46:45,550 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:45,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:45,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1380545771, now seen corresponding path program 1 times [2024-11-16 23:46:45,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:45,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347209606] [2024-11-16 23:46:45,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:45,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:45,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:45,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:45,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:45,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347209606] [2024-11-16 23:46:45,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347209606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:45,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:45,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:45,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254472116] [2024-11-16 23:46:45,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:45,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:45,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:45,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:45,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:45,622 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 858 [2024-11-16 23:46:45,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 726 places, 736 transitions, 1492 flow. Second operand has 3 states, 3 states have (on average 759.3333333333334) internal successors, (2278), 3 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:45,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:45,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 858 [2024-11-16 23:46:45,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:45,833 INFO L124 PetriNetUnfolderBase]: 70/1115 cut-off events. [2024-11-16 23:46:45,834 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-16 23:46:45,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1240 conditions, 1115 events. 70/1115 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3878 event pairs, 27 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1165. Up to 86 conditions per place. [2024-11-16 23:46:45,850 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 16 selfloop transitions, 2 changer transitions 0/735 dead transitions. [2024-11-16 23:46:45,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 727 places, 735 transitions, 1526 flow [2024-11-16 23:46:45,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:45,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:45,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2292 transitions. [2024-11-16 23:46:45,856 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8904428904428905 [2024-11-16 23:46:45,856 INFO L175 Difference]: Start difference. First operand has 726 places, 736 transitions, 1492 flow. Second operand 3 states and 2292 transitions. [2024-11-16 23:46:45,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 727 places, 735 transitions, 1526 flow [2024-11-16 23:46:45,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 725 places, 735 transitions, 1522 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:45,868 INFO L231 Difference]: Finished difference. Result has 725 places, 735 transitions, 1490 flow [2024-11-16 23:46:45,869 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1486, PETRI_DIFFERENCE_MINUEND_PLACES=723, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=735, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=733, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=725, PETRI_TRANSITIONS=735} [2024-11-16 23:46:45,872 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -79 predicate places. [2024-11-16 23:46:45,873 INFO L471 AbstractCegarLoop]: Abstraction has has 725 places, 735 transitions, 1490 flow [2024-11-16 23:46:45,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 759.3333333333334) internal successors, (2278), 3 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:45,876 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:45,877 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-11-16 23:46:45,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:46:45,877 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:45,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:45,878 INFO L85 PathProgramCache]: Analyzing trace with hash -378347046, now seen corresponding path program 1 times [2024-11-16 23:46:45,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:45,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729188662] [2024-11-16 23:46:45,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:45,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-11-16 23:46:45,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:45,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729188662] [2024-11-16 23:46:45,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729188662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:45,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10452801] [2024-11-16 23:46:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:45,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:45,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:45,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 858 [2024-11-16 23:46:45,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 725 places, 735 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:45,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:45,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 858 [2024-11-16 23:46:45,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:46,181 INFO L124 PetriNetUnfolderBase]: 110/1263 cut-off events. [2024-11-16 23:46:46,181 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-16 23:46:46,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1452 conditions, 1263 events. 110/1263 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 5121 event pairs, 53 based on Foata normal form. 0/1073 useless extension candidates. Maximal degree in co-relation 1369. Up to 142 conditions per place. [2024-11-16 23:46:46,195 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 17 selfloop transitions, 2 changer transitions 0/734 dead transitions. [2024-11-16 23:46:46,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 726 places, 734 transitions, 1526 flow [2024-11-16 23:46:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:46,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2024-11-16 23:46:46,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896658896658897 [2024-11-16 23:46:46,201 INFO L175 Difference]: Start difference. First operand has 725 places, 735 transitions, 1490 flow. Second operand 3 states and 2290 transitions. [2024-11-16 23:46:46,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 726 places, 734 transitions, 1526 flow [2024-11-16 23:46:46,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 724 places, 734 transitions, 1522 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:46,212 INFO L231 Difference]: Finished difference. Result has 724 places, 734 transitions, 1488 flow [2024-11-16 23:46:46,213 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=722, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=734, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=724, PETRI_TRANSITIONS=734} [2024-11-16 23:46:46,214 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -80 predicate places. [2024-11-16 23:46:46,214 INFO L471 AbstractCegarLoop]: Abstraction has has 724 places, 734 transitions, 1488 flow [2024-11-16 23:46:46,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:46,216 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:46,216 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-11-16 23:46:46,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:46:46,217 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:46,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:46,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1608661692, now seen corresponding path program 1 times [2024-11-16 23:46:46,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:46,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207680389] [2024-11-16 23:46:46,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:46,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:46,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:46,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207680389] [2024-11-16 23:46:46,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207680389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:46,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:46,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:46,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519061647] [2024-11-16 23:46:46,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:46,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:46,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:46,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:46,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:46,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 858 [2024-11-16 23:46:46,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 724 places, 734 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:46,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:46,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 858 [2024-11-16 23:46:46,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:46,600 INFO L124 PetriNetUnfolderBase]: 208/1559 cut-off events. [2024-11-16 23:46:46,601 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-16 23:46:46,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1931 conditions, 1559 events. 208/1559 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7405 event pairs, 129 based on Foata normal form. 0/1280 useless extension candidates. Maximal degree in co-relation 1840. Up to 291 conditions per place. [2024-11-16 23:46:46,622 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 21 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2024-11-16 23:46:46,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 733 transitions, 1532 flow [2024-11-16 23:46:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:46,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2282 transitions. [2024-11-16 23:46:46,627 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865578865578866 [2024-11-16 23:46:46,627 INFO L175 Difference]: Start difference. First operand has 724 places, 734 transitions, 1488 flow. Second operand 3 states and 2282 transitions. [2024-11-16 23:46:46,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 733 transitions, 1532 flow [2024-11-16 23:46:46,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 733 transitions, 1528 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:46,637 INFO L231 Difference]: Finished difference. Result has 723 places, 733 transitions, 1486 flow [2024-11-16 23:46:46,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=723, PETRI_TRANSITIONS=733} [2024-11-16 23:46:46,640 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -81 predicate places. [2024-11-16 23:46:46,640 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 733 transitions, 1486 flow [2024-11-16 23:46:46,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.3333333333334) internal successors, (2263), 3 states have internal predecessors, (2263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:46,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:46,642 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:46,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:46:46,642 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:46,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:46,643 INFO L85 PathProgramCache]: Analyzing trace with hash 883474019, now seen corresponding path program 1 times [2024-11-16 23:46:46,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:46,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268572265] [2024-11-16 23:46:46,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:46,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268572265] [2024-11-16 23:46:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268572265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054795292] [2024-11-16 23:46:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:46,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:46,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:46,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 858 [2024-11-16 23:46:46,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 733 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:46,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:46,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 858 [2024-11-16 23:46:46,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:46,980 INFO L124 PetriNetUnfolderBase]: 110/1261 cut-off events. [2024-11-16 23:46:46,981 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-16 23:46:46,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1453 conditions, 1261 events. 110/1261 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5107 event pairs, 53 based on Foata normal form. 0/1079 useless extension candidates. Maximal degree in co-relation 1354. Up to 145 conditions per place. [2024-11-16 23:46:46,994 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 20 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-11-16 23:46:46,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 732 transitions, 1528 flow [2024-11-16 23:46:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2284 transitions. [2024-11-16 23:46:47,002 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8873348873348873 [2024-11-16 23:46:47,002 INFO L175 Difference]: Start difference. First operand has 723 places, 733 transitions, 1486 flow. Second operand 3 states and 2284 transitions. [2024-11-16 23:46:47,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 732 transitions, 1528 flow [2024-11-16 23:46:47,006 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 732 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:47,013 INFO L231 Difference]: Finished difference. Result has 722 places, 732 transitions, 1484 flow [2024-11-16 23:46:47,014 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1480, PETRI_DIFFERENCE_MINUEND_PLACES=720, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=722, PETRI_TRANSITIONS=732} [2024-11-16 23:46:47,015 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -82 predicate places. [2024-11-16 23:46:47,015 INFO L471 AbstractCegarLoop]: Abstraction has has 722 places, 732 transitions, 1484 flow [2024-11-16 23:46:47,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 755.3333333333334) internal successors, (2266), 3 states have internal predecessors, (2266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:47,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:47,017 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-11-16 23:46:47,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:46:47,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:47,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:47,019 INFO L85 PathProgramCache]: Analyzing trace with hash -37512658, now seen corresponding path program 1 times [2024-11-16 23:46:47,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:47,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756023512] [2024-11-16 23:46:47,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:47,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:47,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:47,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:47,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756023512] [2024-11-16 23:46:47,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756023512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:47,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:47,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:47,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13460209] [2024-11-16 23:46:47,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:47,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:47,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:47,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:47,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:47,080 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 858 [2024-11-16 23:46:47,083 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 732 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:47,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:47,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 858 [2024-11-16 23:46:47,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:47,307 INFO L124 PetriNetUnfolderBase]: 110/1260 cut-off events. [2024-11-16 23:46:47,308 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-16 23:46:47,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1449 conditions, 1260 events. 110/1260 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5017 event pairs, 53 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1342. Up to 142 conditions per place. [2024-11-16 23:46:47,319 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 17 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-11-16 23:46:47,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 731 transitions, 1520 flow [2024-11-16 23:46:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:47,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2024-11-16 23:46:47,325 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896658896658897 [2024-11-16 23:46:47,325 INFO L175 Difference]: Start difference. First operand has 722 places, 732 transitions, 1484 flow. Second operand 3 states and 2290 transitions. [2024-11-16 23:46:47,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 731 transitions, 1520 flow [2024-11-16 23:46:47,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 731 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:47,337 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1482 flow [2024-11-16 23:46:47,338 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1478, PETRI_DIFFERENCE_MINUEND_PLACES=719, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1482, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2024-11-16 23:46:47,339 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -83 predicate places. [2024-11-16 23:46:47,340 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1482 flow [2024-11-16 23:46:47,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:47,341 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:47,341 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-11-16 23:46:47,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:46:47,342 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:47,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:47,342 INFO L85 PathProgramCache]: Analyzing trace with hash -459052002, now seen corresponding path program 1 times [2024-11-16 23:46:47,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:47,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110400566] [2024-11-16 23:46:47,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:47,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:47,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:47,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:47,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110400566] [2024-11-16 23:46:47,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110400566] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:47,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:47,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:47,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93389060] [2024-11-16 23:46:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:47,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:47,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:47,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:47,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:47,394 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 858 [2024-11-16 23:46:47,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1482 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:47,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:47,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 858 [2024-11-16 23:46:47,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:48,366 INFO L124 PetriNetUnfolderBase]: 252/4902 cut-off events. [2024-11-16 23:46:48,366 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-16 23:46:48,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5171 conditions, 4902 events. 252/4902 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 36053 event pairs, 79 based on Foata normal form. 0/3922 useless extension candidates. Maximal degree in co-relation 5056. Up to 214 conditions per place. [2024-11-16 23:46:48,410 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 16 selfloop transitions, 1 changer transitions 0/729 dead transitions. [2024-11-16 23:46:48,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 729 transitions, 1512 flow [2024-11-16 23:46:48,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:48,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2295 transitions. [2024-11-16 23:46:48,415 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8916083916083916 [2024-11-16 23:46:48,415 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1482 flow. Second operand 3 states and 2295 transitions. [2024-11-16 23:46:48,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 729 transitions, 1512 flow [2024-11-16 23:46:48,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 729 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:48,425 INFO L231 Difference]: Finished difference. Result has 719 places, 729 transitions, 1476 flow [2024-11-16 23:46:48,427 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=719, PETRI_TRANSITIONS=729} [2024-11-16 23:46:48,427 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -85 predicate places. [2024-11-16 23:46:48,428 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 729 transitions, 1476 flow [2024-11-16 23:46:48,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:48,429 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:48,429 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] [2024-11-16 23:46:48,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:46:48,430 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1577881228, now seen corresponding path program 1 times [2024-11-16 23:46:48,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35311080] [2024-11-16 23:46:48,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:48,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:48,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:48,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:48,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35311080] [2024-11-16 23:46:48,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35311080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:48,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:48,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:48,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371696129] [2024-11-16 23:46:48,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:48,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:48,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:48,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:48,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:48,513 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 858 [2024-11-16 23:46:48,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 729 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:48,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:48,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 858 [2024-11-16 23:46:48,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:48,882 INFO L124 PetriNetUnfolderBase]: 190/1555 cut-off events. [2024-11-16 23:46:48,883 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-16 23:46:48,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1870 conditions, 1555 events. 190/1555 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 7423 event pairs, 105 based on Foata normal form. 0/1305 useless extension candidates. Maximal degree in co-relation 1755. Up to 253 conditions per place. [2024-11-16 23:46:48,903 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 18 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-11-16 23:46:48,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 728 transitions, 1514 flow [2024-11-16 23:46:48,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:48,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2288 transitions. [2024-11-16 23:46:48,909 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-16 23:46:48,909 INFO L175 Difference]: Start difference. First operand has 719 places, 729 transitions, 1476 flow. Second operand 3 states and 2288 transitions. [2024-11-16 23:46:48,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 728 transitions, 1514 flow [2024-11-16 23:46:48,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 728 transitions, 1513 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:48,922 INFO L231 Difference]: Finished difference. Result has 719 places, 728 transitions, 1477 flow [2024-11-16 23:46:48,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1473, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1477, PETRI_PLACES=719, PETRI_TRANSITIONS=728} [2024-11-16 23:46:48,924 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -85 predicate places. [2024-11-16 23:46:48,925 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 728 transitions, 1477 flow [2024-11-16 23:46:48,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:48,931 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:48,931 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] [2024-11-16 23:46:48,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:46:48,932 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:48,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:48,932 INFO L85 PathProgramCache]: Analyzing trace with hash -116143487, now seen corresponding path program 1 times [2024-11-16 23:46:48,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:48,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124166609] [2024-11-16 23:46:48,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:48,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:49,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:49,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124166609] [2024-11-16 23:46:49,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124166609] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:49,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:49,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:46:49,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058638372] [2024-11-16 23:46:49,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:49,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:46:49,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:49,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:46:49,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:46:50,115 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 676 out of 858 [2024-11-16 23:46:50,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 728 transitions, 1477 flow. Second operand has 6 states, 6 states have (on average 677.5) internal successors, (4065), 6 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:50,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:50,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 676 of 858 [2024-11-16 23:46:50,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:52,275 INFO L124 PetriNetUnfolderBase]: 2081/10288 cut-off events. [2024-11-16 23:46:52,275 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-11-16 23:46:52,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13624 conditions, 10288 events. 2081/10288 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 92383 event pairs, 1421 based on Foata normal form. 0/8453 useless extension candidates. Maximal degree in co-relation 13510. Up to 2842 conditions per place. [2024-11-16 23:46:52,335 INFO L140 encePairwiseOnDemand]: 834/858 looper letters, 78 selfloop transitions, 20 changer transitions 0/724 dead transitions. [2024-11-16 23:46:52,335 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 724 transitions, 1665 flow [2024-11-16 23:46:52,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:46:52,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:46:52,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4157 transitions. [2024-11-16 23:46:52,343 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8074980574980575 [2024-11-16 23:46:52,343 INFO L175 Difference]: Start difference. First operand has 719 places, 728 transitions, 1477 flow. Second operand 6 states and 4157 transitions. [2024-11-16 23:46:52,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 724 transitions, 1665 flow [2024-11-16 23:46:52,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 724 transitions, 1661 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:52,354 INFO L231 Difference]: Finished difference. Result has 718 places, 724 transitions, 1505 flow [2024-11-16 23:46:52,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1505, PETRI_PLACES=718, PETRI_TRANSITIONS=724} [2024-11-16 23:46:52,355 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -86 predicate places. [2024-11-16 23:46:52,355 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 724 transitions, 1505 flow [2024-11-16 23:46:52,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 677.5) internal successors, (4065), 6 states have internal predecessors, (4065), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:52,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:52,357 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] [2024-11-16 23:46:52,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:46:52,357 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:52,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:52,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1301068284, now seen corresponding path program 1 times [2024-11-16 23:46:52,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:52,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338095981] [2024-11-16 23:46:52,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:52,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:52,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:52,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338095981] [2024-11-16 23:46:52,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338095981] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:52,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:52,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:52,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897737729] [2024-11-16 23:46:52,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:52,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:52,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:52,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:52,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 858 [2024-11-16 23:46:52,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 724 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:52,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:52,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 858 [2024-11-16 23:46:52,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:54,275 INFO L124 PetriNetUnfolderBase]: 681/9154 cut-off events. [2024-11-16 23:46:54,275 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-11-16 23:46:54,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10001 conditions, 9154 events. 681/9154 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 84303 event pairs, 287 based on Foata normal form. 0/7302 useless extension candidates. Maximal degree in co-relation 9937. Up to 689 conditions per place. [2024-11-16 23:46:54,316 INFO L140 encePairwiseOnDemand]: 851/858 looper letters, 24 selfloop transitions, 1 changer transitions 0/718 dead transitions. [2024-11-16 23:46:54,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 718 transitions, 1543 flow [2024-11-16 23:46:54,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:54,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:54,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2024-11-16 23:46:54,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8822843822843823 [2024-11-16 23:46:54,321 INFO L175 Difference]: Start difference. First operand has 718 places, 724 transitions, 1505 flow. Second operand 3 states and 2271 transitions. [2024-11-16 23:46:54,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 718 transitions, 1543 flow [2024-11-16 23:46:54,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 718 transitions, 1503 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:46:54,331 INFO L231 Difference]: Finished difference. Result has 709 places, 718 transitions, 1455 flow [2024-11-16 23:46:54,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=717, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1455, PETRI_PLACES=709, PETRI_TRANSITIONS=718} [2024-11-16 23:46:54,332 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -95 predicate places. [2024-11-16 23:46:54,332 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 718 transitions, 1455 flow [2024-11-16 23:46:54,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 748.0) internal successors, (2244), 3 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:54,333 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:54,333 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:54,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:46:54,333 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:54,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:54,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1735961696, now seen corresponding path program 1 times [2024-11-16 23:46:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112170561] [2024-11-16 23:46:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:54,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112170561] [2024-11-16 23:46:54,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112170561] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:54,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:54,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:54,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205917168] [2024-11-16 23:46:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:54,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:54,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:54,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:54,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 858 [2024-11-16 23:46:54,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 718 transitions, 1455 flow. Second operand has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:54,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:54,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 858 [2024-11-16 23:46:54,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:54,647 INFO L124 PetriNetUnfolderBase]: 131/1289 cut-off events. [2024-11-16 23:46:54,647 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-16 23:46:54,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1522 conditions, 1289 events. 131/1289 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5180 event pairs, 71 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 1407. Up to 175 conditions per place. [2024-11-16 23:46:54,663 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 17 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2024-11-16 23:46:54,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 717 transitions, 1491 flow [2024-11-16 23:46:54,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:54,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2024-11-16 23:46:54,667 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896658896658897 [2024-11-16 23:46:54,667 INFO L175 Difference]: Start difference. First operand has 709 places, 718 transitions, 1455 flow. Second operand 3 states and 2290 transitions. [2024-11-16 23:46:54,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 717 transitions, 1491 flow [2024-11-16 23:46:54,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 717 transitions, 1490 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:54,677 INFO L231 Difference]: Finished difference. Result has 709 places, 717 transitions, 1456 flow [2024-11-16 23:46:54,678 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=717, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=709, PETRI_TRANSITIONS=717} [2024-11-16 23:46:54,678 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -95 predicate places. [2024-11-16 23:46:54,678 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 717 transitions, 1456 flow [2024-11-16 23:46:54,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:54,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:54,679 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] [2024-11-16 23:46:54,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-16 23:46:54,680 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:54,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1819680031, now seen corresponding path program 1 times [2024-11-16 23:46:54,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:54,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803483931] [2024-11-16 23:46:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:54,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:54,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:54,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803483931] [2024-11-16 23:46:54,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803483931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:54,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:54,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741589373] [2024-11-16 23:46:54,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:54,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:54,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:54,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:54,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:54,732 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 858 [2024-11-16 23:46:54,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 717 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:54,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:54,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 858 [2024-11-16 23:46:54,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:54,906 INFO L124 PetriNetUnfolderBase]: 70/1088 cut-off events. [2024-11-16 23:46:54,907 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-16 23:46:54,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 1088 events. 70/1088 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3717 event pairs, 27 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1097. Up to 83 conditions per place. [2024-11-16 23:46:54,919 INFO L140 encePairwiseOnDemand]: 856/858 looper letters, 14 selfloop transitions, 1 changer transitions 0/716 dead transitions. [2024-11-16 23:46:54,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 716 transitions, 1484 flow [2024-11-16 23:46:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2301 transitions. [2024-11-16 23:46:54,924 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8939393939393939 [2024-11-16 23:46:54,924 INFO L175 Difference]: Start difference. First operand has 709 places, 717 transitions, 1456 flow. Second operand 3 states and 2301 transitions. [2024-11-16 23:46:54,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 716 transitions, 1484 flow [2024-11-16 23:46:54,928 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 716 transitions, 1480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:54,934 INFO L231 Difference]: Finished difference. Result has 708 places, 716 transitions, 1452 flow [2024-11-16 23:46:54,935 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=716, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=715, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=708, PETRI_TRANSITIONS=716} [2024-11-16 23:46:54,935 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -96 predicate places. [2024-11-16 23:46:54,936 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 716 transitions, 1452 flow [2024-11-16 23:46:54,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 763.0) internal successors, (2289), 3 states have internal predecessors, (2289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:54,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:54,937 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] [2024-11-16 23:46:54,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-16 23:46:54,937 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:54,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:54,937 INFO L85 PathProgramCache]: Analyzing trace with hash 847531406, now seen corresponding path program 1 times [2024-11-16 23:46:54,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:54,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070517760] [2024-11-16 23:46:54,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:54,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:54,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070517760] [2024-11-16 23:46:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070517760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:54,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:54,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:54,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324616232] [2024-11-16 23:46:54,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:54,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:54,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:54,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:54,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:55,005 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 858 [2024-11-16 23:46:55,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 716 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:55,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:55,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 858 [2024-11-16 23:46:55,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:55,263 INFO L124 PetriNetUnfolderBase]: 70/1087 cut-off events. [2024-11-16 23:46:55,263 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-16 23:46:55,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1212 conditions, 1087 events. 70/1087 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3717 event pairs, 27 based on Foata normal form. 0/959 useless extension candidates. Maximal degree in co-relation 1097. Up to 85 conditions per place. [2024-11-16 23:46:55,276 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 15 selfloop transitions, 2 changer transitions 0/715 dead transitions. [2024-11-16 23:46:55,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 715 transitions, 1484 flow [2024-11-16 23:46:55,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:55,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2294 transitions. [2024-11-16 23:46:55,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8912198912198912 [2024-11-16 23:46:55,282 INFO L175 Difference]: Start difference. First operand has 708 places, 716 transitions, 1452 flow. Second operand 3 states and 2294 transitions. [2024-11-16 23:46:55,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 715 transitions, 1484 flow [2024-11-16 23:46:55,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 715 transitions, 1483 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:55,291 INFO L231 Difference]: Finished difference. Result has 708 places, 715 transitions, 1453 flow [2024-11-16 23:46:55,292 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=715, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=713, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1453, PETRI_PLACES=708, PETRI_TRANSITIONS=715} [2024-11-16 23:46:55,293 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -96 predicate places. [2024-11-16 23:46:55,293 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 715 transitions, 1453 flow [2024-11-16 23:46:55,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.3333333333334) internal successors, (2281), 3 states have internal predecessors, (2281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:55,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:55,295 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] [2024-11-16 23:46:55,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-16 23:46:55,295 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:55,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:55,295 INFO L85 PathProgramCache]: Analyzing trace with hash 190098746, now seen corresponding path program 1 times [2024-11-16 23:46:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:55,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841187218] [2024-11-16 23:46:55,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:55,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:55,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:55,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841187218] [2024-11-16 23:46:55,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841187218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:55,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:55,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:55,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054992706] [2024-11-16 23:46:55,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:55,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:55,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:55,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:55,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:55,648 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 706 out of 858 [2024-11-16 23:46:55,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 715 transitions, 1453 flow. Second operand has 3 states, 3 states have (on average 708.0) internal successors, (2124), 3 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:55,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:55,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 706 of 858 [2024-11-16 23:46:55,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:57,772 INFO L124 PetriNetUnfolderBase]: 2081/10195 cut-off events. [2024-11-16 23:46:57,773 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-11-16 23:46:57,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13506 conditions, 10195 events. 2081/10195 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 91063 event pairs, 1421 based on Foata normal form. 0/8453 useless extension candidates. Maximal degree in co-relation 13392. Up to 2833 conditions per place. [2024-11-16 23:46:57,838 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 69 selfloop transitions, 2 changer transitions 0/714 dead transitions. [2024-11-16 23:46:57,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 714 transitions, 1593 flow [2024-11-16 23:46:57,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:57,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2189 transitions. [2024-11-16 23:46:57,843 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8504273504273504 [2024-11-16 23:46:57,843 INFO L175 Difference]: Start difference. First operand has 708 places, 715 transitions, 1453 flow. Second operand 3 states and 2189 transitions. [2024-11-16 23:46:57,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 714 transitions, 1593 flow [2024-11-16 23:46:57,847 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 714 transitions, 1589 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:57,855 INFO L231 Difference]: Finished difference. Result has 707 places, 714 transitions, 1451 flow [2024-11-16 23:46:57,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1447, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=714, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=712, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1451, PETRI_PLACES=707, PETRI_TRANSITIONS=714} [2024-11-16 23:46:57,856 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -97 predicate places. [2024-11-16 23:46:57,856 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 714 transitions, 1451 flow [2024-11-16 23:46:57,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 708.0) internal successors, (2124), 3 states have internal predecessors, (2124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:57,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:57,858 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:57,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-16 23:46:57,858 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:57,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1981126343, now seen corresponding path program 1 times [2024-11-16 23:46:57,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:57,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144399415] [2024-11-16 23:46:57,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:57,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:57,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:57,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:57,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144399415] [2024-11-16 23:46:57,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144399415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:57,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:57,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:57,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371365325] [2024-11-16 23:46:57,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:57,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:57,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:57,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:57,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:57,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 858 [2024-11-16 23:46:57,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 714 transitions, 1451 flow. Second operand has 3 states, 3 states have (on average 759.3333333333334) internal successors, (2278), 3 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:57,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:57,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 858 [2024-11-16 23:46:57,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:58,240 INFO L124 PetriNetUnfolderBase]: 110/1232 cut-off events. [2024-11-16 23:46:58,240 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-16 23:46:58,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1423 conditions, 1232 events. 110/1232 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4508 event pairs, 53 based on Foata normal form. 0/1069 useless extension candidates. Maximal degree in co-relation 1410. Up to 141 conditions per place. [2024-11-16 23:46:58,251 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 16 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2024-11-16 23:46:58,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 713 transitions, 1485 flow [2024-11-16 23:46:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2292 transitions. [2024-11-16 23:46:58,256 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8904428904428905 [2024-11-16 23:46:58,256 INFO L175 Difference]: Start difference. First operand has 707 places, 714 transitions, 1451 flow. Second operand 3 states and 2292 transitions. [2024-11-16 23:46:58,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 713 transitions, 1485 flow [2024-11-16 23:46:58,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 713 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:58,266 INFO L231 Difference]: Finished difference. Result has 706 places, 713 transitions, 1449 flow [2024-11-16 23:46:58,266 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1445, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=706, PETRI_TRANSITIONS=713} [2024-11-16 23:46:58,267 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -98 predicate places. [2024-11-16 23:46:58,267 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 713 transitions, 1449 flow [2024-11-16 23:46:58,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 759.3333333333334) internal successors, (2278), 3 states have internal predecessors, (2278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:58,268 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:58,268 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] [2024-11-16 23:46:58,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-16 23:46:58,269 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:58,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:58,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1384487493, now seen corresponding path program 1 times [2024-11-16 23:46:58,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:58,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722292734] [2024-11-16 23:46:58,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:58,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:58,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:58,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:58,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722292734] [2024-11-16 23:46:58,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722292734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:58,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:58,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:58,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789649941] [2024-11-16 23:46:58,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:58,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:58,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:58,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:58,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:58,346 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 858 [2024-11-16 23:46:58,348 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 713 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 751.0) internal successors, (2253), 3 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:58,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:58,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 858 [2024-11-16 23:46:58,348 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:58,940 INFO L124 PetriNetUnfolderBase]: 252/4820 cut-off events. [2024-11-16 23:46:58,940 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-16 23:46:58,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5098 conditions, 4820 events. 252/4820 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 35773 event pairs, 79 based on Foata normal form. 0/3928 useless extension candidates. Maximal degree in co-relation 4983. Up to 220 conditions per place. [2024-11-16 23:46:58,991 INFO L140 encePairwiseOnDemand]: 852/858 looper letters, 22 selfloop transitions, 1 changer transitions 0/708 dead transitions. [2024-11-16 23:46:58,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 708 transitions, 1485 flow [2024-11-16 23:46:58,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2024-11-16 23:46:58,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8846153846153846 [2024-11-16 23:46:58,995 INFO L175 Difference]: Start difference. First operand has 706 places, 713 transitions, 1449 flow. Second operand 3 states and 2277 transitions. [2024-11-16 23:46:58,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 708 transitions, 1485 flow [2024-11-16 23:46:58,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 708 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:46:59,003 INFO L231 Difference]: Finished difference. Result has 701 places, 708 transitions, 1437 flow [2024-11-16 23:46:59,004 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1437, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2024-11-16 23:46:59,004 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -103 predicate places. [2024-11-16 23:46:59,004 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1437 flow [2024-11-16 23:46:59,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.0) internal successors, (2253), 3 states have internal predecessors, (2253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:59,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:59,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:59,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-16 23:46:59,005 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:59,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash 104802837, now seen corresponding path program 1 times [2024-11-16 23:46:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599716618] [2024-11-16 23:46:59,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:59,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:59,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:59,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599716618] [2024-11-16 23:46:59,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599716618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:59,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:59,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910278802] [2024-11-16 23:46:59,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:59,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:59,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:59,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:59,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:59,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 858 [2024-11-16 23:46:59,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:59,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:59,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 858 [2024-11-16 23:46:59,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:46:59,277 INFO L124 PetriNetUnfolderBase]: 110/1226 cut-off events. [2024-11-16 23:46:59,277 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-16 23:46:59,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1417 conditions, 1226 events. 110/1226 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 4832 event pairs, 53 based on Foata normal form. 0/1071 useless extension candidates. Maximal degree in co-relation 1302. Up to 142 conditions per place. [2024-11-16 23:46:59,287 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 17 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2024-11-16 23:46:59,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 707 transitions, 1473 flow [2024-11-16 23:46:59,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:46:59,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:46:59,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2024-11-16 23:46:59,290 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896658896658897 [2024-11-16 23:46:59,290 INFO L175 Difference]: Start difference. First operand has 701 places, 708 transitions, 1437 flow. Second operand 3 states and 2290 transitions. [2024-11-16 23:46:59,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 707 transitions, 1473 flow [2024-11-16 23:46:59,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 707 transitions, 1472 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:46:59,297 INFO L231 Difference]: Finished difference. Result has 701 places, 707 transitions, 1438 flow [2024-11-16 23:46:59,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1434, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=701, PETRI_TRANSITIONS=707} [2024-11-16 23:46:59,298 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -103 predicate places. [2024-11-16 23:46:59,298 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 707 transitions, 1438 flow [2024-11-16 23:46:59,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.3333333333334) internal successors, (2275), 3 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:59,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:46:59,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:46:59,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-16 23:46:59,299 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:46:59,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:46:59,299 INFO L85 PathProgramCache]: Analyzing trace with hash -304918717, now seen corresponding path program 1 times [2024-11-16 23:46:59,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:46:59,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144599989] [2024-11-16 23:46:59,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:46:59,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:46:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:46:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:46:59,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:46:59,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144599989] [2024-11-16 23:46:59,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144599989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:46:59,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:46:59,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:46:59,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894687821] [2024-11-16 23:46:59,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:46:59,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:46:59,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:46:59,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:46:59,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:46:59,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 858 [2024-11-16 23:46:59,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 707 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:46:59,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:46:59,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 858 [2024-11-16 23:46:59,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:00,172 INFO L124 PetriNetUnfolderBase]: 293/5109 cut-off events. [2024-11-16 23:47:00,172 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-16 23:47:00,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5452 conditions, 5109 events. 293/5109 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 37450 event pairs, 32 based on Foata normal form. 0/4189 useless extension candidates. Maximal degree in co-relation 5338. Up to 231 conditions per place. [2024-11-16 23:47:00,221 INFO L140 encePairwiseOnDemand]: 853/858 looper letters, 26 selfloop transitions, 3 changer transitions 0/717 dead transitions. [2024-11-16 23:47:00,221 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 717 transitions, 1524 flow [2024-11-16 23:47:00,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:00,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:00,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2307 transitions. [2024-11-16 23:47:00,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8962703962703963 [2024-11-16 23:47:00,226 INFO L175 Difference]: Start difference. First operand has 701 places, 707 transitions, 1438 flow. Second operand 3 states and 2307 transitions. [2024-11-16 23:47:00,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 717 transitions, 1524 flow [2024-11-16 23:47:00,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 717 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:47:00,234 INFO L231 Difference]: Finished difference. Result has 700 places, 708 transitions, 1453 flow [2024-11-16 23:47:00,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1453, PETRI_PLACES=700, PETRI_TRANSITIONS=708} [2024-11-16 23:47:00,235 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -104 predicate places. [2024-11-16 23:47:00,235 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 708 transitions, 1453 flow [2024-11-16 23:47:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:00,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:00,236 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:00,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-16 23:47:00,237 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:00,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -969043228, now seen corresponding path program 1 times [2024-11-16 23:47:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:00,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826308214] [2024-11-16 23:47:00,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:00,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:00,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:00,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:00,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826308214] [2024-11-16 23:47:00,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826308214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:00,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:00,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:00,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112078625] [2024-11-16 23:47:00,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:00,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:00,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:00,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:00,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:00,340 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 858 [2024-11-16 23:47:00,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 708 transitions, 1453 flow. Second operand has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:00,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:00,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 858 [2024-11-16 23:47:00,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:01,439 INFO L124 PetriNetUnfolderBase]: 364/5562 cut-off events. [2024-11-16 23:47:01,439 INFO L125 PetriNetUnfolderBase]: For 178/220 co-relation queries the response was YES. [2024-11-16 23:47:01,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6090 conditions, 5562 events. 364/5562 cut-off events. For 178/220 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 42116 event pairs, 54 based on Foata normal form. 0/4568 useless extension candidates. Maximal degree in co-relation 5975. Up to 301 conditions per place. [2024-11-16 23:47:01,496 INFO L140 encePairwiseOnDemand]: 853/858 looper letters, 27 selfloop transitions, 4 changer transitions 0/719 dead transitions. [2024-11-16 23:47:01,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 719 transitions, 1552 flow [2024-11-16 23:47:01,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:01,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2307 transitions. [2024-11-16 23:47:01,499 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8962703962703963 [2024-11-16 23:47:01,499 INFO L175 Difference]: Start difference. First operand has 700 places, 708 transitions, 1453 flow. Second operand 3 states and 2307 transitions. [2024-11-16 23:47:01,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 719 transitions, 1552 flow [2024-11-16 23:47:01,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 719 transitions, 1552 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:47:01,511 INFO L231 Difference]: Finished difference. Result has 701 places, 710 transitions, 1486 flow [2024-11-16 23:47:01,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1449, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1486, PETRI_PLACES=701, PETRI_TRANSITIONS=710} [2024-11-16 23:47:01,512 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -103 predicate places. [2024-11-16 23:47:01,513 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 710 transitions, 1486 flow [2024-11-16 23:47:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.0) internal successors, (2280), 3 states have internal predecessors, (2280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:01,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:01,514 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] [2024-11-16 23:47:01,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-16 23:47:01,514 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:01,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:01,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1515045738, now seen corresponding path program 1 times [2024-11-16 23:47:01,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:01,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047114150] [2024-11-16 23:47:01,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:01,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:01,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:01,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047114150] [2024-11-16 23:47:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047114150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:01,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:01,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:01,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996333461] [2024-11-16 23:47:01,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:01,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:01,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:01,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:01,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:01,599 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 763 out of 858 [2024-11-16 23:47:01,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 710 transitions, 1486 flow. Second operand has 3 states, 3 states have (on average 764.0) internal successors, (2292), 3 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:01,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:01,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 763 of 858 [2024-11-16 23:47:01,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:02,245 INFO L124 PetriNetUnfolderBase]: 281/4332 cut-off events. [2024-11-16 23:47:02,245 INFO L125 PetriNetUnfolderBase]: For 363/617 co-relation queries the response was YES. [2024-11-16 23:47:02,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4950 conditions, 4332 events. 281/4332 cut-off events. For 363/617 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 29659 event pairs, 46 based on Foata normal form. 1/3604 useless extension candidates. Maximal degree in co-relation 4835. Up to 227 conditions per place. [2024-11-16 23:47:02,276 INFO L140 encePairwiseOnDemand]: 853/858 looper letters, 23 selfloop transitions, 4 changer transitions 0/719 dead transitions. [2024-11-16 23:47:02,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 719 transitions, 1590 flow [2024-11-16 23:47:02,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:02,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2309 transitions. [2024-11-16 23:47:02,279 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.897047397047397 [2024-11-16 23:47:02,279 INFO L175 Difference]: Start difference. First operand has 701 places, 710 transitions, 1486 flow. Second operand 3 states and 2309 transitions. [2024-11-16 23:47:02,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 719 transitions, 1590 flow [2024-11-16 23:47:02,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 719 transitions, 1590 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:47:02,286 INFO L231 Difference]: Finished difference. Result has 703 places, 712 transitions, 1508 flow [2024-11-16 23:47:02,286 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=703, PETRI_TRANSITIONS=712} [2024-11-16 23:47:02,287 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -101 predicate places. [2024-11-16 23:47:02,287 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 712 transitions, 1508 flow [2024-11-16 23:47:02,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 764.0) internal successors, (2292), 3 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:02,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:02,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:02,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-16 23:47:02,288 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:02,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:02,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1848480715, now seen corresponding path program 1 times [2024-11-16 23:47:02,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:02,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715101822] [2024-11-16 23:47:02,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:02,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:02,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:02,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:02,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:02,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715101822] [2024-11-16 23:47:02,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715101822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:02,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:02,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:02,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087290258] [2024-11-16 23:47:02,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:02,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:02,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:02,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:02,362 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 858 [2024-11-16 23:47:02,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 712 transitions, 1508 flow. Second operand has 3 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:02,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:02,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 858 [2024-11-16 23:47:02,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:03,725 INFO L124 PetriNetUnfolderBase]: 616/9938 cut-off events. [2024-11-16 23:47:03,725 INFO L125 PetriNetUnfolderBase]: For 840/882 co-relation queries the response was YES. [2024-11-16 23:47:03,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11277 conditions, 9938 events. 616/9938 cut-off events. For 840/882 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 93791 event pairs, 76 based on Foata normal form. 0/8193 useless extension candidates. Maximal degree in co-relation 11161. Up to 300 conditions per place. [2024-11-16 23:47:03,807 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 30 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-11-16 23:47:03,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 723 transitions, 1632 flow [2024-11-16 23:47:03,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:03,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:03,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2308 transitions. [2024-11-16 23:47:03,811 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8966588966588966 [2024-11-16 23:47:03,811 INFO L175 Difference]: Start difference. First operand has 703 places, 712 transitions, 1508 flow. Second operand 3 states and 2308 transitions. [2024-11-16 23:47:03,811 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 723 transitions, 1632 flow [2024-11-16 23:47:03,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 723 transitions, 1625 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:47:03,821 INFO L231 Difference]: Finished difference. Result has 703 places, 711 transitions, 1506 flow [2024-11-16 23:47:03,821 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=711, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1506, PETRI_PLACES=703, PETRI_TRANSITIONS=711} [2024-11-16 23:47:03,822 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -101 predicate places. [2024-11-16 23:47:03,822 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 711 transitions, 1506 flow [2024-11-16 23:47:03,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 763.6666666666666) internal successors, (2291), 3 states have internal predecessors, (2291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:03,823 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:03,823 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] [2024-11-16 23:47:03,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-16 23:47:03,824 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:03,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:03,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1422455153, now seen corresponding path program 1 times [2024-11-16 23:47:03,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:03,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106250242] [2024-11-16 23:47:03,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:03,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:03,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:03,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:03,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:03,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106250242] [2024-11-16 23:47:03,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106250242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:03,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:03,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:03,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903610047] [2024-11-16 23:47:03,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:03,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:03,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:03,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:03,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:03,932 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 759 out of 858 [2024-11-16 23:47:03,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 711 transitions, 1506 flow. Second operand has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:03,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:03,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 759 of 858 [2024-11-16 23:47:03,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:05,948 INFO L124 PetriNetUnfolderBase]: 802/11971 cut-off events. [2024-11-16 23:47:05,949 INFO L125 PetriNetUnfolderBase]: For 1019/1333 co-relation queries the response was YES. [2024-11-16 23:47:05,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13711 conditions, 11971 events. 802/11971 cut-off events. For 1019/1333 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 115916 event pairs, 89 based on Foata normal form. 2/9859 useless extension candidates. Maximal degree in co-relation 13594. Up to 609 conditions per place. [2024-11-16 23:47:06,019 INFO L140 encePairwiseOnDemand]: 854/858 looper letters, 36 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2024-11-16 23:47:06,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 725 transitions, 1651 flow [2024-11-16 23:47:06,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:06,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:06,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2306 transitions. [2024-11-16 23:47:06,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8958818958818959 [2024-11-16 23:47:06,022 INFO L175 Difference]: Start difference. First operand has 703 places, 711 transitions, 1506 flow. Second operand 3 states and 2306 transitions. [2024-11-16 23:47:06,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 725 transitions, 1651 flow [2024-11-16 23:47:06,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 725 transitions, 1647 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:47:06,033 INFO L231 Difference]: Finished difference. Result has 702 places, 711 transitions, 1512 flow [2024-11-16 23:47:06,034 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1512, PETRI_PLACES=702, PETRI_TRANSITIONS=711} [2024-11-16 23:47:06,035 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -102 predicate places. [2024-11-16 23:47:06,035 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 711 transitions, 1512 flow [2024-11-16 23:47:06,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 760.6666666666666) internal successors, (2282), 3 states have internal predecessors, (2282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:06,036 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:06,036 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] [2024-11-16 23:47:06,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-16 23:47:06,036 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err34ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:06,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:06,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1979221077, now seen corresponding path program 1 times [2024-11-16 23:47:06,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:06,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840604541] [2024-11-16 23:47:06,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:06,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:06,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:06,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:06,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:06,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840604541] [2024-11-16 23:47:06,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840604541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:06,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:06,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:06,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131348904] [2024-11-16 23:47:06,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:06,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:06,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:06,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:06,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:06,146 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 858 [2024-11-16 23:47:06,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 711 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:06,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:06,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 858 [2024-11-16 23:47:06,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:08,186 INFO L124 PetriNetUnfolderBase]: 1395/13181 cut-off events. [2024-11-16 23:47:08,186 INFO L125 PetriNetUnfolderBase]: For 2108/2200 co-relation queries the response was YES. [2024-11-16 23:47:08,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16620 conditions, 13181 events. 1395/13181 cut-off events. For 2108/2200 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 129335 event pairs, 139 based on Foata normal form. 5/11157 useless extension candidates. Maximal degree in co-relation 16502. Up to 1241 conditions per place. [2024-11-16 23:47:08,308 INFO L140 encePairwiseOnDemand]: 851/858 looper letters, 34 selfloop transitions, 2 changer transitions 5/719 dead transitions. [2024-11-16 23:47:08,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 719 transitions, 1639 flow [2024-11-16 23:47:08,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:08,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2287 transitions. [2024-11-16 23:47:08,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8885003885003885 [2024-11-16 23:47:08,310 INFO L175 Difference]: Start difference. First operand has 702 places, 711 transitions, 1512 flow. Second operand 3 states and 2287 transitions. [2024-11-16 23:47:08,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 719 transitions, 1639 flow [2024-11-16 23:47:08,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 719 transitions, 1639 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:47:08,320 INFO L231 Difference]: Finished difference. Result has 700 places, 702 transitions, 1493 flow [2024-11-16 23:47:08,321 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=707, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=705, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1493, PETRI_PLACES=700, PETRI_TRANSITIONS=702} [2024-11-16 23:47:08,322 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -104 predicate places. [2024-11-16 23:47:08,322 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 702 transitions, 1493 flow [2024-11-16 23:47:08,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.0) internal successors, (2262), 3 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:08,323 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:08,323 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] [2024-11-16 23:47:08,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-16 23:47:08,323 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:08,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash -320578317, now seen corresponding path program 1 times [2024-11-16 23:47:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667870425] [2024-11-16 23:47:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:08,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:08,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:08,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667870425] [2024-11-16 23:47:08,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667870425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:08,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:08,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 23:47:08,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493010860] [2024-11-16 23:47:08,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 23:47:08,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:08,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 23:47:08,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 23:47:08,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 758 out of 858 [2024-11-16 23:47:08,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 702 transitions, 1493 flow. Second operand has 4 states, 4 states have (on average 759.75) internal successors, (3039), 4 states have internal predecessors, (3039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:08,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:08,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 758 of 858 [2024-11-16 23:47:08,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:10,533 INFO L124 PetriNetUnfolderBase]: 753/11947 cut-off events. [2024-11-16 23:47:10,534 INFO L125 PetriNetUnfolderBase]: For 1177/1396 co-relation queries the response was YES. [2024-11-16 23:47:10,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13955 conditions, 11947 events. 753/11947 cut-off events. For 1177/1396 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 114369 event pairs, 91 based on Foata normal form. 7/10017 useless extension candidates. Maximal degree in co-relation 13835. Up to 263 conditions per place. [2024-11-16 23:47:10,662 INFO L140 encePairwiseOnDemand]: 851/858 looper letters, 35 selfloop transitions, 6 changer transitions 0/719 dead transitions. [2024-11-16 23:47:10,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 719 transitions, 1681 flow [2024-11-16 23:47:10,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 23:47:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-16 23:47:10,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3060 transitions. [2024-11-16 23:47:10,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8916083916083916 [2024-11-16 23:47:10,665 INFO L175 Difference]: Start difference. First operand has 700 places, 702 transitions, 1493 flow. Second operand 4 states and 3060 transitions. [2024-11-16 23:47:10,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 719 transitions, 1681 flow [2024-11-16 23:47:10,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 719 transitions, 1677 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:47:10,672 INFO L231 Difference]: Finished difference. Result has 697 places, 701 transitions, 1499 flow [2024-11-16 23:47:10,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1499, PETRI_PLACES=697, PETRI_TRANSITIONS=701} [2024-11-16 23:47:10,673 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -107 predicate places. [2024-11-16 23:47:10,673 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 701 transitions, 1499 flow [2024-11-16 23:47:10,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 759.75) internal successors, (3039), 4 states have internal predecessors, (3039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:10,674 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:10,674 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] [2024-11-16 23:47:10,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-16 23:47:10,674 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err31ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:10,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:10,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1135796488, now seen corresponding path program 1 times [2024-11-16 23:47:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895363602] [2024-11-16 23:47:10,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:10,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:10,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:10,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:10,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:10,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895363602] [2024-11-16 23:47:10,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895363602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:10,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:10,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:10,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175221] [2024-11-16 23:47:10,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:10,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:10,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:10,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:10,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:10,782 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 731 out of 858 [2024-11-16 23:47:10,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 701 transitions, 1499 flow. Second operand has 3 states, 3 states have (on average 733.0) internal successors, (2199), 3 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:10,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:10,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 731 of 858 [2024-11-16 23:47:10,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:13,478 INFO L124 PetriNetUnfolderBase]: 2838/15369 cut-off events. [2024-11-16 23:47:13,478 INFO L125 PetriNetUnfolderBase]: For 5183/5263 co-relation queries the response was YES. [2024-11-16 23:47:13,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23308 conditions, 15369 events. 2838/15369 cut-off events. For 5183/5263 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 155432 event pairs, 112 based on Foata normal form. 0/13691 useless extension candidates. Maximal degree in co-relation 23187. Up to 3602 conditions per place. [2024-11-16 23:47:13,605 INFO L140 encePairwiseOnDemand]: 844/858 looper letters, 50 selfloop transitions, 3 changer transitions 0/703 dead transitions. [2024-11-16 23:47:13,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 703 transitions, 1646 flow [2024-11-16 23:47:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:13,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2246 transitions. [2024-11-16 23:47:13,608 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8725718725718725 [2024-11-16 23:47:13,608 INFO L175 Difference]: Start difference. First operand has 697 places, 701 transitions, 1499 flow. Second operand 3 states and 2246 transitions. [2024-11-16 23:47:13,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 703 transitions, 1646 flow [2024-11-16 23:47:13,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 703 transitions, 1632 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-16 23:47:13,619 INFO L231 Difference]: Finished difference. Result has 686 places, 691 transitions, 1478 flow [2024-11-16 23:47:13,620 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1465, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=687, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=686, PETRI_TRANSITIONS=691} [2024-11-16 23:47:13,620 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -118 predicate places. [2024-11-16 23:47:13,620 INFO L471 AbstractCegarLoop]: Abstraction has has 686 places, 691 transitions, 1478 flow [2024-11-16 23:47:13,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.0) internal successors, (2199), 3 states have internal predecessors, (2199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:13,621 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:13,621 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] [2024-11-16 23:47:13,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-16 23:47:13,622 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:13,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:13,622 INFO L85 PathProgramCache]: Analyzing trace with hash 549298820, now seen corresponding path program 1 times [2024-11-16 23:47:13,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:13,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333645311] [2024-11-16 23:47:13,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:13,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:13,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:14,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:14,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:14,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333645311] [2024-11-16 23:47:14,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333645311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:14,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:14,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 23:47:14,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215347410] [2024-11-16 23:47:14,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:14,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 23:47:14,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:14,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 23:47:14,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-16 23:47:14,523 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 720 out of 858 [2024-11-16 23:47:14,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 691 transitions, 1478 flow. Second operand has 8 states, 8 states have (on average 724.25) internal successors, (5794), 8 states have internal predecessors, (5794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:14,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:14,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 720 of 858 [2024-11-16 23:47:14,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:16,149 INFO L124 PetriNetUnfolderBase]: 709/7428 cut-off events. [2024-11-16 23:47:16,150 INFO L125 PetriNetUnfolderBase]: For 1578/2359 co-relation queries the response was YES. [2024-11-16 23:47:16,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9762 conditions, 7428 events. 709/7428 cut-off events. For 1578/2359 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 57772 event pairs, 269 based on Foata normal form. 20/6523 useless extension candidates. Maximal degree in co-relation 9640. Up to 740 conditions per place. [2024-11-16 23:47:16,268 INFO L140 encePairwiseOnDemand]: 847/858 looper letters, 94 selfloop transitions, 12 changer transitions 0/736 dead transitions. [2024-11-16 23:47:16,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 736 transitions, 1821 flow [2024-11-16 23:47:16,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 23:47:16,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-16 23:47:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6576 transitions. [2024-11-16 23:47:16,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8515928515928516 [2024-11-16 23:47:16,273 INFO L175 Difference]: Start difference. First operand has 686 places, 691 transitions, 1478 flow. Second operand 9 states and 6576 transitions. [2024-11-16 23:47:16,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 736 transitions, 1821 flow [2024-11-16 23:47:16,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 736 transitions, 1818 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:47:16,284 INFO L231 Difference]: Finished difference. Result has 696 places, 696 transitions, 1525 flow [2024-11-16 23:47:16,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=691, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1525, PETRI_PLACES=696, PETRI_TRANSITIONS=696} [2024-11-16 23:47:16,286 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -108 predicate places. [2024-11-16 23:47:16,286 INFO L471 AbstractCegarLoop]: Abstraction has has 696 places, 696 transitions, 1525 flow [2024-11-16 23:47:16,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 724.25) internal successors, (5794), 8 states have internal predecessors, (5794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:16,287 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:16,287 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:16,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-16 23:47:16,288 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:16,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:16,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1491131299, now seen corresponding path program 1 times [2024-11-16 23:47:16,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:16,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125791477] [2024-11-16 23:47:16,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:16,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:17,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:17,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125791477] [2024-11-16 23:47:17,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125791477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:17,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:17,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627191305] [2024-11-16 23:47:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:17,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:17,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 705 out of 858 [2024-11-16 23:47:17,424 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 696 places, 696 transitions, 1525 flow. Second operand has 6 states, 6 states have (on average 706.6666666666666) internal successors, (4240), 6 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:17,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:17,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 705 of 858 [2024-11-16 23:47:17,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:24,115 INFO L124 PetriNetUnfolderBase]: 6545/30039 cut-off events. [2024-11-16 23:47:24,116 INFO L125 PetriNetUnfolderBase]: For 10788/10792 co-relation queries the response was YES. [2024-11-16 23:47:24,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47452 conditions, 30039 events. 6545/30039 cut-off events. For 10788/10792 co-relation queries the response was YES. Maximal size of possible extension queue 299. Compared 332455 event pairs, 3852 based on Foata normal form. 0/26780 useless extension candidates. Maximal degree in co-relation 47325. Up to 9158 conditions per place. [2024-11-16 23:47:24,343 INFO L140 encePairwiseOnDemand]: 852/858 looper letters, 70 selfloop transitions, 5 changer transitions 0/695 dead transitions. [2024-11-16 23:47:24,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 700 places, 695 transitions, 1673 flow [2024-11-16 23:47:24,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:24,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:24,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4300 transitions. [2024-11-16 23:47:24,346 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8352758352758353 [2024-11-16 23:47:24,346 INFO L175 Difference]: Start difference. First operand has 696 places, 696 transitions, 1525 flow. Second operand 6 states and 4300 transitions. [2024-11-16 23:47:24,346 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 700 places, 695 transitions, 1673 flow [2024-11-16 23:47:24,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 698 places, 695 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:47:24,354 INFO L231 Difference]: Finished difference. Result has 698 places, 695 transitions, 1526 flow [2024-11-16 23:47:24,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1526, PETRI_PLACES=698, PETRI_TRANSITIONS=695} [2024-11-16 23:47:24,355 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -106 predicate places. [2024-11-16 23:47:24,355 INFO L471 AbstractCegarLoop]: Abstraction has has 698 places, 695 transitions, 1526 flow [2024-11-16 23:47:24,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 706.6666666666666) internal successors, (4240), 6 states have internal predecessors, (4240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:24,356 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:24,356 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] [2024-11-16 23:47:24,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-16 23:47:24,356 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:24,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:24,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1902699489, now seen corresponding path program 1 times [2024-11-16 23:47:24,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:24,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144678529] [2024-11-16 23:47:24,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:24,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:24,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:24,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:24,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144678529] [2024-11-16 23:47:24,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144678529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:24,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:24,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:24,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855128010] [2024-11-16 23:47:24,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:24,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:24,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:24,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:24,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:24,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 858 [2024-11-16 23:47:24,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 698 places, 695 transitions, 1526 flow. Second operand has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:24,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:24,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 858 [2024-11-16 23:47:24,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:27,675 INFO L124 PetriNetUnfolderBase]: 1841/19553 cut-off events. [2024-11-16 23:47:27,675 INFO L125 PetriNetUnfolderBase]: For 2967/2971 co-relation queries the response was YES. [2024-11-16 23:47:27,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24475 conditions, 19553 events. 1841/19553 cut-off events. For 2967/2971 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 213715 event pairs, 212 based on Foata normal form. 0/17501 useless extension candidates. Maximal degree in co-relation 24352. Up to 1988 conditions per place. [2024-11-16 23:47:27,885 INFO L140 encePairwiseOnDemand]: 853/858 looper letters, 33 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2024-11-16 23:47:27,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 704 transitions, 1642 flow [2024-11-16 23:47:27,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:27,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2297 transitions. [2024-11-16 23:47:27,887 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8923853923853924 [2024-11-16 23:47:27,887 INFO L175 Difference]: Start difference. First operand has 698 places, 695 transitions, 1526 flow. Second operand 3 states and 2297 transitions. [2024-11-16 23:47:27,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 704 transitions, 1642 flow [2024-11-16 23:47:27,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 704 transitions, 1632 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:47:27,896 INFO L231 Difference]: Finished difference. Result has 693 places, 694 transitions, 1526 flow [2024-11-16 23:47:27,897 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=690, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=692, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=690, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1526, PETRI_PLACES=693, PETRI_TRANSITIONS=694} [2024-11-16 23:47:27,897 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -111 predicate places. [2024-11-16 23:47:27,897 INFO L471 AbstractCegarLoop]: Abstraction has has 693 places, 694 transitions, 1526 flow [2024-11-16 23:47:27,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 758.0) internal successors, (2274), 3 states have internal predecessors, (2274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:27,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:27,898 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:27,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-16 23:47:27,898 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:27,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:27,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1456856427, now seen corresponding path program 1 times [2024-11-16 23:47:27,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:27,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862719118] [2024-11-16 23:47:27,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:27,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:27,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:28,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:47:28,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:28,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862719118] [2024-11-16 23:47:28,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862719118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:28,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:28,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:28,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291632289] [2024-11-16 23:47:28,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:28,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:28,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:28,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:28,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:29,108 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 858 [2024-11-16 23:47:29,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 694 transitions, 1526 flow. Second operand has 6 states, 6 states have (on average 736.5) internal successors, (4419), 6 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:29,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:29,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 858 [2024-11-16 23:47:29,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:30,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2398] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_259 4)) (.cse14 (* v_~front1~0_355 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse2 (select |v_#race_837| v_~produce~0.base_71)) (.cse7 (not |v_thread1_#t~short2#1_227|)) (.cse1 (+ v_~front1~0_355 v_~size1~0_259)) (.cse0 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~produce~0.offset_71 .cse15)) (.cse6 (+ v_~produce~0.offset_71 .cse15 1)) (.cse8 (+ 2 v_~produce~0.offset_71 .cse15)) (.cse3 (+ v_~produce~0.offset_71 3 .cse15)) (.cse4 (+ .cse13 .cse14 v_~queue1~0.offset_209))) (and (or (and .cse0 (< .cse1 0)) (and (<= 0 .cse1) |v_thread1_#t~short1#1_213|)) (= (select .cse2 .cse3) 0) (= |v_#race~front1~0_530| 0) (not (= (ite (= (select (select |v_#memory_int_197| v_~queue1~0.base_209) .cse4) (select (select |v_#memory_int_197| v_~produce~0.base_71) .cse5)) 1 0) 0)) (= (select .cse2 .cse5) 0) (= (select .cse2 .cse6) 0) (= (+ v_~size1~0_259 1) v_~size1~0_258) (or (and .cse7 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (= (select .cse2 .cse8) 0) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse9 (= |v_#race~state11~0_173| 0))) (or (and .cse7 .cse9 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse9 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (= |v_#race~queue1~0_322| 0) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (let ((.cse10 (= |v_#race~size1~0_355| 0)) (.cse11 (= |v_#race~front1~0_562| 0))) (or (and |v_thread1_#t~short1#1_213| .cse10 .cse11 (= |v_#race~n_queue~0_227| 0) (or (and (<= v_~n_queue~0_94 .cse1) (not |v_thread1_#t~short1#1_214|)) (and (< .cse1 v_~n_queue~0_94) |v_thread1_#t~short1#1_214|))) (and (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) (= |v_#race~n_queue~0_228| |v_#race~n_queue~0_227|) .cse10 .cse11 .cse0))) (= |v_#race_837| (let ((.cse12 (store |v_#race_838| v_~queue1~0.base_209 (store (store (store (store (select |v_#race_838| v_~queue1~0.base_209) .cse4 0) (+ .cse13 .cse14 v_~queue1~0.offset_209 1) 0) (+ .cse13 2 .cse14 v_~queue1~0.offset_209) 0) (+ .cse13 3 .cse14 v_~queue1~0.offset_209) 0)))) (store .cse12 v_~produce~0.base_71 (store (store (store (store (select .cse12 v_~produce~0.base_71) .cse5 0) .cse6 0) .cse8 0) .cse3 0)))) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_838|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_259, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_209, #race~n_queue~0=|v_#race~n_queue~0_228|, ~n_queue~0=v_~n_queue~0_94, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, ~front1~0=v_~front1~0_355} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_341|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_209, #race~front1~0=|v_#race~front1~0_530|, #race~n_queue~0=|v_#race~n_queue~0_227|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_355, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_837|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_258, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, #race~queue1~0=|v_#race~queue1~0_322|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~front1~0_562|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_#race~size1~0_355|, |v_thread1_#t~short2#1_228|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][565], [884#(= |#race~n_queue~0| 0), Black: 959#true, 553#L95-29true, Black: 928#true, 612#L83true, 878#(= |#race~n_update~0| 0), Black: 900#true, 906#(= |#race~n2~0| 0), 896#(= |#race~n1~0| 0), 963#true, Black: 904#true, Black: 843#(= |#race~state12~0| 0), 683#L58-12true, Black: 908#true, 719#L135-1true, 902#(= |#race~consume~0| 0), 917#(= |#race~update~0| 0), 961#(= |#race~produce~0| 0), Black: 945#(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: 915#true, Black: 943#(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: 937#(<= ~n_produce~0 0), 866#(= |#race~n_produce~0| 0)]) [2024-11-16 23:47:30,695 INFO L294 olderBase$Statistics]: this new event has 525 ancestors and is cut-off event [2024-11-16 23:47:30,695 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-16 23:47:30,696 INFO L297 olderBase$Statistics]: existing Event has 477 ancestors and is cut-off event [2024-11-16 23:47:30,696 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2024-11-16 23:47:30,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2398] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_259 4)) (.cse14 (* v_~front1~0_355 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse2 (select |v_#race_837| v_~produce~0.base_71)) (.cse7 (not |v_thread1_#t~short2#1_227|)) (.cse1 (+ v_~front1~0_355 v_~size1~0_259)) (.cse0 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~produce~0.offset_71 .cse15)) (.cse6 (+ v_~produce~0.offset_71 .cse15 1)) (.cse8 (+ 2 v_~produce~0.offset_71 .cse15)) (.cse3 (+ v_~produce~0.offset_71 3 .cse15)) (.cse4 (+ .cse13 .cse14 v_~queue1~0.offset_209))) (and (or (and .cse0 (< .cse1 0)) (and (<= 0 .cse1) |v_thread1_#t~short1#1_213|)) (= (select .cse2 .cse3) 0) (= |v_#race~front1~0_530| 0) (not (= (ite (= (select (select |v_#memory_int_197| v_~queue1~0.base_209) .cse4) (select (select |v_#memory_int_197| v_~produce~0.base_71) .cse5)) 1 0) 0)) (= (select .cse2 .cse5) 0) (= (select .cse2 .cse6) 0) (= (+ v_~size1~0_259 1) v_~size1~0_258) (or (and .cse7 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (= (select .cse2 .cse8) 0) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse9 (= |v_#race~state11~0_173| 0))) (or (and .cse7 .cse9 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse9 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (= |v_#race~queue1~0_322| 0) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (let ((.cse10 (= |v_#race~size1~0_355| 0)) (.cse11 (= |v_#race~front1~0_562| 0))) (or (and |v_thread1_#t~short1#1_213| .cse10 .cse11 (= |v_#race~n_queue~0_227| 0) (or (and (<= v_~n_queue~0_94 .cse1) (not |v_thread1_#t~short1#1_214|)) (and (< .cse1 v_~n_queue~0_94) |v_thread1_#t~short1#1_214|))) (and (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) (= |v_#race~n_queue~0_228| |v_#race~n_queue~0_227|) .cse10 .cse11 .cse0))) (= |v_#race_837| (let ((.cse12 (store |v_#race_838| v_~queue1~0.base_209 (store (store (store (store (select |v_#race_838| v_~queue1~0.base_209) .cse4 0) (+ .cse13 .cse14 v_~queue1~0.offset_209 1) 0) (+ .cse13 2 .cse14 v_~queue1~0.offset_209) 0) (+ .cse13 3 .cse14 v_~queue1~0.offset_209) 0)))) (store .cse12 v_~produce~0.base_71 (store (store (store (store (select .cse12 v_~produce~0.base_71) .cse5 0) .cse6 0) .cse8 0) .cse3 0)))) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_838|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_259, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_209, #race~n_queue~0=|v_#race~n_queue~0_228|, ~n_queue~0=v_~n_queue~0_94, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, ~front1~0=v_~front1~0_355} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_341|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_209, #race~front1~0=|v_#race~front1~0_530|, #race~n_queue~0=|v_#race~n_queue~0_227|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_355, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_837|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_258, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, #race~queue1~0=|v_#race~queue1~0_322|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~front1~0_562|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_#race~size1~0_355|, |v_thread1_#t~short2#1_228|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][565], [884#(= |#race~n_queue~0| 0), Black: 959#true, 553#L95-29true, Black: 928#true, 878#(= |#race~n_update~0| 0), Black: 900#true, 906#(= |#race~n2~0| 0), 896#(= |#race~n1~0| 0), 963#true, Black: 904#true, Black: 843#(= |#race~state12~0| 0), 683#L58-12true, Black: 908#true, 719#L135-1true, 902#(= |#race~consume~0| 0), 917#(= |#race~update~0| 0), 961#(= |#race~produce~0| 0), Black: 945#(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: 915#true, Black: 943#(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: 937#(<= ~n_produce~0 0), 866#(= |#race~n_produce~0| 0), 563#L73true]) [2024-11-16 23:47:30,703 INFO L294 olderBase$Statistics]: this new event has 526 ancestors and is cut-off event [2024-11-16 23:47:30,703 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-16 23:47:30,703 INFO L297 olderBase$Statistics]: existing Event has 478 ancestors and is cut-off event [2024-11-16 23:47:30,703 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2024-11-16 23:47:30,954 INFO L124 PetriNetUnfolderBase]: 681/8576 cut-off events. [2024-11-16 23:47:30,954 INFO L125 PetriNetUnfolderBase]: For 1509/1935 co-relation queries the response was YES. [2024-11-16 23:47:31,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10787 conditions, 8576 events. 681/8576 cut-off events. For 1509/1935 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 71228 event pairs, 116 based on Foata normal form. 53/7711 useless extension candidates. Maximal degree in co-relation 10661. Up to 464 conditions per place. [2024-11-16 23:47:31,079 INFO L140 encePairwiseOnDemand]: 852/858 looper letters, 79 selfloop transitions, 5 changer transitions 0/729 dead transitions. [2024-11-16 23:47:31,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 729 transitions, 1908 flow [2024-11-16 23:47:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:31,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4466 transitions. [2024-11-16 23:47:31,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8675213675213675 [2024-11-16 23:47:31,083 INFO L175 Difference]: Start difference. First operand has 693 places, 694 transitions, 1526 flow. Second operand 6 states and 4466 transitions. [2024-11-16 23:47:31,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 729 transitions, 1908 flow [2024-11-16 23:47:31,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 729 transitions, 1908 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:47:31,093 INFO L231 Difference]: Finished difference. Result has 697 places, 693 transitions, 1534 flow [2024-11-16 23:47:31,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1524, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1534, PETRI_PLACES=697, PETRI_TRANSITIONS=693} [2024-11-16 23:47:31,095 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -107 predicate places. [2024-11-16 23:47:31,095 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 693 transitions, 1534 flow [2024-11-16 23:47:31,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 736.5) internal successors, (4419), 6 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:31,096 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:31,096 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] [2024-11-16 23:47:31,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-16 23:47:31,096 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err26ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:31,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash 340182597, now seen corresponding path program 1 times [2024-11-16 23:47:31,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:31,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350250030] [2024-11-16 23:47:31,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:31,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:31,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:31,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:31,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350250030] [2024-11-16 23:47:31,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350250030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:31,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:31,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:31,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446176799] [2024-11-16 23:47:31,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:31,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:31,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:31,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:31,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:32,185 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 722 out of 858 [2024-11-16 23:47:32,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 693 transitions, 1534 flow. Second operand has 6 states, 6 states have (on average 724.0) internal successors, (4344), 6 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:32,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:32,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 722 of 858 [2024-11-16 23:47:32,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:35,874 INFO L124 PetriNetUnfolderBase]: 3558/18507 cut-off events. [2024-11-16 23:47:35,874 INFO L125 PetriNetUnfolderBase]: For 7285/7311 co-relation queries the response was YES. [2024-11-16 23:47:36,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29077 conditions, 18507 events. 3558/18507 cut-off events. For 7285/7311 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 188286 event pairs, 147 based on Foata normal form. 0/17065 useless extension candidates. Maximal degree in co-relation 28950. Up to 3586 conditions per place. [2024-11-16 23:47:36,075 INFO L140 encePairwiseOnDemand]: 850/858 looper letters, 101 selfloop transitions, 5 changer transitions 0/738 dead transitions. [2024-11-16 23:47:36,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 699 places, 738 transitions, 1992 flow [2024-11-16 23:47:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:36,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4414 transitions. [2024-11-16 23:47:36,078 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8574203574203574 [2024-11-16 23:47:36,078 INFO L175 Difference]: Start difference. First operand has 697 places, 693 transitions, 1534 flow. Second operand 6 states and 4414 transitions. [2024-11-16 23:47:36,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 699 places, 738 transitions, 1992 flow [2024-11-16 23:47:36,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 738 transitions, 1982 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:47:36,090 INFO L231 Difference]: Finished difference. Result has 694 places, 690 transitions, 1528 flow [2024-11-16 23:47:36,091 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=689, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=690, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=685, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1528, PETRI_PLACES=694, PETRI_TRANSITIONS=690} [2024-11-16 23:47:36,091 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -110 predicate places. [2024-11-16 23:47:36,091 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 690 transitions, 1528 flow [2024-11-16 23:47:36,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 724.0) internal successors, (4344), 6 states have internal predecessors, (4344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:36,092 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:36,093 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:36,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-16 23:47:36,093 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:36,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:36,093 INFO L85 PathProgramCache]: Analyzing trace with hash 418147565, now seen corresponding path program 1 times [2024-11-16 23:47:36,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:36,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696092586] [2024-11-16 23:47:36,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:36,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:36,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 23:47:36,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:36,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696092586] [2024-11-16 23:47:36,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696092586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:36,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:36,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:36,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427866417] [2024-11-16 23:47:36,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:36,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:36,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:36,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:36,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:36,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 754 out of 858 [2024-11-16 23:47:36,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 690 transitions, 1528 flow. Second operand has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:36,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:36,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 754 of 858 [2024-11-16 23:47:36,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:37,840 INFO L124 PetriNetUnfolderBase]: 817/8699 cut-off events. [2024-11-16 23:47:37,840 INFO L125 PetriNetUnfolderBase]: For 1819/2194 co-relation queries the response was YES. [2024-11-16 23:47:37,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11515 conditions, 8699 events. 817/8699 cut-off events. For 1819/2194 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 72535 event pairs, 270 based on Foata normal form. 14/7872 useless extension candidates. Maximal degree in co-relation 11389. Up to 789 conditions per place. [2024-11-16 23:47:37,937 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 35 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2024-11-16 23:47:37,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 698 transitions, 1654 flow [2024-11-16 23:47:37,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:37,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2024-11-16 23:47:37,940 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8892773892773893 [2024-11-16 23:47:37,940 INFO L175 Difference]: Start difference. First operand has 694 places, 690 transitions, 1528 flow. Second operand 3 states and 2289 transitions. [2024-11-16 23:47:37,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 698 transitions, 1654 flow [2024-11-16 23:47:37,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 690 places, 698 transitions, 1644 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:47:37,950 INFO L231 Difference]: Finished difference. Result has 690 places, 689 transitions, 1520 flow [2024-11-16 23:47:37,951 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1516, PETRI_DIFFERENCE_MINUEND_PLACES=688, 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=1520, PETRI_PLACES=690, PETRI_TRANSITIONS=689} [2024-11-16 23:47:37,951 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -114 predicate places. [2024-11-16 23:47:37,951 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 689 transitions, 1520 flow [2024-11-16 23:47:37,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.3333333333334) internal successors, (2272), 3 states have internal predecessors, (2272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:37,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:37,952 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] [2024-11-16 23:47:37,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-16 23:47:37,952 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:37,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:37,953 INFO L85 PathProgramCache]: Analyzing trace with hash -949474499, now seen corresponding path program 1 times [2024-11-16 23:47:37,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:37,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762122612] [2024-11-16 23:47:37,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:37,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:37,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:38,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:38,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:38,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762122612] [2024-11-16 23:47:38,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762122612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:38,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:38,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:38,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049244868] [2024-11-16 23:47:38,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:38,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:38,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:38,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:38,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:38,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 858 [2024-11-16 23:47:38,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 689 transitions, 1520 flow. Second operand has 6 states, 6 states have (on average 736.0) internal successors, (4416), 6 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:38,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:38,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 858 [2024-11-16 23:47:38,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:41,274 INFO L124 PetriNetUnfolderBase]: 1570/10984 cut-off events. [2024-11-16 23:47:41,274 INFO L125 PetriNetUnfolderBase]: For 3240/3480 co-relation queries the response was YES. [2024-11-16 23:47:41,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15666 conditions, 10984 events. 1570/10984 cut-off events. For 3240/3480 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 97453 event pairs, 192 based on Foata normal form. 1/10064 useless extension candidates. Maximal degree in co-relation 15539. Up to 682 conditions per place. [2024-11-16 23:47:41,393 INFO L140 encePairwiseOnDemand]: 852/858 looper letters, 87 selfloop transitions, 5 changer transitions 0/732 dead transitions. [2024-11-16 23:47:41,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 732 transitions, 1914 flow [2024-11-16 23:47:41,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:41,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4474 transitions. [2024-11-16 23:47:41,397 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8690753690753691 [2024-11-16 23:47:41,397 INFO L175 Difference]: Start difference. First operand has 690 places, 689 transitions, 1520 flow. Second operand 6 states and 4474 transitions. [2024-11-16 23:47:41,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 732 transitions, 1914 flow [2024-11-16 23:47:41,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 732 transitions, 1910 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:47:41,409 INFO L231 Difference]: Finished difference. Result has 692 places, 688 transitions, 1524 flow [2024-11-16 23:47:41,410 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1514, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=688, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=683, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1524, PETRI_PLACES=692, PETRI_TRANSITIONS=688} [2024-11-16 23:47:41,410 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -112 predicate places. [2024-11-16 23:47:41,411 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 688 transitions, 1524 flow [2024-11-16 23:47:41,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 736.0) internal successors, (4416), 6 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:41,411 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:41,412 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-11-16 23:47:41,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-16 23:47:41,412 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1955567803, now seen corresponding path program 1 times [2024-11-16 23:47:41,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:41,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80017779] [2024-11-16 23:47:41,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:41,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:42,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:42,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80017779] [2024-11-16 23:47:42,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80017779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:42,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:42,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:42,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199495686] [2024-11-16 23:47:42,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:42,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:42,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:42,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:42,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:42,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 735 out of 858 [2024-11-16 23:47:42,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 688 transitions, 1524 flow. Second operand has 6 states, 6 states have (on average 736.6666666666666) internal successors, (4420), 6 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:42,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:42,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 735 of 858 [2024-11-16 23:47:42,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:45,438 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2398] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_259 4)) (.cse14 (* v_~front1~0_355 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse2 (select |v_#race_837| v_~produce~0.base_71)) (.cse7 (not |v_thread1_#t~short2#1_227|)) (.cse1 (+ v_~front1~0_355 v_~size1~0_259)) (.cse0 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~produce~0.offset_71 .cse15)) (.cse6 (+ v_~produce~0.offset_71 .cse15 1)) (.cse8 (+ 2 v_~produce~0.offset_71 .cse15)) (.cse3 (+ v_~produce~0.offset_71 3 .cse15)) (.cse4 (+ .cse13 .cse14 v_~queue1~0.offset_209))) (and (or (and .cse0 (< .cse1 0)) (and (<= 0 .cse1) |v_thread1_#t~short1#1_213|)) (= (select .cse2 .cse3) 0) (= |v_#race~front1~0_530| 0) (not (= (ite (= (select (select |v_#memory_int_197| v_~queue1~0.base_209) .cse4) (select (select |v_#memory_int_197| v_~produce~0.base_71) .cse5)) 1 0) 0)) (= (select .cse2 .cse5) 0) (= (select .cse2 .cse6) 0) (= (+ v_~size1~0_259 1) v_~size1~0_258) (or (and .cse7 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (= (select .cse2 .cse8) 0) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse9 (= |v_#race~state11~0_173| 0))) (or (and .cse7 .cse9 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse9 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (= |v_#race~queue1~0_322| 0) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (let ((.cse10 (= |v_#race~size1~0_355| 0)) (.cse11 (= |v_#race~front1~0_562| 0))) (or (and |v_thread1_#t~short1#1_213| .cse10 .cse11 (= |v_#race~n_queue~0_227| 0) (or (and (<= v_~n_queue~0_94 .cse1) (not |v_thread1_#t~short1#1_214|)) (and (< .cse1 v_~n_queue~0_94) |v_thread1_#t~short1#1_214|))) (and (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) (= |v_#race~n_queue~0_228| |v_#race~n_queue~0_227|) .cse10 .cse11 .cse0))) (= |v_#race_837| (let ((.cse12 (store |v_#race_838| v_~queue1~0.base_209 (store (store (store (store (select |v_#race_838| v_~queue1~0.base_209) .cse4 0) (+ .cse13 .cse14 v_~queue1~0.offset_209 1) 0) (+ .cse13 2 .cse14 v_~queue1~0.offset_209) 0) (+ .cse13 3 .cse14 v_~queue1~0.offset_209) 0)))) (store .cse12 v_~produce~0.base_71 (store (store (store (store (select .cse12 v_~produce~0.base_71) .cse5 0) .cse6 0) .cse8 0) .cse3 0)))) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_838|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_259, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_209, #race~n_queue~0=|v_#race~n_queue~0_228|, ~n_queue~0=v_~n_queue~0_94, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, ~front1~0=v_~front1~0_355} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_341|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_209, #race~front1~0=|v_#race~front1~0_530|, #race~n_queue~0=|v_#race~n_queue~0_227|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_355, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_837|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_258, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, #race~queue1~0=|v_#race~queue1~0_322|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~front1~0_562|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_#race~size1~0_355|, |v_thread1_#t~short2#1_228|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][544], [884#(= |#race~n_queue~0| 0), Black: 959#true, 553#L95-29true, Black: 928#true, 984#true, 612#L83true, 878#(= |#race~n_update~0| 0), Black: 900#true, 906#(= |#race~n2~0| 0), 896#(= |#race~n1~0| 0), Black: 904#true, Black: 843#(= |#race~state12~0| 0), 683#L58-12true, Black: 908#true, 719#L135-1true, 917#(= |#race~update~0| 0), 902#(= |#race~consume~0| 0), 978#true, 961#(= |#race~produce~0| 0), Black: 945#(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: 915#true, Black: 943#(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: 937#(<= ~n_produce~0 0), 866#(= |#race~n_produce~0| 0)]) [2024-11-16 23:47:45,438 INFO L294 olderBase$Statistics]: this new event has 525 ancestors and is cut-off event [2024-11-16 23:47:45,438 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-11-16 23:47:45,438 INFO L297 olderBase$Statistics]: existing Event has 477 ancestors and is cut-off event [2024-11-16 23:47:45,438 INFO L297 olderBase$Statistics]: existing Event has 525 ancestors and is cut-off event [2024-11-16 23:47:45,450 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2398] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_259 4)) (.cse14 (* v_~front1~0_355 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse2 (select |v_#race_837| v_~produce~0.base_71)) (.cse7 (not |v_thread1_#t~short2#1_227|)) (.cse1 (+ v_~front1~0_355 v_~size1~0_259)) (.cse0 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~produce~0.offset_71 .cse15)) (.cse6 (+ v_~produce~0.offset_71 .cse15 1)) (.cse8 (+ 2 v_~produce~0.offset_71 .cse15)) (.cse3 (+ v_~produce~0.offset_71 3 .cse15)) (.cse4 (+ .cse13 .cse14 v_~queue1~0.offset_209))) (and (or (and .cse0 (< .cse1 0)) (and (<= 0 .cse1) |v_thread1_#t~short1#1_213|)) (= (select .cse2 .cse3) 0) (= |v_#race~front1~0_530| 0) (not (= (ite (= (select (select |v_#memory_int_197| v_~queue1~0.base_209) .cse4) (select (select |v_#memory_int_197| v_~produce~0.base_71) .cse5)) 1 0) 0)) (= (select .cse2 .cse5) 0) (= (select .cse2 .cse6) 0) (= (+ v_~size1~0_259 1) v_~size1~0_258) (or (and .cse7 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (= (select .cse2 .cse8) 0) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse9 (= |v_#race~state11~0_173| 0))) (or (and .cse7 .cse9 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse9 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (= |v_#race~queue1~0_322| 0) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (let ((.cse10 (= |v_#race~size1~0_355| 0)) (.cse11 (= |v_#race~front1~0_562| 0))) (or (and |v_thread1_#t~short1#1_213| .cse10 .cse11 (= |v_#race~n_queue~0_227| 0) (or (and (<= v_~n_queue~0_94 .cse1) (not |v_thread1_#t~short1#1_214|)) (and (< .cse1 v_~n_queue~0_94) |v_thread1_#t~short1#1_214|))) (and (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) (= |v_#race~n_queue~0_228| |v_#race~n_queue~0_227|) .cse10 .cse11 .cse0))) (= |v_#race_837| (let ((.cse12 (store |v_#race_838| v_~queue1~0.base_209 (store (store (store (store (select |v_#race_838| v_~queue1~0.base_209) .cse4 0) (+ .cse13 .cse14 v_~queue1~0.offset_209 1) 0) (+ .cse13 2 .cse14 v_~queue1~0.offset_209) 0) (+ .cse13 3 .cse14 v_~queue1~0.offset_209) 0)))) (store .cse12 v_~produce~0.base_71 (store (store (store (store (select .cse12 v_~produce~0.base_71) .cse5 0) .cse6 0) .cse8 0) .cse3 0)))) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_838|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_259, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_209, #race~n_queue~0=|v_#race~n_queue~0_228|, ~n_queue~0=v_~n_queue~0_94, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, ~front1~0=v_~front1~0_355} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_341|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_209, #race~front1~0=|v_#race~front1~0_530|, #race~n_queue~0=|v_#race~n_queue~0_227|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_355, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_837|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_258, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, #race~queue1~0=|v_#race~queue1~0_322|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~front1~0_562|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_#race~size1~0_355|, |v_thread1_#t~short2#1_228|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][544], [884#(= |#race~n_queue~0| 0), Black: 959#true, 553#L95-29true, Black: 928#true, 984#true, 878#(= |#race~n_update~0| 0), Black: 900#true, 906#(= |#race~n2~0| 0), 896#(= |#race~n1~0| 0), Black: 904#true, Black: 843#(= |#race~state12~0| 0), 683#L58-12true, Black: 908#true, 719#L135-1true, 902#(= |#race~consume~0| 0), 917#(= |#race~update~0| 0), 978#true, 961#(= |#race~produce~0| 0), Black: 945#(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: 915#true, Black: 943#(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: 937#(<= ~n_produce~0 0), 866#(= |#race~n_produce~0| 0), 563#L73true]) [2024-11-16 23:47:45,450 INFO L294 olderBase$Statistics]: this new event has 526 ancestors and is cut-off event [2024-11-16 23:47:45,450 INFO L297 olderBase$Statistics]: existing Event has 395 ancestors and is cut-off event [2024-11-16 23:47:45,450 INFO L297 olderBase$Statistics]: existing Event has 478 ancestors and is cut-off event [2024-11-16 23:47:45,450 INFO L297 olderBase$Statistics]: existing Event has 526 ancestors and is cut-off event [2024-11-16 23:47:45,534 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2398] L52-->L58-12: Formula: (let ((.cse13 (* v_~size1~0_259 4)) (.cse14 (* v_~front1~0_355 4)) (.cse15 (* v_~state11~0_117 4))) (let ((.cse2 (select |v_#race_837| v_~produce~0.base_71)) (.cse7 (not |v_thread1_#t~short2#1_227|)) (.cse1 (+ v_~front1~0_355 v_~size1~0_259)) (.cse0 (not |v_thread1_#t~short1#1_213|)) (.cse5 (+ v_~produce~0.offset_71 .cse15)) (.cse6 (+ v_~produce~0.offset_71 .cse15 1)) (.cse8 (+ 2 v_~produce~0.offset_71 .cse15)) (.cse3 (+ v_~produce~0.offset_71 3 .cse15)) (.cse4 (+ .cse13 .cse14 v_~queue1~0.offset_209))) (and (or (and .cse0 (< .cse1 0)) (and (<= 0 .cse1) |v_thread1_#t~short1#1_213|)) (= (select .cse2 .cse3) 0) (= |v_#race~front1~0_530| 0) (not (= (ite (= (select (select |v_#memory_int_197| v_~queue1~0.base_209) .cse4) (select (select |v_#memory_int_197| v_~produce~0.base_71) .cse5)) 1 0) 0)) (= (select .cse2 .cse5) 0) (= (select .cse2 .cse6) 0) (= (+ v_~size1~0_259 1) v_~size1~0_258) (or (and .cse7 (< v_~state11~0_117 0)) (and (<= 0 v_~state11~0_117) |v_thread1_#t~short2#1_227|)) (= (select .cse2 .cse8) 0) (not (= (ite |v_thread1_#t~short1#1_214| 1 0) 0)) (= |v_#race~state11~0_163| 0) (let ((.cse9 (= |v_#race~state11~0_173| 0))) (or (and .cse7 .cse9 (= |v_#race~n_produce~0_94| |v_#race~n_produce~0_93|) (= |v_thread1_#t~short2#1_227| |v_thread1_#t~short2#1_228|)) (and (or (and (<= v_~n_produce~0_36 v_~state11~0_117) (not |v_thread1_#t~short2#1_228|)) (and (< v_~state11~0_117 v_~n_produce~0_36) |v_thread1_#t~short2#1_228|)) .cse9 |v_thread1_#t~short2#1_227| (= |v_#race~n_produce~0_93| 0)))) (= |v_#race~queue1~0_322| 0) (not (= (ite |v_thread1_#t~short2#1_228| 1 0) 0)) (let ((.cse10 (= |v_#race~size1~0_355| 0)) (.cse11 (= |v_#race~front1~0_562| 0))) (or (and |v_thread1_#t~short1#1_213| .cse10 .cse11 (= |v_#race~n_queue~0_227| 0) (or (and (<= v_~n_queue~0_94 .cse1) (not |v_thread1_#t~short1#1_214|)) (and (< .cse1 v_~n_queue~0_94) |v_thread1_#t~short1#1_214|))) (and (= |v_thread1_#t~short1#1_213| |v_thread1_#t~short1#1_214|) (= |v_#race~n_queue~0_228| |v_#race~n_queue~0_227|) .cse10 .cse11 .cse0))) (= |v_#race_837| (let ((.cse12 (store |v_#race_838| v_~queue1~0.base_209 (store (store (store (store (select |v_#race_838| v_~queue1~0.base_209) .cse4 0) (+ .cse13 .cse14 v_~queue1~0.offset_209 1) 0) (+ .cse13 2 .cse14 v_~queue1~0.offset_209) 0) (+ .cse13 3 .cse14 v_~queue1~0.offset_209) 0)))) (store .cse12 v_~produce~0.base_71 (store (store (store (store (select .cse12 v_~produce~0.base_71) .cse5 0) .cse6 0) .cse8 0) .cse3 0)))) (= |v_#race~produce~0_60| 0)))) InVars {#race=|v_#race_838|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_259, ~produce~0.base=v_~produce~0.base_71, ~queue1~0.base=v_~queue1~0.base_209, #race~n_queue~0=|v_#race~n_queue~0_228|, ~n_queue~0=v_~n_queue~0_94, #race~n_produce~0=|v_#race~n_produce~0_94|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, ~front1~0=v_~front1~0_355} OutVars{#race~produce~0=|v_#race~produce~0_60|, #race~state11~0=|v_#race~state11~0_163|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, #race~size1~0=|v_#race~size1~0_341|, ~produce~0.base=v_~produce~0.base_71, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_209, #race~front1~0=|v_#race~front1~0_530|, #race~n_queue~0=|v_#race~n_queue~0_227|, ~n_queue~0=v_~n_queue~0_94, ~front1~0=v_~front1~0_355, thread1Thread1of1ForFork1_#t~mem3#1=|v_thread1Thread1of1ForFork1_#t~mem3#1_13|, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1_25|, #race=|v_#race_837|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_117, ~size1~0=v_~size1~0_258, thread1Thread1of1ForFork1_#t~post5#1=|v_thread1Thread1of1ForFork1_#t~post5#1_3|, thread1Thread1of1ForFork1_#t~nondet6#1=|v_thread1Thread1of1ForFork1_#t~nondet6#1_3|, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1=|v_thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1_25|, #race~n_produce~0=|v_#race~n_produce~0_93|, #memory_int=|v_#memory_int_197|, ~n_produce~0=v_~n_produce~0_36, ~produce~0.offset=v_~produce~0.offset_71, ~queue1~0.offset=v_~queue1~0.offset_209, #race~queue1~0=|v_#race~queue1~0_322|} AuxVars[|v_thread1_#t~short1#1_213|, |v_thread1_#t~short1#1_214|, |v_#race~front1~0_562|, |v_#race~state11~0_173|, |v_thread1_#t~short2#1_227|, |v_#race~size1~0_355|, |v_thread1_#t~short2#1_228|] AssignedVars[#race, #race~produce~0, #race~state11~0, thread1Thread1of1ForFork1_#t~short2#1, thread1Thread1of1ForFork1_#t~mem4#1, ~size1~0, thread1Thread1of1ForFork1_#t~post5#1, #race~size1~0, thread1Thread1of1ForFork1_#t~nondet6#1, thread1Thread1of1ForFork1_#t~short1#1, #race~front1~0, #race~n_queue~0, thread1Thread1of1ForFork1_assume_abort_if_not_#in~cond#1, #race~n_produce~0, thread1Thread1of1ForFork1_#t~mem3#1, #race~queue1~0, thread1Thread1of1ForFork1_assume_abort_if_not_~cond#1][544], [884#(= |#race~n_queue~0| 0), Black: 959#true, Black: 928#true, 553#L95-29true, 878#(= |#race~n_update~0| 0), 984#true, Black: 900#true, 906#(= |#race~n2~0| 0), 896#(= |#race~n1~0| 0), Black: 904#true, Black: 841#true, 683#L58-12true, Black: 908#true, 719#L135-1true, 917#(= |#race~update~0| 0), 902#(= |#race~consume~0| 0), 978#true, 961#(= |#race~produce~0| 0), Black: 945#(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: 915#true, Black: 943#(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: 937#(<= ~n_produce~0 0), 866#(= |#race~n_produce~0| 0), 563#L73true]) [2024-11-16 23:47:45,534 INFO L294 olderBase$Statistics]: this new event has 535 ancestors and is cut-off event [2024-11-16 23:47:45,534 INFO L297 olderBase$Statistics]: existing Event has 487 ancestors and is cut-off event [2024-11-16 23:47:45,534 INFO L297 olderBase$Statistics]: existing Event has 535 ancestors and is cut-off event [2024-11-16 23:47:45,534 INFO L297 olderBase$Statistics]: existing Event has 437 ancestors and is cut-off event [2024-11-16 23:47:45,668 INFO L124 PetriNetUnfolderBase]: 2318/17497 cut-off events. [2024-11-16 23:47:45,668 INFO L125 PetriNetUnfolderBase]: For 4290/4441 co-relation queries the response was YES. [2024-11-16 23:47:45,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24296 conditions, 17497 events. 2318/17497 cut-off events. For 4290/4441 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 181895 event pairs, 497 based on Foata normal form. 1/15922 useless extension candidates. Maximal degree in co-relation 24172. Up to 1506 conditions per place. [2024-11-16 23:47:45,839 INFO L140 encePairwiseOnDemand]: 852/858 looper letters, 86 selfloop transitions, 5 changer transitions 0/731 dead transitions. [2024-11-16 23:47:45,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 731 transitions, 1916 flow [2024-11-16 23:47:45,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4479 transitions. [2024-11-16 23:47:45,842 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.87004662004662 [2024-11-16 23:47:45,842 INFO L175 Difference]: Start difference. First operand has 692 places, 688 transitions, 1524 flow. Second operand 6 states and 4479 transitions. [2024-11-16 23:47:45,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 731 transitions, 1916 flow [2024-11-16 23:47:45,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 731 transitions, 1906 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:47:45,854 INFO L231 Difference]: Finished difference. Result has 691 places, 687 transitions, 1522 flow [2024-11-16 23:47:45,855 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1512, PETRI_DIFFERENCE_MINUEND_PLACES=686, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=687, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1522, PETRI_PLACES=691, PETRI_TRANSITIONS=687} [2024-11-16 23:47:45,855 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -113 predicate places. [2024-11-16 23:47:45,855 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 687 transitions, 1522 flow [2024-11-16 23:47:45,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 736.6666666666666) internal successors, (4420), 6 states have internal predecessors, (4420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:45,856 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:45,857 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] [2024-11-16 23:47:45,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-16 23:47:45,857 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:45,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 125455559, now seen corresponding path program 1 times [2024-11-16 23:47:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:45,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743444548] [2024-11-16 23:47:45,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:45,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:45,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:45,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743444548] [2024-11-16 23:47:45,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743444548] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:45,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:45,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:45,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098396383] [2024-11-16 23:47:45,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:45,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:45,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:45,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:45,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:45,961 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 858 [2024-11-16 23:47:45,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 687 transitions, 1522 flow. Second operand has 3 states, 3 states have (on average 759.0) internal successors, (2277), 3 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:45,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:45,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 858 [2024-11-16 23:47:45,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:49,195 INFO L124 PetriNetUnfolderBase]: 2113/18002 cut-off events. [2024-11-16 23:47:49,195 INFO L125 PetriNetUnfolderBase]: For 3746/3841 co-relation queries the response was YES. [2024-11-16 23:47:49,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24155 conditions, 18002 events. 2113/18002 cut-off events. For 3746/3841 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 189131 event pairs, 699 based on Foata normal form. 3/16498 useless extension candidates. Maximal degree in co-relation 24030. Up to 1921 conditions per place. [2024-11-16 23:47:49,353 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 34 selfloop transitions, 2 changer transitions 0/697 dead transitions. [2024-11-16 23:47:49,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 692 places, 697 transitions, 1645 flow [2024-11-16 23:47:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:49,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:49,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2294 transitions. [2024-11-16 23:47:49,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8912198912198912 [2024-11-16 23:47:49,355 INFO L175 Difference]: Start difference. First operand has 691 places, 687 transitions, 1522 flow. Second operand 3 states and 2294 transitions. [2024-11-16 23:47:49,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 692 places, 697 transitions, 1645 flow [2024-11-16 23:47:49,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 697 transitions, 1635 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:47:49,366 INFO L231 Difference]: Finished difference. Result has 687 places, 686 transitions, 1514 flow [2024-11-16 23:47:49,367 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=685, 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=1514, PETRI_PLACES=687, PETRI_TRANSITIONS=686} [2024-11-16 23:47:49,367 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -117 predicate places. [2024-11-16 23:47:49,367 INFO L471 AbstractCegarLoop]: Abstraction has has 687 places, 686 transitions, 1514 flow [2024-11-16 23:47:49,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 759.0) internal successors, (2277), 3 states have internal predecessors, (2277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:49,368 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:49,368 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, 1, 1, 1, 1] [2024-11-16 23:47:49,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-16 23:47:49,368 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:49,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:49,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1160097921, now seen corresponding path program 1 times [2024-11-16 23:47:49,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:49,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941174266] [2024-11-16 23:47:49,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:49,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:50,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:50,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941174266] [2024-11-16 23:47:50,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941174266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:50,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:50,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 23:47:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129968823] [2024-11-16 23:47:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:50,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 23:47:50,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 23:47:50,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-16 23:47:50,552 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 734 out of 858 [2024-11-16 23:47:50,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 686 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 736.0) internal successors, (4416), 6 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:50,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:50,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 734 of 858 [2024-11-16 23:47:50,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:52,573 INFO L124 PetriNetUnfolderBase]: 1115/9028 cut-off events. [2024-11-16 23:47:52,574 INFO L125 PetriNetUnfolderBase]: For 2291/2511 co-relation queries the response was YES. [2024-11-16 23:47:52,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12457 conditions, 9028 events. 1115/9028 cut-off events. For 2291/2511 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 75505 event pairs, 147 based on Foata normal form. 1/8326 useless extension candidates. Maximal degree in co-relation 12330. Up to 562 conditions per place. [2024-11-16 23:47:52,688 INFO L140 encePairwiseOnDemand]: 852/858 looper letters, 87 selfloop transitions, 5 changer transitions 0/729 dead transitions. [2024-11-16 23:47:52,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 729 transitions, 1908 flow [2024-11-16 23:47:52,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 23:47:52,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-16 23:47:52,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4474 transitions. [2024-11-16 23:47:52,692 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8690753690753691 [2024-11-16 23:47:52,692 INFO L175 Difference]: Start difference. First operand has 687 places, 686 transitions, 1514 flow. Second operand 6 states and 4474 transitions. [2024-11-16 23:47:52,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 729 transitions, 1908 flow [2024-11-16 23:47:52,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 729 transitions, 1904 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:47:52,704 INFO L231 Difference]: Finished difference. Result has 689 places, 685 transitions, 1518 flow [2024-11-16 23:47:52,705 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1518, PETRI_PLACES=689, PETRI_TRANSITIONS=685} [2024-11-16 23:47:52,705 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -115 predicate places. [2024-11-16 23:47:52,706 INFO L471 AbstractCegarLoop]: Abstraction has has 689 places, 685 transitions, 1518 flow [2024-11-16 23:47:52,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 736.0) internal successors, (4416), 6 states have internal predecessors, (4416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:52,706 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:52,707 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:52,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-16 23:47:52,707 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:52,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:52,708 INFO L85 PathProgramCache]: Analyzing trace with hash 586560257, now seen corresponding path program 1 times [2024-11-16 23:47:52,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:52,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966328495] [2024-11-16 23:47:52,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:52,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:52,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:52,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966328495] [2024-11-16 23:47:52,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966328495] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:52,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:52,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545171229] [2024-11-16 23:47:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:52,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:52,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:52,843 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 749 out of 858 [2024-11-16 23:47:52,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 689 places, 685 transitions, 1518 flow. Second operand has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:52,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:52,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 749 of 858 [2024-11-16 23:47:52,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:55,924 INFO L124 PetriNetUnfolderBase]: 2817/17784 cut-off events. [2024-11-16 23:47:55,925 INFO L125 PetriNetUnfolderBase]: For 5502/5570 co-relation queries the response was YES. [2024-11-16 23:47:56,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26029 conditions, 17784 events. 2817/17784 cut-off events. For 5502/5570 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 183915 event pairs, 1205 based on Foata normal form. 0/16307 useless extension candidates. Maximal degree in co-relation 25904. Up to 3365 conditions per place. [2024-11-16 23:47:56,111 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 43 selfloop transitions, 2 changer transitions 0/695 dead transitions. [2024-11-16 23:47:56,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 695 transitions, 1659 flow [2024-11-16 23:47:56,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:56,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:56,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2281 transitions. [2024-11-16 23:47:56,114 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8861693861693861 [2024-11-16 23:47:56,114 INFO L175 Difference]: Start difference. First operand has 689 places, 685 transitions, 1518 flow. Second operand 3 states and 2281 transitions. [2024-11-16 23:47:56,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 695 transitions, 1659 flow [2024-11-16 23:47:56,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 695 transitions, 1649 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-16 23:47:56,127 INFO L231 Difference]: Finished difference. Result has 685 places, 684 transitions, 1510 flow [2024-11-16 23:47:56,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=682, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1510, PETRI_PLACES=685, PETRI_TRANSITIONS=684} [2024-11-16 23:47:56,128 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -119 predicate places. [2024-11-16 23:47:56,128 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 684 transitions, 1510 flow [2024-11-16 23:47:56,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 753.0) internal successors, (2259), 3 states have internal predecessors, (2259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:56,129 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:56,129 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:56,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-16 23:47:56,130 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:56,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:56,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1615060468, now seen corresponding path program 1 times [2024-11-16 23:47:56,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:56,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835840707] [2024-11-16 23:47:56,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:56,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:56,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835840707] [2024-11-16 23:47:56,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835840707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:56,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:56,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:56,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294276220] [2024-11-16 23:47:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:56,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:56,233 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 762 out of 858 [2024-11-16 23:47:56,234 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 684 transitions, 1510 flow. Second operand has 3 states, 3 states have (on average 764.0) internal successors, (2292), 3 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:56,234 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:56,235 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 762 of 858 [2024-11-16 23:47:56,235 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:47:59,172 INFO L124 PetriNetUnfolderBase]: 985/15226 cut-off events. [2024-11-16 23:47:59,173 INFO L125 PetriNetUnfolderBase]: For 1550/1698 co-relation queries the response was YES. [2024-11-16 23:47:59,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17889 conditions, 15226 events. 985/15226 cut-off events. For 1550/1698 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 152621 event pairs, 81 based on Foata normal form. 5/14101 useless extension candidates. Maximal degree in co-relation 17765. Up to 634 conditions per place. [2024-11-16 23:47:59,279 INFO L140 encePairwiseOnDemand]: 855/858 looper letters, 33 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2024-11-16 23:47:59,280 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 686 places, 698 transitions, 1654 flow [2024-11-16 23:47:59,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:47:59,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:47:59,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2310 transitions. [2024-11-16 23:47:59,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8974358974358975 [2024-11-16 23:47:59,281 INFO L175 Difference]: Start difference. First operand has 685 places, 684 transitions, 1510 flow. Second operand 3 states and 2310 transitions. [2024-11-16 23:47:59,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 686 places, 698 transitions, 1654 flow [2024-11-16 23:47:59,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 698 transitions, 1650 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:47:59,289 INFO L231 Difference]: Finished difference. Result has 685 places, 685 transitions, 1520 flow [2024-11-16 23:47:59,290 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=858, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1520, PETRI_PLACES=685, PETRI_TRANSITIONS=685} [2024-11-16 23:47:59,291 INFO L277 CegarLoopForPetriNet]: 804 programPoint places, -119 predicate places. [2024-11-16 23:47:59,291 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 685 transitions, 1520 flow [2024-11-16 23:47:59,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 764.0) internal successors, (2292), 3 states have internal predecessors, (2292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:59,291 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:47:59,291 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:47:59,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-16 23:47:59,292 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err31ASSERT_VIOLATIONDATA_RACE, thread1Err30ASSERT_VIOLATIONDATA_RACE, thread1Err29ASSERT_VIOLATIONDATA_RACE, thread1Err28ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-16 23:47:59,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:47:59,292 INFO L85 PathProgramCache]: Analyzing trace with hash -2018578157, now seen corresponding path program 1 times [2024-11-16 23:47:59,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:47:59,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887271339] [2024-11-16 23:47:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:47:59,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:47:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:47:59,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 23:47:59,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:47:59,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887271339] [2024-11-16 23:47:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887271339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:47:59,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:47:59,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:47:59,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648824645] [2024-11-16 23:47:59,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:47:59,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:47:59,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:47:59,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:47:59,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:47:59,621 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 737 out of 858 [2024-11-16 23:47:59,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 685 transitions, 1520 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:47:59,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:47:59,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 737 of 858 [2024-11-16 23:47:59,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand