./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../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.dk.eval-assert-order-craig-803cd42-m [2024-11-22 17:59:13,699 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 17:59:13,773 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-22 17:59:13,778 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 17:59:13,778 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 17:59:13,810 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 17:59:13,810 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 17:59:13,811 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 17:59:13,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 17:59:13,813 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 17:59:13,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 17:59:13,814 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 17:59:13,814 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 17:59:13,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 17:59:13,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 17:59:13,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 17:59:13,816 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 17:59:13,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 17:59:13,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 17:59:13,817 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 17:59:13,817 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 17:59:13,817 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 17:59:13,817 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-22 17:59:13,818 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 17:59:13,818 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 17:59:13,818 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 17:59:13,818 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 17:59:13,820 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 17:59:13,820 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 17:59:13,820 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 17:59:13,820 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 17:59:13,821 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 17:59:13,821 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 17:59:13,822 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 17:59:13,822 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 17:59:13,822 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 17:59:13,822 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 17:59:13,823 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 17:59:13,823 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 17:59:13,823 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 17:59:13,823 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 17:59:13,824 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-22 17:59:14,165 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 17:59:14,201 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 17:59:14,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 17:59:14,206 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 17:59:14,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 17:59:14,208 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-22 17:59:15,698 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 17:59:15,919 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 17:59:15,919 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-11-22 17:59:15,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a9549d4/f90a7b8247f748f8976508d969d44d40/FLAG74a16c93c [2024-11-22 17:59:15,942 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91a9549d4/f90a7b8247f748f8976508d969d44d40 [2024-11-22 17:59:15,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 17:59:15,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 17:59:15,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 17:59:15,947 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 17:59:15,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 17:59:15,953 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:59:15" (1/1) ... [2024-11-22 17:59:15,954 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d214a09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:15, skipping insertion in model container [2024-11-22 17:59:15,954 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:59:15" (1/1) ... [2024-11-22 17:59:15,977 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 17:59:16,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 17:59:16,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 17:59:16,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 17:59:16,332 INFO L204 MainTranslator]: Completed translation [2024-11-22 17:59:16,333 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16 WrapperNode [2024-11-22 17:59:16,333 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 17:59:16,335 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 17:59:16,335 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 17:59:16,335 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 17:59:16,343 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,363 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,411 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 838 [2024-11-22 17:59:16,412 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 17:59:16,413 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 17:59:16,413 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 17:59:16,413 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 17:59:16,429 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,434 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,451 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,451 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,501 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,522 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,544 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 17:59:16,545 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 17:59:16,545 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 17:59:16,545 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 17:59:16,546 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (1/1) ... [2024-11-22 17:59:16,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 17:59:16,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 17:59:16,584 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-22 17:59:16,592 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-22 17:59:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 17:59:16,642 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-22 17:59:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 17:59:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 17:59:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-22 17:59:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 17:59:16,643 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 17:59:16,643 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 17:59:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 17:59:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 17:59:16,644 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 17:59:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 17:59:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 17:59:16,644 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 17:59:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 17:59:16,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 17:59:16,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 17:59:16,649 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 17:59:16,833 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 17:59:16,836 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 17:59:18,117 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 17:59:18,117 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 17:59:18,988 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 17:59:18,988 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-22 17:59:18,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:59:18 BoogieIcfgContainer [2024-11-22 17:59:18,989 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 17:59:18,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 17:59:18,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 17:59:18,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 17:59:18,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:59:15" (1/3) ... [2024-11-22 17:59:19,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d0b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:59:19, skipping insertion in model container [2024-11-22 17:59:19,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:59:16" (2/3) ... [2024-11-22 17:59:19,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5d0b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:59:19, skipping insertion in model container [2024-11-22 17:59:19,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:59:18" (3/3) ... [2024-11-22 17:59:19,003 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-11-22 17:59:19,022 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 17:59:19,022 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 133 error locations. [2024-11-22 17:59:19,023 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 17:59:19,254 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-22 17:59:19,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 817 places, 852 transitions, 1725 flow [2024-11-22 17:59:19,673 INFO L124 PetriNetUnfolderBase]: 45/849 cut-off events. [2024-11-22 17:59:19,673 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-22 17:59:19,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 862 conditions, 849 events. 45/849 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1598 event pairs, 0 based on Foata normal form. 0/671 useless extension candidates. Maximal degree in co-relation 605. Up to 2 conditions per place. [2024-11-22 17:59:19,690 INFO L82 GeneralOperation]: Start removeDead. Operand has 817 places, 852 transitions, 1725 flow [2024-11-22 17:59:19,708 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 798 places, 832 transitions, 1682 flow [2024-11-22 17:59:19,719 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 17:59:19,729 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;@1dd5914a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 17:59:19,729 INFO L334 AbstractCegarLoop]: Starting to check reachability of 234 error locations. [2024-11-22 17:59:19,733 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 17:59:19,733 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2024-11-22 17:59:19,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 17:59:19,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:19,734 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-22 17:59:19,735 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:19,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:19,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1705745168, now seen corresponding path program 1 times [2024-11-22 17:59:19,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:19,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193733506] [2024-11-22 17:59:19,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:19,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:19,979 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-22 17:59:19,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:19,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193733506] [2024-11-22 17:59:19,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193733506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:19,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:19,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040347653] [2024-11-22 17:59:19,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:19,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:19,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:20,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:20,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:20,046 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-22 17:59:20,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 798 places, 832 transitions, 1682 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-22 17:59:20,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:20,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-22 17:59:20,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:20,506 INFO L124 PetriNetUnfolderBase]: 58/1094 cut-off events. [2024-11-22 17:59:20,506 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-22 17:59:20,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 1094 events. 58/1094 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3553 event pairs, 19 based on Foata normal form. 77/979 useless extension candidates. Maximal degree in co-relation 784. Up to 65 conditions per place. [2024-11-22 17:59:20,524 INFO L140 encePairwiseOnDemand]: 770/852 looper letters, 14 selfloop transitions, 2 changer transitions 12/752 dead transitions. [2024-11-22 17:59:20,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 748 places, 752 transitions, 1554 flow [2024-11-22 17:59:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:20,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:20,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2355 transitions. [2024-11-22 17:59:20,550 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9213615023474179 [2024-11-22 17:59:20,553 INFO L175 Difference]: Start difference. First operand has 798 places, 832 transitions, 1682 flow. Second operand 3 states and 2355 transitions. [2024-11-22 17:59:20,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 748 places, 752 transitions, 1554 flow [2024-11-22 17:59:20,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 742 places, 752 transitions, 1542 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-22 17:59:20,584 INFO L231 Difference]: Finished difference. Result has 742 places, 740 transitions, 1490 flow [2024-11-22 17:59:20,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1510, PETRI_DIFFERENCE_MINUEND_PLACES=740, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=752, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=750, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1490, PETRI_PLACES=742, PETRI_TRANSITIONS=740} [2024-11-22 17:59:20,595 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -56 predicate places. [2024-11-22 17:59:20,595 INFO L471 AbstractCegarLoop]: Abstraction has has 742 places, 740 transitions, 1490 flow [2024-11-22 17:59:20,597 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-22 17:59:20,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:20,598 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-22 17:59:20,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 17:59:20,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:20,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:20,600 INFO L85 PathProgramCache]: Analyzing trace with hash 740870238, now seen corresponding path program 1 times [2024-11-22 17:59:20,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:20,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609003084] [2024-11-22 17:59:20,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:20,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:20,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:20,678 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-22 17:59:20,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:20,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609003084] [2024-11-22 17:59:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609003084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707456504] [2024-11-22 17:59:20,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:20,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:20,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:20,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:20,746 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 852 [2024-11-22 17:59:20,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 742 places, 740 transitions, 1490 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 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-22 17:59:20,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:20,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 852 [2024-11-22 17:59:20,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:21,128 INFO L124 PetriNetUnfolderBase]: 118/1177 cut-off events. [2024-11-22 17:59:21,129 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-22 17:59:21,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1387 conditions, 1177 events. 118/1177 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4323 event pairs, 67 based on Foata normal form. 0/985 useless extension candidates. Maximal degree in co-relation 1344. Up to 168 conditions per place. [2024-11-22 17:59:21,142 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 21 selfloop transitions, 2 changer transitions 0/739 dead transitions. [2024-11-22 17:59:21,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 731 places, 739 transitions, 1534 flow [2024-11-22 17:59:21,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:21,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:21,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2262 transitions. [2024-11-22 17:59:21,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8849765258215962 [2024-11-22 17:59:21,148 INFO L175 Difference]: Start difference. First operand has 742 places, 740 transitions, 1490 flow. Second operand 3 states and 2262 transitions. [2024-11-22 17:59:21,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 731 places, 739 transitions, 1534 flow [2024-11-22 17:59:21,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 729 places, 739 transitions, 1530 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:21,159 INFO L231 Difference]: Finished difference. Result has 729 places, 739 transitions, 1488 flow [2024-11-22 17:59:21,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1484, PETRI_DIFFERENCE_MINUEND_PLACES=727, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=739, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=737, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1488, PETRI_PLACES=729, PETRI_TRANSITIONS=739} [2024-11-22 17:59:21,161 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -69 predicate places. [2024-11-22 17:59:21,161 INFO L471 AbstractCegarLoop]: Abstraction has has 729 places, 739 transitions, 1488 flow [2024-11-22 17:59:21,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 0 states have call successors, (0), 0 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-22 17:59:21,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:21,163 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-22 17:59:21,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 17:59:21,164 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:21,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:21,165 INFO L85 PathProgramCache]: Analyzing trace with hash -457459096, now seen corresponding path program 1 times [2024-11-22 17:59:21,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648821704] [2024-11-22 17:59:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:21,226 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-22 17:59:21,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:21,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648821704] [2024-11-22 17:59:21,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648821704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:21,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:21,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:21,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870714736] [2024-11-22 17:59:21,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:21,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:21,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:21,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:21,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:21,274 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 852 [2024-11-22 17:59:21,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 729 places, 739 transitions, 1488 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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-22 17:59:21,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:21,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 852 [2024-11-22 17:59:21,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:21,649 INFO L124 PetriNetUnfolderBase]: 172/1301 cut-off events. [2024-11-22 17:59:21,650 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-11-22 17:59:21,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1615 conditions, 1301 events. 172/1301 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 5345 event pairs, 99 based on Foata normal form. 0/1127 useless extension candidates. Maximal degree in co-relation 1564. Up to 235 conditions per place. [2024-11-22 17:59:21,683 INFO L140 encePairwiseOnDemand]: 843/852 looper letters, 27 selfloop transitions, 3 changer transitions 0/738 dead transitions. [2024-11-22 17:59:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 725 places, 738 transitions, 1548 flow [2024-11-22 17:59:21,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2256 transitions. [2024-11-22 17:59:21,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8826291079812206 [2024-11-22 17:59:21,691 INFO L175 Difference]: Start difference. First operand has 729 places, 739 transitions, 1488 flow. Second operand 3 states and 2256 transitions. [2024-11-22 17:59:21,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 725 places, 738 transitions, 1548 flow [2024-11-22 17:59:21,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 723 places, 738 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:21,709 INFO L231 Difference]: Finished difference. Result has 723 places, 733 transitions, 1478 flow [2024-11-22 17:59:21,710 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=721, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=723, PETRI_TRANSITIONS=733} [2024-11-22 17:59:21,712 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -75 predicate places. [2024-11-22 17:59:21,712 INFO L471 AbstractCegarLoop]: Abstraction has has 723 places, 733 transitions, 1478 flow [2024-11-22 17:59:21,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 0 states have call successors, (0), 0 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-22 17:59:21,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:21,714 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-22 17:59:21,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 17:59:21,715 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:21,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:21,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1450475615, now seen corresponding path program 1 times [2024-11-22 17:59:21,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:21,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746449301] [2024-11-22 17:59:21,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:21,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:21,800 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-22 17:59:21,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:21,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746449301] [2024-11-22 17:59:21,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746449301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:21,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:21,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:21,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818772214] [2024-11-22 17:59:21,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:21,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:21,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:21,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:21,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:21,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 852 [2024-11-22 17:59:21,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 723 places, 733 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 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-22 17:59:21,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:21,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 852 [2024-11-22 17:59:21,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:22,463 INFO L124 PetriNetUnfolderBase]: 418/2446 cut-off events. [2024-11-22 17:59:22,464 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-22 17:59:22,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3054 conditions, 2446 events. 418/2446 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 13216 event pairs, 235 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 1984. Up to 557 conditions per place. [2024-11-22 17:59:22,486 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 26 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-11-22 17:59:22,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 724 places, 732 transitions, 1532 flow [2024-11-22 17:59:22,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:22,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:22,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2252 transitions. [2024-11-22 17:59:22,491 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8810641627543035 [2024-11-22 17:59:22,491 INFO L175 Difference]: Start difference. First operand has 723 places, 733 transitions, 1478 flow. Second operand 3 states and 2252 transitions. [2024-11-22 17:59:22,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 724 places, 732 transitions, 1532 flow [2024-11-22 17:59:22,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 722 places, 732 transitions, 1526 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:22,505 INFO L231 Difference]: Finished difference. Result has 722 places, 732 transitions, 1474 flow [2024-11-22 17:59:22,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1470, 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=1474, PETRI_PLACES=722, PETRI_TRANSITIONS=732} [2024-11-22 17:59:22,507 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -76 predicate places. [2024-11-22 17:59:22,507 INFO L471 AbstractCegarLoop]: Abstraction has has 722 places, 732 transitions, 1474 flow [2024-11-22 17:59:22,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 0 states have call successors, (0), 0 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-22 17:59:22,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:22,509 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-22 17:59:22,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 17:59:22,510 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:22,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:22,511 INFO L85 PathProgramCache]: Analyzing trace with hash 16345224, now seen corresponding path program 1 times [2024-11-22 17:59:22,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:22,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148379249] [2024-11-22 17:59:22,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:22,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:22,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-22 17:59:22,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:22,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148379249] [2024-11-22 17:59:22,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148379249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:22,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:22,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:22,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225771824] [2024-11-22 17:59:22,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:22,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:22,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:22,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:22,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:22,579 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-22 17:59:22,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 722 places, 732 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:22,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:22,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-22 17:59:22,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:22,830 INFO L124 PetriNetUnfolderBase]: 58/1053 cut-off events. [2024-11-22 17:59:22,831 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-22 17:59:22,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 1053 events. 58/1053 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3329 event pairs, 19 based on Foata normal form. 0/902 useless extension candidates. Maximal degree in co-relation 1080. Up to 67 conditions per place. [2024-11-22 17:59:22,842 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-11-22 17:59:22,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 723 places, 731 transitions, 1508 flow [2024-11-22 17:59:22,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:22,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:22,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-22 17:59:22,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-22 17:59:22,849 INFO L175 Difference]: Start difference. First operand has 722 places, 732 transitions, 1474 flow. Second operand 3 states and 2272 transitions. [2024-11-22 17:59:22,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 723 places, 731 transitions, 1508 flow [2024-11-22 17:59:22,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 721 places, 731 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:22,863 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1472 flow [2024-11-22 17:59:22,865 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1468, 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=1472, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2024-11-22 17:59:22,866 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2024-11-22 17:59:22,867 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1472 flow [2024-11-22 17:59:22,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:22,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:22,869 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-22 17:59:22,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 17:59:22,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:22,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:22,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1578952280, now seen corresponding path program 1 times [2024-11-22 17:59:22,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:22,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691451707] [2024-11-22 17:59:22,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:22,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:22,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:22,945 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-22 17:59:22,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:22,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691451707] [2024-11-22 17:59:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691451707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:22,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:22,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:22,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491224427] [2024-11-22 17:59:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:22,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:22,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:22,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:22,962 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-22 17:59:22,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1472 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-22 17:59:22,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:22,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-22 17:59:22,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:23,300 INFO L124 PetriNetUnfolderBase]: 68/1036 cut-off events. [2024-11-22 17:59:23,301 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-11-22 17:59:23,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1143 conditions, 1036 events. 68/1036 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3230 event pairs, 11 based on Foata normal form. 0/892 useless extension candidates. Maximal degree in co-relation 1077. Up to 47 conditions per place. [2024-11-22 17:59:23,317 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 21 selfloop transitions, 3 changer transitions 0/737 dead transitions. [2024-11-22 17:59:23,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 737 transitions, 1536 flow [2024-11-22 17:59:23,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:23,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:23,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2285 transitions. [2024-11-22 17:59:23,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8939749608763693 [2024-11-22 17:59:23,324 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1472 flow. Second operand 3 states and 2285 transitions. [2024-11-22 17:59:23,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 737 transitions, 1536 flow [2024-11-22 17:59:23,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 737 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:23,341 INFO L231 Difference]: Finished difference. Result has 721 places, 731 transitions, 1484 flow [2024-11-22 17:59:23,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1464, 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=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1484, PETRI_PLACES=721, PETRI_TRANSITIONS=731} [2024-11-22 17:59:23,344 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -77 predicate places. [2024-11-22 17:59:23,344 INFO L471 AbstractCegarLoop]: Abstraction has has 721 places, 731 transitions, 1484 flow [2024-11-22 17:59:23,346 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-22 17:59:23,346 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:23,346 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-22 17:59:23,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 17:59:23,347 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:23,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:23,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1712700147, now seen corresponding path program 1 times [2024-11-22 17:59:23,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:23,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777413581] [2024-11-22 17:59:23,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:23,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:23,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:23,386 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-22 17:59:23,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:23,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777413581] [2024-11-22 17:59:23,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777413581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:23,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:23,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:23,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596585211] [2024-11-22 17:59:23,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:23,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:23,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:23,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:23,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:23,423 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 852 [2024-11-22 17:59:23,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 721 places, 731 transitions, 1484 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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-22 17:59:23,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:23,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 852 [2024-11-22 17:59:23,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:23,823 INFO L124 PetriNetUnfolderBase]: 230/1671 cut-off events. [2024-11-22 17:59:23,823 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2024-11-22 17:59:23,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2075 conditions, 1671 events. 230/1671 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8144 event pairs, 131 based on Foata normal form. 0/1391 useless extension candidates. Maximal degree in co-relation 1443. Up to 310 conditions per place. [2024-11-22 17:59:23,838 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 20 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2024-11-22 17:59:23,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 722 places, 730 transitions, 1526 flow [2024-11-22 17:59:23,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:23,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:23,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2024-11-22 17:59:23,844 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865414710485133 [2024-11-22 17:59:23,844 INFO L175 Difference]: Start difference. First operand has 721 places, 731 transitions, 1484 flow. Second operand 3 states and 2266 transitions. [2024-11-22 17:59:23,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 722 places, 730 transitions, 1526 flow [2024-11-22 17:59:23,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 720 places, 730 transitions, 1520 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:23,857 INFO L231 Difference]: Finished difference. Result has 720 places, 730 transitions, 1480 flow [2024-11-22 17:59:23,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=718, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1480, PETRI_PLACES=720, PETRI_TRANSITIONS=730} [2024-11-22 17:59:23,859 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -78 predicate places. [2024-11-22 17:59:23,859 INFO L471 AbstractCegarLoop]: Abstraction has has 720 places, 730 transitions, 1480 flow [2024-11-22 17:59:23,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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-22 17:59:23,861 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:23,862 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-22 17:59:23,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 17:59:23,862 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:23,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash 140338817, now seen corresponding path program 1 times [2024-11-22 17:59:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:23,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583639061] [2024-11-22 17:59:23,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:23,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:23,922 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-22 17:59:23,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:23,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583639061] [2024-11-22 17:59:23,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583639061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:23,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:23,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:23,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641183801] [2024-11-22 17:59:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:23,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:23,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:23,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:23,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 852 [2024-11-22 17:59:23,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 720 places, 730 transitions, 1480 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-22 17:59:23,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:23,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 852 [2024-11-22 17:59:23,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:24,152 INFO L124 PetriNetUnfolderBase]: 70/1098 cut-off events. [2024-11-22 17:59:24,152 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-22 17:59:24,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1223 conditions, 1098 events. 70/1098 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 3761 event pairs, 27 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1148. Up to 86 conditions per place. [2024-11-22 17:59:24,168 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2024-11-22 17:59:24,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 721 places, 729 transitions, 1514 flow [2024-11-22 17:59:24,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:24,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2024-11-22 17:59:24,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896713615023474 [2024-11-22 17:59:24,174 INFO L175 Difference]: Start difference. First operand has 720 places, 730 transitions, 1480 flow. Second operand 3 states and 2274 transitions. [2024-11-22 17:59:24,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 721 places, 729 transitions, 1514 flow [2024-11-22 17:59:24,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 719 places, 729 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:24,187 INFO L231 Difference]: Finished difference. Result has 719 places, 729 transitions, 1478 flow [2024-11-22 17:59:24,189 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1474, PETRI_DIFFERENCE_MINUEND_PLACES=717, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1478, PETRI_PLACES=719, PETRI_TRANSITIONS=729} [2024-11-22 17:59:24,190 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -79 predicate places. [2024-11-22 17:59:24,191 INFO L471 AbstractCegarLoop]: Abstraction has has 719 places, 729 transitions, 1478 flow [2024-11-22 17:59:24,192 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-22 17:59:24,193 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:24,193 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-22 17:59:24,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 17:59:24,193 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:24,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:24,194 INFO L85 PathProgramCache]: Analyzing trace with hash -363127821, now seen corresponding path program 1 times [2024-11-22 17:59:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:24,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731838868] [2024-11-22 17:59:24,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:24,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:24,239 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-22 17:59:24,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:24,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731838868] [2024-11-22 17:59:24,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731838868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:24,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:24,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:24,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074724980] [2024-11-22 17:59:24,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:24,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:24,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:24,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:24,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:24,258 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-22 17:59:24,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 719 places, 729 transitions, 1478 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:24,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:24,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-22 17:59:24,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:24,531 INFO L124 PetriNetUnfolderBase]: 110/1240 cut-off events. [2024-11-22 17:59:24,532 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-22 17:59:24,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1429 conditions, 1240 events. 110/1240 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4978 event pairs, 53 based on Foata normal form. 0/1048 useless extension candidates. Maximal degree in co-relation 1346. Up to 142 conditions per place. [2024-11-22 17:59:24,547 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-11-22 17:59:24,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 720 places, 728 transitions, 1514 flow [2024-11-22 17:59:24,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:24,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-22 17:59:24,553 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-22 17:59:24,553 INFO L175 Difference]: Start difference. First operand has 719 places, 729 transitions, 1478 flow. Second operand 3 states and 2272 transitions. [2024-11-22 17:59:24,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 720 places, 728 transitions, 1514 flow [2024-11-22 17:59:24,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 718 places, 728 transitions, 1510 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:24,564 INFO L231 Difference]: Finished difference. Result has 718 places, 728 transitions, 1476 flow [2024-11-22 17:59:24,565 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=716, 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=1476, PETRI_PLACES=718, PETRI_TRANSITIONS=728} [2024-11-22 17:59:24,567 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -80 predicate places. [2024-11-22 17:59:24,568 INFO L471 AbstractCegarLoop]: Abstraction has has 718 places, 728 transitions, 1476 flow [2024-11-22 17:59:24,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:24,570 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:24,570 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-22 17:59:24,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 17:59:24,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:24,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:24,573 INFO L85 PathProgramCache]: Analyzing trace with hash -805091486, now seen corresponding path program 1 times [2024-11-22 17:59:24,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:24,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583702218] [2024-11-22 17:59:24,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:24,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:24,627 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-22 17:59:24,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:24,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583702218] [2024-11-22 17:59:24,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583702218] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:24,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:24,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:24,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293415960] [2024-11-22 17:59:24,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:24,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:24,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:24,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:24,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:24,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 747 out of 852 [2024-11-22 17:59:24,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 728 transitions, 1476 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-22 17:59:24,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:24,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 747 of 852 [2024-11-22 17:59:24,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:25,035 INFO L124 PetriNetUnfolderBase]: 208/1516 cut-off events. [2024-11-22 17:59:25,036 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-22 17:59:25,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1888 conditions, 1516 events. 208/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 7094 event pairs, 129 based on Foata normal form. 0/1231 useless extension candidates. Maximal degree in co-relation 1797. Up to 291 conditions per place. [2024-11-22 17:59:25,058 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 21 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2024-11-22 17:59:25,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 727 transitions, 1520 flow [2024-11-22 17:59:25,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:25,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:25,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2264 transitions. [2024-11-22 17:59:25,064 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8857589984350548 [2024-11-22 17:59:25,065 INFO L175 Difference]: Start difference. First operand has 718 places, 728 transitions, 1476 flow. Second operand 3 states and 2264 transitions. [2024-11-22 17:59:25,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 727 transitions, 1520 flow [2024-11-22 17:59:25,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 717 places, 727 transitions, 1516 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:25,077 INFO L231 Difference]: Finished difference. Result has 717 places, 727 transitions, 1474 flow [2024-11-22 17:59:25,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=715, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=717, PETRI_TRANSITIONS=727} [2024-11-22 17:59:25,079 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -81 predicate places. [2024-11-22 17:59:25,080 INFO L471 AbstractCegarLoop]: Abstraction has has 717 places, 727 transitions, 1474 flow [2024-11-22 17:59:25,081 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-22 17:59:25,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:25,082 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-22 17:59:25,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 17:59:25,082 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:25,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:25,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1248222832, now seen corresponding path program 1 times [2024-11-22 17:59:25,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:25,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591034062] [2024-11-22 17:59:25,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:25,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:25,118 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-22 17:59:25,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591034062] [2024-11-22 17:59:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591034062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854862557] [2024-11-22 17:59:25,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:25,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:25,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:25,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:25,155 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 852 [2024-11-22 17:59:25,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 717 places, 727 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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-22 17:59:25,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:25,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 852 [2024-11-22 17:59:25,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:25,408 INFO L124 PetriNetUnfolderBase]: 110/1238 cut-off events. [2024-11-22 17:59:25,408 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-22 17:59:25,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1430 conditions, 1238 events. 110/1238 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4888 event pairs, 53 based on Foata normal form. 0/1053 useless extension candidates. Maximal degree in co-relation 1331. Up to 145 conditions per place. [2024-11-22 17:59:25,424 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 20 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2024-11-22 17:59:25,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 718 places, 726 transitions, 1516 flow [2024-11-22 17:59:25,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:25,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:25,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2266 transitions. [2024-11-22 17:59:25,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8865414710485133 [2024-11-22 17:59:25,430 INFO L175 Difference]: Start difference. First operand has 717 places, 727 transitions, 1474 flow. Second operand 3 states and 2266 transitions. [2024-11-22 17:59:25,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 718 places, 726 transitions, 1516 flow [2024-11-22 17:59:25,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 716 places, 726 transitions, 1512 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:25,442 INFO L231 Difference]: Finished difference. Result has 716 places, 726 transitions, 1472 flow [2024-11-22 17:59:25,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=714, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=716, PETRI_TRANSITIONS=726} [2024-11-22 17:59:25,444 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -82 predicate places. [2024-11-22 17:59:25,444 INFO L471 AbstractCegarLoop]: Abstraction has has 716 places, 726 transitions, 1472 flow [2024-11-22 17:59:25,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 0 states have call successors, (0), 0 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-22 17:59:25,446 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:25,446 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-22 17:59:25,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 17:59:25,447 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:25,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:25,447 INFO L85 PathProgramCache]: Analyzing trace with hash -808374088, now seen corresponding path program 1 times [2024-11-22 17:59:25,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:25,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988533251] [2024-11-22 17:59:25,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:25,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:25,482 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-22 17:59:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988533251] [2024-11-22 17:59:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988533251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:25,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:25,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391706316] [2024-11-22 17:59:25,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:25,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:25,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:25,502 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-22 17:59:25,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 716 places, 726 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:25,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:25,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-22 17:59:25,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:25,759 INFO L124 PetriNetUnfolderBase]: 110/1237 cut-off events. [2024-11-22 17:59:25,759 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-22 17:59:25,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1426 conditions, 1237 events. 110/1237 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/1045 useless extension candidates. Maximal degree in co-relation 1319. Up to 142 conditions per place. [2024-11-22 17:59:25,776 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2024-11-22 17:59:25,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 717 places, 725 transitions, 1508 flow [2024-11-22 17:59:25,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:25,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-22 17:59:25,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-22 17:59:25,781 INFO L175 Difference]: Start difference. First operand has 716 places, 726 transitions, 1472 flow. Second operand 3 states and 2272 transitions. [2024-11-22 17:59:25,782 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 717 places, 725 transitions, 1508 flow [2024-11-22 17:59:25,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 725 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:25,793 INFO L231 Difference]: Finished difference. Result has 715 places, 725 transitions, 1470 flow [2024-11-22 17:59:25,794 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=715, PETRI_TRANSITIONS=725} [2024-11-22 17:59:25,795 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -83 predicate places. [2024-11-22 17:59:25,795 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 725 transitions, 1470 flow [2024-11-22 17:59:25,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:25,797 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:25,797 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-22 17:59:25,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 17:59:25,797 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:25,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:25,798 INFO L85 PathProgramCache]: Analyzing trace with hash 848015721, now seen corresponding path program 1 times [2024-11-22 17:59:25,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:25,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588381103] [2024-11-22 17:59:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:25,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:25,829 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-22 17:59:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:25,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588381103] [2024-11-22 17:59:25,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588381103] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142650379] [2024-11-22 17:59:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:25,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:25,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:25,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:25,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:25,848 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-22 17:59:25,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 725 transitions, 1470 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-22 17:59:25,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:25,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-22 17:59:25,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:26,986 INFO L124 PetriNetUnfolderBase]: 252/4879 cut-off events. [2024-11-22 17:59:26,986 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-22 17:59:27,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5148 conditions, 4879 events. 252/4879 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 35872 event pairs, 79 based on Foata normal form. 0/3903 useless extension candidates. Maximal degree in co-relation 5033. Up to 214 conditions per place. [2024-11-22 17:59:27,019 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 1 changer transitions 0/723 dead transitions. [2024-11-22 17:59:27,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 715 places, 723 transitions, 1500 flow [2024-11-22 17:59:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:27,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2277 transitions. [2024-11-22 17:59:27,025 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8908450704225352 [2024-11-22 17:59:27,025 INFO L175 Difference]: Start difference. First operand has 715 places, 725 transitions, 1470 flow. Second operand 3 states and 2277 transitions. [2024-11-22 17:59:27,025 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 715 places, 723 transitions, 1500 flow [2024-11-22 17:59:27,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 723 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:27,038 INFO L231 Difference]: Finished difference. Result has 713 places, 723 transitions, 1464 flow [2024-11-22 17:59:27,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=711, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=722, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=713, PETRI_TRANSITIONS=723} [2024-11-22 17:59:27,040 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2024-11-22 17:59:27,040 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 723 transitions, 1464 flow [2024-11-22 17:59:27,042 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-22 17:59:27,042 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:27,042 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:27,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 17:59:27,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:27,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:27,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2104301585, now seen corresponding path program 1 times [2024-11-22 17:59:27,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:27,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283026951] [2024-11-22 17:59:27,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:27,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:27,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:27,569 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-22 17:59:27,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:27,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283026951] [2024-11-22 17:59:27,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283026951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:27,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:27,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 17:59:27,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884806229] [2024-11-22 17:59:27,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:27,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 17:59:27,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:27,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 17:59:27,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 17:59:27,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 852 [2024-11-22 17:59:28,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 723 transitions, 1464 flow. Second operand has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 0 states have call successors, (0), 0 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-22 17:59:28,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:28,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 852 [2024-11-22 17:59:28,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:30,395 INFO L124 PetriNetUnfolderBase]: 2081/10266 cut-off events. [2024-11-22 17:59:30,395 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-11-22 17:59:30,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13600 conditions, 10266 events. 2081/10266 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 91800 event pairs, 1421 based on Foata normal form. 0/8441 useless extension candidates. Maximal degree in co-relation 13486. Up to 2842 conditions per place. [2024-11-22 17:59:30,455 INFO L140 encePairwiseOnDemand]: 828/852 looper letters, 78 selfloop transitions, 20 changer transitions 0/719 dead transitions. [2024-11-22 17:59:30,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 719 transitions, 1652 flow [2024-11-22 17:59:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 17:59:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 17:59:30,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4121 transitions. [2024-11-22 17:59:30,464 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8061424100156495 [2024-11-22 17:59:30,464 INFO L175 Difference]: Start difference. First operand has 713 places, 723 transitions, 1464 flow. Second operand 6 states and 4121 transitions. [2024-11-22 17:59:30,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 719 transitions, 1652 flow [2024-11-22 17:59:30,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 713 places, 719 transitions, 1651 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:59:30,477 INFO L231 Difference]: Finished difference. Result has 713 places, 719 transitions, 1495 flow [2024-11-22 17:59:30,478 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1455, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=719, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1495, PETRI_PLACES=713, PETRI_TRANSITIONS=719} [2024-11-22 17:59:30,479 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -85 predicate places. [2024-11-22 17:59:30,479 INFO L471 AbstractCegarLoop]: Abstraction has has 713 places, 719 transitions, 1495 flow [2024-11-22 17:59:30,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 671.5) internal successors, (4029), 6 states have internal predecessors, (4029), 0 states have call successors, (0), 0 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-22 17:59:30,486 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:59:30,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 17:59:30,487 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:30,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:30,487 INFO L85 PathProgramCache]: Analyzing trace with hash 446710845, now seen corresponding path program 1 times [2024-11-22 17:59:30,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:30,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054527463] [2024-11-22 17:59:30,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:30,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:30,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:30,540 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-22 17:59:30,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:30,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054527463] [2024-11-22 17:59:30,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054527463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:30,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:30,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:30,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626325350] [2024-11-22 17:59:30,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:30,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:30,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:30,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:30,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:30,567 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 852 [2024-11-22 17:59:30,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 713 places, 719 transitions, 1495 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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-22 17:59:30,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:30,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 852 [2024-11-22 17:59:30,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:30,888 INFO L124 PetriNetUnfolderBase]: 190/1516 cut-off events. [2024-11-22 17:59:30,888 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2024-11-22 17:59:30,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1516 events. 190/1516 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 7149 event pairs, 105 based on Foata normal form. 0/1266 useless extension candidates. Maximal degree in co-relation 1787. Up to 253 conditions per place. [2024-11-22 17:59:30,905 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 18 selfloop transitions, 2 changer transitions 0/718 dead transitions. [2024-11-22 17:59:30,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 718 transitions, 1533 flow [2024-11-22 17:59:30,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:30,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:30,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2270 transitions. [2024-11-22 17:59:30,910 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8881064162754304 [2024-11-22 17:59:30,910 INFO L175 Difference]: Start difference. First operand has 713 places, 719 transitions, 1495 flow. Second operand 3 states and 2270 transitions. [2024-11-22 17:59:30,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 718 transitions, 1533 flow [2024-11-22 17:59:30,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 718 transitions, 1493 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 17:59:30,922 INFO L231 Difference]: Finished difference. Result has 709 places, 718 transitions, 1457 flow [2024-11-22 17:59:30,923 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=718, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=716, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1457, PETRI_PLACES=709, PETRI_TRANSITIONS=718} [2024-11-22 17:59:30,924 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -89 predicate places. [2024-11-22 17:59:30,925 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 718 transitions, 1457 flow [2024-11-22 17:59:30,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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-22 17:59:30,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:30,926 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:30,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 17:59:30,926 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:30,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:30,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1866721520, now seen corresponding path program 1 times [2024-11-22 17:59:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615526453] [2024-11-22 17:59:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:30,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:30,975 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-22 17:59:30,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:30,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615526453] [2024-11-22 17:59:30,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615526453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:30,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:30,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:30,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480809718] [2024-11-22 17:59:30,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:30,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:30,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:30,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:30,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:31,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 852 [2024-11-22 17:59:31,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 718 transitions, 1457 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 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-22 17:59:31,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:31,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 852 [2024-11-22 17:59:31,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:32,799 INFO L124 PetriNetUnfolderBase]: 681/9111 cut-off events. [2024-11-22 17:59:32,799 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2024-11-22 17:59:32,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9940 conditions, 9111 events. 681/9111 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 83806 event pairs, 287 based on Foata normal form. 0/7285 useless extension candidates. Maximal degree in co-relation 9825. Up to 689 conditions per place. [2024-11-22 17:59:32,860 INFO L140 encePairwiseOnDemand]: 845/852 looper letters, 24 selfloop transitions, 1 changer transitions 0/712 dead transitions. [2024-11-22 17:59:32,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 705 places, 712 transitions, 1495 flow [2024-11-22 17:59:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:32,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:32,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2253 transitions. [2024-11-22 17:59:32,866 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8814553990610329 [2024-11-22 17:59:32,866 INFO L175 Difference]: Start difference. First operand has 709 places, 718 transitions, 1457 flow. Second operand 3 states and 2253 transitions. [2024-11-22 17:59:32,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 705 places, 712 transitions, 1495 flow [2024-11-22 17:59:32,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 712 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:32,883 INFO L231 Difference]: Finished difference. Result has 703 places, 712 transitions, 1443 flow [2024-11-22 17:59:32,884 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1441, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1443, PETRI_PLACES=703, PETRI_TRANSITIONS=712} [2024-11-22 17:59:32,884 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2024-11-22 17:59:32,885 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 712 transitions, 1443 flow [2024-11-22 17:59:32,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 0 states have call successors, (0), 0 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-22 17:59:32,886 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:32,886 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:32,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 17:59:32,886 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:32,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash 780127852, now seen corresponding path program 1 times [2024-11-22 17:59:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:32,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257691635] [2024-11-22 17:59:32,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:32,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:32,958 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-22 17:59:32,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:32,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257691635] [2024-11-22 17:59:32,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257691635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:32,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:32,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:32,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628877581] [2024-11-22 17:59:32,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:32,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:32,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:32,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:32,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:32,982 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-22 17:59:32,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 712 transitions, 1443 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:32,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:32,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-22 17:59:32,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:33,315 INFO L124 PetriNetUnfolderBase]: 131/1261 cut-off events. [2024-11-22 17:59:33,315 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2024-11-22 17:59:33,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 1261 events. 131/1261 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 5006 event pairs, 71 based on Foata normal form. 0/1076 useless extension candidates. Maximal degree in co-relation 1379. Up to 175 conditions per place. [2024-11-22 17:59:33,332 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/711 dead transitions. [2024-11-22 17:59:33,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 711 transitions, 1479 flow [2024-11-22 17:59:33,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:33,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-22 17:59:33,338 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-22 17:59:33,339 INFO L175 Difference]: Start difference. First operand has 703 places, 712 transitions, 1443 flow. Second operand 3 states and 2272 transitions. [2024-11-22 17:59:33,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 711 transitions, 1479 flow [2024-11-22 17:59:33,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 703 places, 711 transitions, 1478 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:59:33,354 INFO L231 Difference]: Finished difference. Result has 703 places, 711 transitions, 1444 flow [2024-11-22 17:59:33,355 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1440, 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=1444, PETRI_PLACES=703, PETRI_TRANSITIONS=711} [2024-11-22 17:59:33,355 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -95 predicate places. [2024-11-22 17:59:33,356 INFO L471 AbstractCegarLoop]: Abstraction has has 703 places, 711 transitions, 1444 flow [2024-11-22 17:59:33,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:33,357 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:59:33,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 17:59:33,357 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:33,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash 936091404, now seen corresponding path program 1 times [2024-11-22 17:59:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:33,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062533853] [2024-11-22 17:59:33,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:33,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:33,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:33,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:59:33,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:33,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062533853] [2024-11-22 17:59:33,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062533853] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:33,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:33,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:33,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690509375] [2024-11-22 17:59:33,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:33,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:33,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:33,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:33,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:33,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 852 [2024-11-22 17:59:33,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 703 places, 711 transitions, 1444 flow. Second operand has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 0 states have call successors, (0), 0 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-22 17:59:33,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:33,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 852 [2024-11-22 17:59:33,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:33,676 INFO L124 PetriNetUnfolderBase]: 70/1071 cut-off events. [2024-11-22 17:59:33,676 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-22 17:59:33,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1071 events. 70/1071 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3634 event pairs, 27 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1080. Up to 83 conditions per place. [2024-11-22 17:59:33,689 INFO L140 encePairwiseOnDemand]: 850/852 looper letters, 14 selfloop transitions, 1 changer transitions 0/710 dead transitions. [2024-11-22 17:59:33,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 704 places, 710 transitions, 1472 flow [2024-11-22 17:59:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:33,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2283 transitions. [2024-11-22 17:59:33,694 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8931924882629108 [2024-11-22 17:59:33,694 INFO L175 Difference]: Start difference. First operand has 703 places, 711 transitions, 1444 flow. Second operand 3 states and 2283 transitions. [2024-11-22 17:59:33,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 704 places, 710 transitions, 1472 flow [2024-11-22 17:59:33,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 710 transitions, 1468 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:33,704 INFO L231 Difference]: Finished difference. Result has 702 places, 710 transitions, 1440 flow [2024-11-22 17:59:33,706 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=709, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1440, PETRI_PLACES=702, PETRI_TRANSITIONS=710} [2024-11-22 17:59:33,707 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2024-11-22 17:59:33,707 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 710 transitions, 1440 flow [2024-11-22 17:59:33,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.0) internal successors, (2271), 3 states have internal predecessors, (2271), 0 states have call successors, (0), 0 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-22 17:59:33,708 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:33,708 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:33,708 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 17:59:33,708 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:33,708 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:33,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1148610698, now seen corresponding path program 1 times [2024-11-22 17:59:33,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:33,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829975922] [2024-11-22 17:59:33,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:33,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:33,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:33,762 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-22 17:59:33,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:33,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829975922] [2024-11-22 17:59:33,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829975922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:33,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:33,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:33,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687329432] [2024-11-22 17:59:33,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:33,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:33,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:33,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:33,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:33,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-22 17:59:33,777 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 710 transitions, 1440 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-22 17:59:33,777 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:33,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-22 17:59:33,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:33,986 INFO L124 PetriNetUnfolderBase]: 70/1070 cut-off events. [2024-11-22 17:59:33,986 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2024-11-22 17:59:33,996 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1195 conditions, 1070 events. 70/1070 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3624 event pairs, 27 based on Foata normal form. 0/941 useless extension candidates. Maximal degree in co-relation 1080. Up to 85 conditions per place. [2024-11-22 17:59:34,000 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 15 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2024-11-22 17:59:34,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 709 transitions, 1472 flow [2024-11-22 17:59:34,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2276 transitions. [2024-11-22 17:59:34,005 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8904538341158059 [2024-11-22 17:59:34,005 INFO L175 Difference]: Start difference. First operand has 702 places, 710 transitions, 1440 flow. Second operand 3 states and 2276 transitions. [2024-11-22 17:59:34,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 709 transitions, 1472 flow [2024-11-22 17:59:34,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 709 transitions, 1471 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:59:34,015 INFO L231 Difference]: Finished difference. Result has 702 places, 709 transitions, 1441 flow [2024-11-22 17:59:34,016 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=709, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=707, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=702, PETRI_TRANSITIONS=709} [2024-11-22 17:59:34,016 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -96 predicate places. [2024-11-22 17:59:34,016 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 709 transitions, 1441 flow [2024-11-22 17:59:34,017 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-22 17:59:34,017 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:34,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 17:59:34,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 17:59:34,018 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:34,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:34,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1102053112, now seen corresponding path program 1 times [2024-11-22 17:59:34,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:34,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438640919] [2024-11-22 17:59:34,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:34,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:34,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-22 17:59:34,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:34,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438640919] [2024-11-22 17:59:34,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438640919] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:34,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:34,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:34,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936748893] [2024-11-22 17:59:34,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:34,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:34,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:34,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:34,287 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 700 out of 852 [2024-11-22 17:59:34,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 709 transitions, 1441 flow. Second operand has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 0 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-22 17:59:34,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:34,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 700 of 852 [2024-11-22 17:59:34,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:36,518 INFO L124 PetriNetUnfolderBase]: 2081/10172 cut-off events. [2024-11-22 17:59:36,518 INFO L125 PetriNetUnfolderBase]: For 690/690 co-relation queries the response was YES. [2024-11-22 17:59:36,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13483 conditions, 10172 events. 2081/10172 cut-off events. For 690/690 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 90966 event pairs, 1421 based on Foata normal form. 0/8441 useless extension candidates. Maximal degree in co-relation 13369. Up to 2833 conditions per place. [2024-11-22 17:59:36,569 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 69 selfloop transitions, 2 changer transitions 0/708 dead transitions. [2024-11-22 17:59:36,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 708 transitions, 1581 flow [2024-11-22 17:59:36,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2171 transitions. [2024-11-22 17:59:36,573 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8493740219092332 [2024-11-22 17:59:36,574 INFO L175 Difference]: Start difference. First operand has 702 places, 709 transitions, 1441 flow. Second operand 3 states and 2171 transitions. [2024-11-22 17:59:36,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 708 transitions, 1581 flow [2024-11-22 17:59:36,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 708 transitions, 1577 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:36,584 INFO L231 Difference]: Finished difference. Result has 701 places, 708 transitions, 1439 flow [2024-11-22 17:59:36,586 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=706, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1439, PETRI_PLACES=701, PETRI_TRANSITIONS=708} [2024-11-22 17:59:36,586 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -97 predicate places. [2024-11-22 17:59:36,586 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 708 transitions, 1439 flow [2024-11-22 17:59:36,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 702.0) internal successors, (2106), 3 states have internal predecessors, (2106), 0 states have call successors, (0), 0 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-22 17:59:36,587 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:36,587 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:36,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 17:59:36,587 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:36,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:36,588 INFO L85 PathProgramCache]: Analyzing trace with hash -937500694, now seen corresponding path program 1 times [2024-11-22 17:59:36,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:36,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837618264] [2024-11-22 17:59:36,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:36,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:36,649 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-22 17:59:36,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:36,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837618264] [2024-11-22 17:59:36,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837618264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:36,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:36,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:36,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856819951] [2024-11-22 17:59:36,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:36,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:36,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:36,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:36,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:36,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 852 [2024-11-22 17:59:36,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 708 transitions, 1439 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-22 17:59:36,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:36,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 852 [2024-11-22 17:59:36,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:36,917 INFO L124 PetriNetUnfolderBase]: 110/1209 cut-off events. [2024-11-22 17:59:36,918 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-22 17:59:36,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 1209 events. 110/1209 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4421 event pairs, 53 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1387. Up to 141 conditions per place. [2024-11-22 17:59:36,932 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 16 selfloop transitions, 2 changer transitions 0/707 dead transitions. [2024-11-22 17:59:36,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 707 transitions, 1473 flow [2024-11-22 17:59:36,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:36,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:36,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2274 transitions. [2024-11-22 17:59:36,937 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8896713615023474 [2024-11-22 17:59:36,937 INFO L175 Difference]: Start difference. First operand has 701 places, 708 transitions, 1439 flow. Second operand 3 states and 2274 transitions. [2024-11-22 17:59:36,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 707 transitions, 1473 flow [2024-11-22 17:59:36,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 707 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:36,954 INFO L231 Difference]: Finished difference. Result has 700 places, 707 transitions, 1437 flow [2024-11-22 17:59:36,955 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1433, 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=1437, PETRI_PLACES=700, PETRI_TRANSITIONS=707} [2024-11-22 17:59:36,956 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -98 predicate places. [2024-11-22 17:59:36,956 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 707 transitions, 1437 flow [2024-11-22 17:59:36,957 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-22 17:59:36,957 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:36,957 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-22 17:59:36,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 17:59:36,957 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:36,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:36,957 INFO L85 PathProgramCache]: Analyzing trace with hash -509341640, now seen corresponding path program 1 times [2024-11-22 17:59:36,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:36,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564248142] [2024-11-22 17:59:36,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:36,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:36,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:37,022 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-22 17:59:37,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:37,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564248142] [2024-11-22 17:59:37,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564248142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:37,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:37,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:37,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074164029] [2024-11-22 17:59:37,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:37,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:37,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:37,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:37,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:37,043 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 852 [2024-11-22 17:59:37,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 707 transitions, 1437 flow. Second operand has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 0 states have call successors, (0), 0 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-22 17:59:37,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:37,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 852 [2024-11-22 17:59:37,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:37,867 INFO L124 PetriNetUnfolderBase]: 252/4797 cut-off events. [2024-11-22 17:59:37,867 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-22 17:59:37,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5075 conditions, 4797 events. 252/4797 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 35619 event pairs, 79 based on Foata normal form. 0/3908 useless extension candidates. Maximal degree in co-relation 4960. Up to 220 conditions per place. [2024-11-22 17:59:37,907 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 22 selfloop transitions, 1 changer transitions 0/702 dead transitions. [2024-11-22 17:59:37,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 697 places, 702 transitions, 1473 flow [2024-11-22 17:59:37,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:37,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:37,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2259 transitions. [2024-11-22 17:59:37,911 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8838028169014085 [2024-11-22 17:59:37,911 INFO L175 Difference]: Start difference. First operand has 700 places, 707 transitions, 1437 flow. Second operand 3 states and 2259 transitions. [2024-11-22 17:59:37,911 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 697 places, 702 transitions, 1473 flow [2024-11-22 17:59:37,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 702 transitions, 1469 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:37,918 INFO L231 Difference]: Finished difference. Result has 695 places, 702 transitions, 1425 flow [2024-11-22 17:59:37,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1425, PETRI_PLACES=695, PETRI_TRANSITIONS=702} [2024-11-22 17:59:37,919 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2024-11-22 17:59:37,920 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 702 transitions, 1425 flow [2024-11-22 17:59:37,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.0) internal successors, (2235), 3 states have internal predecessors, (2235), 0 states have call successors, (0), 0 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-22 17:59:37,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:37,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:37,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 17:59:37,921 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:37,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash 931055478, now seen corresponding path program 1 times [2024-11-22 17:59:37,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:37,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495375866] [2024-11-22 17:59:37,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:37,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:37,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:59:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495375866] [2024-11-22 17:59:37,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495375866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:37,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:37,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:37,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273649094] [2024-11-22 17:59:37,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:37,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:37,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:37,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:37,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:38,009 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 751 out of 852 [2024-11-22 17:59:38,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 702 transitions, 1425 flow. Second operand has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:38,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:38,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 751 of 852 [2024-11-22 17:59:38,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:38,321 INFO L124 PetriNetUnfolderBase]: 110/1203 cut-off events. [2024-11-22 17:59:38,321 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-11-22 17:59:38,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1394 conditions, 1203 events. 110/1203 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4633 event pairs, 53 based on Foata normal form. 0/1046 useless extension candidates. Maximal degree in co-relation 1279. Up to 142 conditions per place. [2024-11-22 17:59:38,332 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 17 selfloop transitions, 2 changer transitions 0/701 dead transitions. [2024-11-22 17:59:38,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 701 transitions, 1461 flow [2024-11-22 17:59:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2272 transitions. [2024-11-22 17:59:38,335 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8888888888888888 [2024-11-22 17:59:38,335 INFO L175 Difference]: Start difference. First operand has 695 places, 702 transitions, 1425 flow. Second operand 3 states and 2272 transitions. [2024-11-22 17:59:38,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 701 transitions, 1461 flow [2024-11-22 17:59:38,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 695 places, 701 transitions, 1460 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:59:38,342 INFO L231 Difference]: Finished difference. Result has 695 places, 701 transitions, 1426 flow [2024-11-22 17:59:38,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1422, PETRI_DIFFERENCE_MINUEND_PLACES=693, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1426, PETRI_PLACES=695, PETRI_TRANSITIONS=701} [2024-11-22 17:59:38,343 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2024-11-22 17:59:38,343 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 701 transitions, 1426 flow [2024-11-22 17:59:38,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.3333333333334) internal successors, (2257), 3 states have internal predecessors, (2257), 0 states have call successors, (0), 0 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-22 17:59:38,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:38,344 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:38,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 17:59:38,344 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:38,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:38,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1282613414, now seen corresponding path program 1 times [2024-11-22 17:59:38,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91279640] [2024-11-22 17:59:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:38,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:38,420 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-22 17:59:38,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:38,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91279640] [2024-11-22 17:59:38,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [91279640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:38,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:38,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:38,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895777080] [2024-11-22 17:59:38,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:38,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:38,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:38,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:38,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:38,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-22 17:59:38,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 701 transitions, 1426 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-22 17:59:38,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:38,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-22 17:59:38,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:39,371 INFO L124 PetriNetUnfolderBase]: 293/5079 cut-off events. [2024-11-22 17:59:39,371 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2024-11-22 17:59:39,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5418 conditions, 5079 events. 293/5079 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 37540 event pairs, 40 based on Foata normal form. 0/4168 useless extension candidates. Maximal degree in co-relation 5304. Up to 227 conditions per place. [2024-11-22 17:59:39,404 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 26 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2024-11-22 17:59:39,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 711 transitions, 1512 flow [2024-11-22 17:59:39,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2024-11-22 17:59:39,409 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8955399061032864 [2024-11-22 17:59:39,409 INFO L175 Difference]: Start difference. First operand has 695 places, 701 transitions, 1426 flow. Second operand 3 states and 2289 transitions. [2024-11-22 17:59:39,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 711 transitions, 1512 flow [2024-11-22 17:59:39,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 711 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:39,420 INFO L231 Difference]: Finished difference. Result has 694 places, 702 transitions, 1441 flow [2024-11-22 17:59:39,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1441, PETRI_PLACES=694, PETRI_TRANSITIONS=702} [2024-11-22 17:59:39,422 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -104 predicate places. [2024-11-22 17:59:39,422 INFO L471 AbstractCegarLoop]: Abstraction has has 694 places, 702 transitions, 1441 flow [2024-11-22 17:59:39,422 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-22 17:59:39,423 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:39,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:39,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 17:59:39,423 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:39,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:39,424 INFO L85 PathProgramCache]: Analyzing trace with hash 64197744, now seen corresponding path program 1 times [2024-11-22 17:59:39,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:39,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557548693] [2024-11-22 17:59:39,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:39,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:39,513 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-22 17:59:39,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:39,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557548693] [2024-11-22 17:59:39,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557548693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:39,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:39,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:39,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443357765] [2024-11-22 17:59:39,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:39,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:39,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:39,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:39,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:39,529 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-22 17:59:39,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 694 places, 702 transitions, 1441 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-22 17:59:39,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:39,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-22 17:59:39,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:40,451 INFO L124 PetriNetUnfolderBase]: 364/5532 cut-off events. [2024-11-22 17:59:40,452 INFO L125 PetriNetUnfolderBase]: For 183/225 co-relation queries the response was YES. [2024-11-22 17:59:40,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6060 conditions, 5532 events. 364/5532 cut-off events. For 183/225 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 41791 event pairs, 54 based on Foata normal form. 0/4547 useless extension candidates. Maximal degree in co-relation 5945. Up to 301 conditions per place. [2024-11-22 17:59:40,497 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 27 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2024-11-22 17:59:40,497 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 713 transitions, 1540 flow [2024-11-22 17:59:40,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:40,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2289 transitions. [2024-11-22 17:59:40,500 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8955399061032864 [2024-11-22 17:59:40,500 INFO L175 Difference]: Start difference. First operand has 694 places, 702 transitions, 1441 flow. Second operand 3 states and 2289 transitions. [2024-11-22 17:59:40,500 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 713 transitions, 1540 flow [2024-11-22 17:59:40,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 694 places, 713 transitions, 1540 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 17:59:40,507 INFO L231 Difference]: Finished difference. Result has 695 places, 704 transitions, 1474 flow [2024-11-22 17:59:40,507 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1437, PETRI_DIFFERENCE_MINUEND_PLACES=692, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=695, PETRI_TRANSITIONS=704} [2024-11-22 17:59:40,508 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -103 predicate places. [2024-11-22 17:59:40,508 INFO L471 AbstractCegarLoop]: Abstraction has has 695 places, 704 transitions, 1474 flow [2024-11-22 17:59:40,509 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-22 17:59:40,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:40,509 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-22 17:59:40,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 17:59:40,509 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:40,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:40,510 INFO L85 PathProgramCache]: Analyzing trace with hash 979804945, now seen corresponding path program 1 times [2024-11-22 17:59:40,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:40,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419144687] [2024-11-22 17:59:40,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:40,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:40,575 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-22 17:59:40,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:40,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419144687] [2024-11-22 17:59:40,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419144687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:40,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:40,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:40,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902068395] [2024-11-22 17:59:40,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:40,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:40,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:40,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:40,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:40,581 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 757 out of 852 [2024-11-22 17:59:40,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 695 places, 704 transitions, 1474 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-22 17:59:40,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:40,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 757 of 852 [2024-11-22 17:59:40,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:41,501 INFO L124 PetriNetUnfolderBase]: 281/4298 cut-off events. [2024-11-22 17:59:41,501 INFO L125 PetriNetUnfolderBase]: For 423/677 co-relation queries the response was YES. [2024-11-22 17:59:41,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4916 conditions, 4298 events. 281/4298 cut-off events. For 423/677 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 29284 event pairs, 46 based on Foata normal form. 1/3573 useless extension candidates. Maximal degree in co-relation 4801. Up to 227 conditions per place. [2024-11-22 17:59:41,539 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 23 selfloop transitions, 4 changer transitions 0/713 dead transitions. [2024-11-22 17:59:41,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 696 places, 713 transitions, 1578 flow [2024-11-22 17:59:41,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2291 transitions. [2024-11-22 17:59:41,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8963223787167449 [2024-11-22 17:59:41,542 INFO L175 Difference]: Start difference. First operand has 695 places, 704 transitions, 1474 flow. Second operand 3 states and 2291 transitions. [2024-11-22 17:59:41,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 696 places, 713 transitions, 1578 flow [2024-11-22 17:59:41,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 696 places, 713 transitions, 1578 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 17:59:41,549 INFO L231 Difference]: Finished difference. Result has 697 places, 706 transitions, 1496 flow [2024-11-22 17:59:41,550 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1472, PETRI_DIFFERENCE_MINUEND_PLACES=694, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1496, PETRI_PLACES=697, PETRI_TRANSITIONS=706} [2024-11-22 17:59:41,550 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2024-11-22 17:59:41,550 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 706 transitions, 1496 flow [2024-11-22 17:59:41,551 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-22 17:59:41,551 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:41,551 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:41,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 17:59:41,552 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:41,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1531507649, now seen corresponding path program 1 times [2024-11-22 17:59:41,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:41,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421025187] [2024-11-22 17:59:41,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:41,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:41,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:41,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 17:59:41,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:41,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421025187] [2024-11-22 17:59:41,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421025187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:41,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:41,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:41,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246258600] [2024-11-22 17:59:41,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:41,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:41,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:41,628 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 756 out of 852 [2024-11-22 17:59:41,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 706 transitions, 1496 flow. Second operand has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 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-22 17:59:41,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:41,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 756 of 852 [2024-11-22 17:59:41,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:43,246 INFO L124 PetriNetUnfolderBase]: 562/7837 cut-off events. [2024-11-22 17:59:43,246 INFO L125 PetriNetUnfolderBase]: For 842/888 co-relation queries the response was YES. [2024-11-22 17:59:43,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9150 conditions, 7837 events. 562/7837 cut-off events. For 842/888 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 67566 event pairs, 82 based on Foata normal form. 0/6482 useless extension candidates. Maximal degree in co-relation 9034. Up to 306 conditions per place. [2024-11-22 17:59:43,340 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 30 selfloop transitions, 2 changer transitions 0/717 dead transitions. [2024-11-22 17:59:43,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 698 places, 717 transitions, 1620 flow [2024-11-22 17:59:43,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:43,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:43,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2290 transitions. [2024-11-22 17:59:43,345 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8959311424100157 [2024-11-22 17:59:43,345 INFO L175 Difference]: Start difference. First operand has 697 places, 706 transitions, 1496 flow. Second operand 3 states and 2290 transitions. [2024-11-22 17:59:43,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 698 places, 717 transitions, 1620 flow [2024-11-22 17:59:43,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 697 places, 717 transitions, 1613 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:59:43,360 INFO L231 Difference]: Finished difference. Result has 697 places, 705 transitions, 1494 flow [2024-11-22 17:59:43,361 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=695, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1494, PETRI_PLACES=697, PETRI_TRANSITIONS=705} [2024-11-22 17:59:43,361 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -101 predicate places. [2024-11-22 17:59:43,362 INFO L471 AbstractCegarLoop]: Abstraction has has 697 places, 705 transitions, 1494 flow [2024-11-22 17:59:43,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 757.6666666666666) internal successors, (2273), 3 states have internal predecessors, (2273), 0 states have call successors, (0), 0 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-22 17:59:43,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:43,363 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:43,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 17:59:43,364 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:43,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:43,364 INFO L85 PathProgramCache]: Analyzing trace with hash 296310289, now seen corresponding path program 1 times [2024-11-22 17:59:43,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:43,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92061301] [2024-11-22 17:59:43,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:43,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:43,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:43,457 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-22 17:59:43,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:43,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92061301] [2024-11-22 17:59:43,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92061301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:43,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:43,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:43,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301310180] [2024-11-22 17:59:43,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:43,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:43,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:43,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:43,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:43,483 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 852 [2024-11-22 17:59:43,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 697 places, 705 transitions, 1494 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-22 17:59:43,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:43,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 852 [2024-11-22 17:59:43,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:45,219 INFO L124 PetriNetUnfolderBase]: 856/8099 cut-off events. [2024-11-22 17:59:45,219 INFO L125 PetriNetUnfolderBase]: For 1312/1380 co-relation queries the response was YES. [2024-11-22 17:59:45,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10234 conditions, 8099 events. 856/8099 cut-off events. For 1312/1380 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 71852 event pairs, 76 based on Foata normal form. 3/6856 useless extension candidates. Maximal degree in co-relation 10116. Up to 744 conditions per place. [2024-11-22 17:59:45,289 INFO L140 encePairwiseOnDemand]: 845/852 looper letters, 34 selfloop transitions, 2 changer transitions 5/713 dead transitions. [2024-11-22 17:59:45,289 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 695 places, 713 transitions, 1621 flow [2024-11-22 17:59:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:45,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:45,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2269 transitions. [2024-11-22 17:59:45,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8877151799687011 [2024-11-22 17:59:45,292 INFO L175 Difference]: Start difference. First operand has 697 places, 705 transitions, 1494 flow. Second operand 3 states and 2269 transitions. [2024-11-22 17:59:45,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 695 places, 713 transitions, 1621 flow [2024-11-22 17:59:45,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 693 places, 713 transitions, 1617 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:45,304 INFO L231 Difference]: Finished difference. Result has 693 places, 696 transitions, 1471 flow [2024-11-22 17:59:45,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1482, PETRI_DIFFERENCE_MINUEND_PLACES=691, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1471, PETRI_PLACES=693, PETRI_TRANSITIONS=696} [2024-11-22 17:59:45,306 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -105 predicate places. [2024-11-22 17:59:45,306 INFO L471 AbstractCegarLoop]: Abstraction has has 693 places, 696 transitions, 1471 flow [2024-11-22 17:59:45,307 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-22 17:59:45,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:45,307 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:45,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 17:59:45,308 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:45,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:45,308 INFO L85 PathProgramCache]: Analyzing trace with hash 249688354, now seen corresponding path program 1 times [2024-11-22 17:59:45,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:45,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565777119] [2024-11-22 17:59:45,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:45,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:45,402 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-22 17:59:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565777119] [2024-11-22 17:59:45,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565777119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:45,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:45,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:45,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417639558] [2024-11-22 17:59:45,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:45,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:45,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:45,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:45,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:45,419 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 753 out of 852 [2024-11-22 17:59:45,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 693 places, 696 transitions, 1471 flow. Second operand has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 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-22 17:59:45,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:45,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 753 of 852 [2024-11-22 17:59:45,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:47,945 INFO L124 PetriNetUnfolderBase]: 798/11758 cut-off events. [2024-11-22 17:59:47,945 INFO L125 PetriNetUnfolderBase]: For 1102/1416 co-relation queries the response was YES. [2024-11-22 17:59:48,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13474 conditions, 11758 events. 798/11758 cut-off events. For 1102/1416 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 113051 event pairs, 89 based on Foata normal form. 2/9786 useless extension candidates. Maximal degree in co-relation 13357. Up to 603 conditions per place. [2024-11-22 17:59:48,081 INFO L140 encePairwiseOnDemand]: 848/852 looper letters, 34 selfloop transitions, 2 changer transitions 0/709 dead transitions. [2024-11-22 17:59:48,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 709 transitions, 1609 flow [2024-11-22 17:59:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:48,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2286 transitions. [2024-11-22 17:59:48,085 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8943661971830986 [2024-11-22 17:59:48,085 INFO L175 Difference]: Start difference. First operand has 693 places, 696 transitions, 1471 flow. Second operand 3 states and 2286 transitions. [2024-11-22 17:59:48,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 709 transitions, 1609 flow [2024-11-22 17:59:48,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 709 transitions, 1605 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 17:59:48,100 INFO L231 Difference]: Finished difference. Result has 688 places, 696 transitions, 1477 flow [2024-11-22 17:59:48,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=685, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1477, PETRI_PLACES=688, PETRI_TRANSITIONS=696} [2024-11-22 17:59:48,101 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2024-11-22 17:59:48,102 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 696 transitions, 1477 flow [2024-11-22 17:59:48,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 754.6666666666666) internal successors, (2264), 3 states have internal predecessors, (2264), 0 states have call successors, (0), 0 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-22 17:59:48,103 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:48,103 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:48,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-22 17:59:48,104 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:48,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:48,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1820824776, now seen corresponding path program 1 times [2024-11-22 17:59:48,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:48,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774434261] [2024-11-22 17:59:48,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:48,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:48,393 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-22 17:59:48,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:48,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774434261] [2024-11-22 17:59:48,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774434261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:48,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:48,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 17:59:48,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239033180] [2024-11-22 17:59:48,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:48,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 17:59:48,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:48,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 17:59:48,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 17:59:48,433 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 752 out of 852 [2024-11-22 17:59:48,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 696 transitions, 1477 flow. Second operand has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 0 states have call successors, (0), 0 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-22 17:59:48,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:48,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 752 of 852 [2024-11-22 17:59:48,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:50,421 INFO L124 PetriNetUnfolderBase]: 706/10213 cut-off events. [2024-11-22 17:59:50,422 INFO L125 PetriNetUnfolderBase]: For 1338/1519 co-relation queries the response was YES. [2024-11-22 17:59:50,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12042 conditions, 10213 events. 706/10213 cut-off events. For 1338/1519 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 93349 event pairs, 86 based on Foata normal form. 14/8627 useless extension candidates. Maximal degree in co-relation 11923. Up to 244 conditions per place. [2024-11-22 17:59:50,527 INFO L140 encePairwiseOnDemand]: 845/852 looper letters, 35 selfloop transitions, 6 changer transitions 0/713 dead transitions. [2024-11-22 17:59:50,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1665 flow [2024-11-22 17:59:50,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 17:59:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 17:59:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 3036 transitions. [2024-11-22 17:59:50,529 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8908450704225352 [2024-11-22 17:59:50,529 INFO L175 Difference]: Start difference. First operand has 688 places, 696 transitions, 1477 flow. Second operand 4 states and 3036 transitions. [2024-11-22 17:59:50,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1665 flow [2024-11-22 17:59:50,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 713 transitions, 1665 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 17:59:50,539 INFO L231 Difference]: Finished difference. Result has 691 places, 695 transitions, 1487 flow [2024-11-22 17:59:50,539 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=688, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=689, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1487, PETRI_PLACES=691, PETRI_TRANSITIONS=695} [2024-11-22 17:59:50,540 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2024-11-22 17:59:50,540 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 695 transitions, 1487 flow [2024-11-22 17:59:50,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 753.75) internal successors, (3015), 4 states have internal predecessors, (3015), 0 states have call successors, (0), 0 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-22 17:59:50,541 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:50,541 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:50,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-22 17:59:50,541 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:50,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:50,542 INFO L85 PathProgramCache]: Analyzing trace with hash 53584812, now seen corresponding path program 1 times [2024-11-22 17:59:50,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:50,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287590279] [2024-11-22 17:59:50,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:50,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:50,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:50,608 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-22 17:59:50,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:50,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287590279] [2024-11-22 17:59:50,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287590279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:50,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:50,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 17:59:50,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418478585] [2024-11-22 17:59:50,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:50,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 17:59:50,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:50,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 17:59:50,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 17:59:50,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 725 out of 852 [2024-11-22 17:59:50,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 695 transitions, 1487 flow. Second operand has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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-22 17:59:50,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:50,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 725 of 852 [2024-11-22 17:59:50,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:53,437 INFO L124 PetriNetUnfolderBase]: 2837/15313 cut-off events. [2024-11-22 17:59:53,438 INFO L125 PetriNetUnfolderBase]: For 5183/5263 co-relation queries the response was YES. [2024-11-22 17:59:53,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23251 conditions, 15313 events. 2837/15313 cut-off events. For 5183/5263 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 154634 event pairs, 112 based on Foata normal form. 0/13635 useless extension candidates. Maximal degree in co-relation 23130. Up to 3602 conditions per place. [2024-11-22 17:59:53,613 INFO L140 encePairwiseOnDemand]: 838/852 looper letters, 50 selfloop transitions, 3 changer transitions 0/697 dead transitions. [2024-11-22 17:59:53,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 697 transitions, 1634 flow [2024-11-22 17:59:53,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 17:59:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 17:59:53,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2024-11-22 17:59:53,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8716744913928013 [2024-11-22 17:59:53,616 INFO L175 Difference]: Start difference. First operand has 691 places, 695 transitions, 1487 flow. Second operand 3 states and 2228 transitions. [2024-11-22 17:59:53,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 697 transitions, 1634 flow [2024-11-22 17:59:53,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 697 transitions, 1620 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 17:59:53,628 INFO L231 Difference]: Finished difference. Result has 680 places, 685 transitions, 1466 flow [2024-11-22 17:59:53,630 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1453, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=680, PETRI_TRANSITIONS=685} [2024-11-22 17:59:53,630 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -118 predicate places. [2024-11-22 17:59:53,630 INFO L471 AbstractCegarLoop]: Abstraction has has 680 places, 685 transitions, 1466 flow [2024-11-22 17:59:53,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.0) internal successors, (2181), 3 states have internal predecessors, (2181), 0 states have call successors, (0), 0 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-22 17:59:53,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:53,632 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:53,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-22 17:59:53,632 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:53,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:53,633 INFO L85 PathProgramCache]: Analyzing trace with hash 288802225, now seen corresponding path program 1 times [2024-11-22 17:59:53,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:53,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537309398] [2024-11-22 17:59:53,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:53,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:54,077 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-22 17:59:54,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:54,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537309398] [2024-11-22 17:59:54,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537309398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:54,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:54,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 17:59:54,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568398206] [2024-11-22 17:59:54,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:54,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 17:59:54,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:54,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 17:59:54,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 17:59:54,510 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 714 out of 852 [2024-11-22 17:59:54,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 680 places, 685 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 0 states have call successors, (0), 0 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-22 17:59:54,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:54,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 714 of 852 [2024-11-22 17:59:54,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 17:59:56,380 INFO L124 PetriNetUnfolderBase]: 709/7349 cut-off events. [2024-11-22 17:59:56,380 INFO L125 PetriNetUnfolderBase]: For 1856/2637 co-relation queries the response was YES. [2024-11-22 17:59:56,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9683 conditions, 7349 events. 709/7349 cut-off events. For 1856/2637 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 56960 event pairs, 269 based on Foata normal form. 20/6446 useless extension candidates. Maximal degree in co-relation 9561. Up to 740 conditions per place. [2024-11-22 17:59:56,452 INFO L140 encePairwiseOnDemand]: 841/852 looper letters, 94 selfloop transitions, 12 changer transitions 0/730 dead transitions. [2024-11-22 17:59:56,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 730 transitions, 1809 flow [2024-11-22 17:59:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 17:59:56,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-22 17:59:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 6522 transitions. [2024-11-22 17:59:56,456 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8505477308294209 [2024-11-22 17:59:56,456 INFO L175 Difference]: Start difference. First operand has 680 places, 685 transitions, 1466 flow. Second operand 9 states and 6522 transitions. [2024-11-22 17:59:56,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 730 transitions, 1809 flow [2024-11-22 17:59:56,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 687 places, 730 transitions, 1806 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 17:59:56,467 INFO L231 Difference]: Finished difference. Result has 690 places, 690 transitions, 1513 flow [2024-11-22 17:59:56,468 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=679, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=685, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1513, PETRI_PLACES=690, PETRI_TRANSITIONS=690} [2024-11-22 17:59:56,468 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -108 predicate places. [2024-11-22 17:59:56,468 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 690 transitions, 1513 flow [2024-11-22 17:59:56,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 718.25) internal successors, (5746), 8 states have internal predecessors, (5746), 0 states have call successors, (0), 0 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-22 17:59:56,470 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 17:59:56,470 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 17:59:56,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-22 17:59:56,470 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 17:59:56,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 17:59:56,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1881201899, now seen corresponding path program 1 times [2024-11-22 17:59:56,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 17:59:56,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130263956] [2024-11-22 17:59:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 17:59:56,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 17:59:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 17:59:57,144 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-22 17:59:57,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 17:59:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130263956] [2024-11-22 17:59:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130263956] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 17:59:57,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 17:59:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 17:59:57,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827509773] [2024-11-22 17:59:57,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 17:59:57,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 17:59:57,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 17:59:57,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 17:59:57,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 17:59:57,447 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 699 out of 852 [2024-11-22 17:59:57,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 690 transitions, 1513 flow. Second operand has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 0 states have call successors, (0), 0 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-22 17:59:57,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 17:59:57,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 699 of 852 [2024-11-22 17:59:57,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:04,308 INFO L124 PetriNetUnfolderBase]: 6421/29491 cut-off events. [2024-11-22 18:00:04,308 INFO L125 PetriNetUnfolderBase]: For 10817/10821 co-relation queries the response was YES. [2024-11-22 18:00:04,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46797 conditions, 29491 events. 6421/29491 cut-off events. For 10817/10821 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 324427 event pairs, 3864 based on Foata normal form. 0/26330 useless extension candidates. Maximal degree in co-relation 46670. Up to 9066 conditions per place. [2024-11-22 18:00:04,583 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 70 selfloop transitions, 5 changer transitions 0/689 dead transitions. [2024-11-22 18:00:04,583 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 694 places, 689 transitions, 1661 flow [2024-11-22 18:00:04,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:00:04,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:00:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4264 transitions. [2024-11-22 18:00:04,586 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8341158059467919 [2024-11-22 18:00:04,586 INFO L175 Difference]: Start difference. First operand has 690 places, 690 transitions, 1513 flow. Second operand 6 states and 4264 transitions. [2024-11-22 18:00:04,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 694 places, 689 transitions, 1661 flow [2024-11-22 18:00:04,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 692 places, 689 transitions, 1654 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:04,597 INFO L231 Difference]: Finished difference. Result has 692 places, 689 transitions, 1514 flow [2024-11-22 18:00:04,597 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1514, PETRI_PLACES=692, PETRI_TRANSITIONS=689} [2024-11-22 18:00:04,598 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -106 predicate places. [2024-11-22 18:00:04,598 INFO L471 AbstractCegarLoop]: Abstraction has has 692 places, 689 transitions, 1514 flow [2024-11-22 18:00:04,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 700.6666666666666) internal successors, (4204), 6 states have internal predecessors, (4204), 0 states have call successors, (0), 0 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-22 18:00:04,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:04,599 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:04,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-22 18:00:04,599 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 18:00:04,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:04,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1950555769, now seen corresponding path program 1 times [2024-11-22 18:00:04,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:04,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449124165] [2024-11-22 18:00:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:04,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:04,699 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-22 18:00:04,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:04,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449124165] [2024-11-22 18:00:04,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449124165] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:04,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:04,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:04,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082419435] [2024-11-22 18:00:04,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:04,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:04,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:04,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:04,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:04,719 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 852 [2024-11-22 18:00:04,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 692 places, 689 transitions, 1514 flow. Second operand has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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-22 18:00:04,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:04,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 852 [2024-11-22 18:00:04,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:09,937 INFO L124 PetriNetUnfolderBase]: 1841/19498 cut-off events. [2024-11-22 18:00:09,937 INFO L125 PetriNetUnfolderBase]: For 2966/2970 co-relation queries the response was YES. [2024-11-22 18:00:10,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24420 conditions, 19498 events. 1841/19498 cut-off events. For 2966/2970 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 212916 event pairs, 212 based on Foata normal form. 0/17447 useless extension candidates. Maximal degree in co-relation 24297. Up to 1988 conditions per place. [2024-11-22 18:00:10,068 INFO L140 encePairwiseOnDemand]: 847/852 looper letters, 33 selfloop transitions, 2 changer transitions 0/698 dead transitions. [2024-11-22 18:00:10,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 698 transitions, 1630 flow [2024-11-22 18:00:10,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2279 transitions. [2024-11-22 18:00:10,070 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8916275430359938 [2024-11-22 18:00:10,070 INFO L175 Difference]: Start difference. First operand has 692 places, 689 transitions, 1514 flow. Second operand 3 states and 2279 transitions. [2024-11-22 18:00:10,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 698 transitions, 1630 flow [2024-11-22 18:00:10,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 698 transitions, 1620 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 18:00:10,079 INFO L231 Difference]: Finished difference. Result has 687 places, 688 transitions, 1514 flow [2024-11-22 18:00:10,080 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1498, PETRI_DIFFERENCE_MINUEND_PLACES=684, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=686, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=684, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1514, PETRI_PLACES=687, PETRI_TRANSITIONS=688} [2024-11-22 18:00:10,081 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -111 predicate places. [2024-11-22 18:00:10,081 INFO L471 AbstractCegarLoop]: Abstraction has has 687 places, 688 transitions, 1514 flow [2024-11-22 18:00:10,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 752.0) internal successors, (2256), 3 states have internal predecessors, (2256), 0 states have call successors, (0), 0 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-22 18:00:10,082 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:10,082 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:10,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-22 18:00:10,082 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 18:00:10,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:10,083 INFO L85 PathProgramCache]: Analyzing trace with hash -404576758, now seen corresponding path program 1 times [2024-11-22 18:00:10,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:10,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499151147] [2024-11-22 18:00:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:10,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:10,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:11,056 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:00:11,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:11,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499151147] [2024-11-22 18:00:11,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499151147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:11,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:11,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:00:11,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111594999] [2024-11-22 18:00:11,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:11,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:00:11,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:11,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:00:11,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:00:11,575 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 852 [2024-11-22 18:00:11,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 687 places, 688 transitions, 1514 flow. Second operand has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 0 states have call successors, (0), 0 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-22 18:00:11,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:11,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 852 [2024-11-22 18:00:11,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:13,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, 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_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, 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_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] 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][558], [Black: 894#true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 594#L82true, 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(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: 937#(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: 912#true, 957#true, 759#L95-1true, 90#L57true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-22 18:00:13,527 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2024-11-22 18:00:13,527 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2024-11-22 18:00:13,527 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-22 18:00:13,527 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-22 18:00:13,535 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, 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_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, 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_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] 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][558], [Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(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: 937#(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: 912#true, 957#true, 90#L57true, 759#L95-1true, 872#(= |#race~n_update~0| 0), 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-22 18:00:13,535 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2024-11-22 18:00:13,535 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2024-11-22 18:00:13,535 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2024-11-22 18:00:13,535 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-22 18:00:13,802 INFO L124 PetriNetUnfolderBase]: 678/8521 cut-off events. [2024-11-22 18:00:13,802 INFO L125 PetriNetUnfolderBase]: For 1683/2108 co-relation queries the response was YES. [2024-11-22 18:00:13,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10729 conditions, 8521 events. 678/8521 cut-off events. For 1683/2108 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 70643 event pairs, 114 based on Foata normal form. 53/7658 useless extension candidates. Maximal degree in co-relation 10603. Up to 464 conditions per place. [2024-11-22 18:00:13,934 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 79 selfloop transitions, 5 changer transitions 0/723 dead transitions. [2024-11-22 18:00:13,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 723 transitions, 1896 flow [2024-11-22 18:00:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:00:13,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:00:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4430 transitions. [2024-11-22 18:00:13,938 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8665884194053208 [2024-11-22 18:00:13,938 INFO L175 Difference]: Start difference. First operand has 687 places, 688 transitions, 1514 flow. Second operand 6 states and 4430 transitions. [2024-11-22 18:00:13,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 723 transitions, 1896 flow [2024-11-22 18:00:13,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 691 places, 723 transitions, 1896 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 18:00:13,948 INFO L231 Difference]: Finished difference. Result has 691 places, 687 transitions, 1522 flow [2024-11-22 18:00:13,949 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, 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-22 18:00:13,950 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -107 predicate places. [2024-11-22 18:00:13,950 INFO L471 AbstractCegarLoop]: Abstraction has has 691 places, 687 transitions, 1522 flow [2024-11-22 18:00:13,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.5) internal successors, (4383), 6 states have internal predecessors, (4383), 0 states have call successors, (0), 0 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-22 18:00:13,951 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:13,951 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:13,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-22 18:00:13,951 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 18:00:13,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:13,952 INFO L85 PathProgramCache]: Analyzing trace with hash 735151533, now seen corresponding path program 1 times [2024-11-22 18:00:13,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:13,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603972232] [2024-11-22 18:00:13,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:13,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:14,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-22 18:00:14,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:14,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603972232] [2024-11-22 18:00:14,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603972232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:14,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:14,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:00:14,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442712731] [2024-11-22 18:00:14,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:14,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:00:14,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:00:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:00:14,970 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 716 out of 852 [2024-11-22 18:00:14,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 691 places, 687 transitions, 1522 flow. Second operand has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 0 states have call successors, (0), 0 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-22 18:00:14,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:14,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 716 of 852 [2024-11-22 18:00:14,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:19,108 INFO L124 PetriNetUnfolderBase]: 3560/18525 cut-off events. [2024-11-22 18:00:19,108 INFO L125 PetriNetUnfolderBase]: For 7268/7293 co-relation queries the response was YES. [2024-11-22 18:00:19,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29098 conditions, 18525 events. 3560/18525 cut-off events. For 7268/7293 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 187736 event pairs, 147 based on Foata normal form. 0/17074 useless extension candidates. Maximal degree in co-relation 28971. Up to 3586 conditions per place. [2024-11-22 18:00:19,330 INFO L140 encePairwiseOnDemand]: 844/852 looper letters, 101 selfloop transitions, 5 changer transitions 0/732 dead transitions. [2024-11-22 18:00:19,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 693 places, 732 transitions, 1980 flow [2024-11-22 18:00:19,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:00:19,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:00:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4378 transitions. [2024-11-22 18:00:19,333 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8564162754303599 [2024-11-22 18:00:19,333 INFO L175 Difference]: Start difference. First operand has 691 places, 687 transitions, 1522 flow. Second operand 6 states and 4378 transitions. [2024-11-22 18:00:19,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 693 places, 732 transitions, 1980 flow [2024-11-22 18:00:19,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 688 places, 732 transitions, 1970 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 18:00:19,347 INFO L231 Difference]: Finished difference. Result has 688 places, 684 transitions, 1516 flow [2024-11-22 18:00:19,348 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1506, PETRI_DIFFERENCE_MINUEND_PLACES=683, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1516, PETRI_PLACES=688, PETRI_TRANSITIONS=684} [2024-11-22 18:00:19,349 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -110 predicate places. [2024-11-22 18:00:19,349 INFO L471 AbstractCegarLoop]: Abstraction has has 688 places, 684 transitions, 1516 flow [2024-11-22 18:00:19,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 718.0) internal successors, (4308), 6 states have internal predecessors, (4308), 0 states have call successors, (0), 0 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-22 18:00:19,350 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:19,350 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:19,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-22 18:00:19,350 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err24ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 18:00:19,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1346346125, now seen corresponding path program 1 times [2024-11-22 18:00:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:19,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83585668] [2024-11-22 18:00:19,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:19,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:19,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:00:19,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:19,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83585668] [2024-11-22 18:00:19,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83585668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:19,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:19,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:19,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561832386] [2024-11-22 18:00:19,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:19,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:19,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:19,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:19,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:19,465 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 852 [2024-11-22 18:00:19,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 688 places, 684 transitions, 1516 flow. Second operand has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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-22 18:00:19,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:19,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 852 [2024-11-22 18:00:19,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:21,409 INFO L124 PetriNetUnfolderBase]: 817/8647 cut-off events. [2024-11-22 18:00:21,409 INFO L125 PetriNetUnfolderBase]: For 2038/2412 co-relation queries the response was YES. [2024-11-22 18:00:21,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11463 conditions, 8647 events. 817/8647 cut-off events. For 2038/2412 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 71986 event pairs, 270 based on Foata normal form. 14/7820 useless extension candidates. Maximal degree in co-relation 11337. Up to 789 conditions per place. [2024-11-22 18:00:21,539 INFO L140 encePairwiseOnDemand]: 849/852 looper letters, 35 selfloop transitions, 2 changer transitions 0/692 dead transitions. [2024-11-22 18:00:21,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 689 places, 692 transitions, 1642 flow [2024-11-22 18:00:21,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:00:21,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 18:00:21,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2271 transitions. [2024-11-22 18:00:21,542 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8884976525821596 [2024-11-22 18:00:21,542 INFO L175 Difference]: Start difference. First operand has 688 places, 684 transitions, 1516 flow. Second operand 3 states and 2271 transitions. [2024-11-22 18:00:21,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 689 places, 692 transitions, 1642 flow [2024-11-22 18:00:21,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 692 transitions, 1632 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 18:00:21,554 INFO L231 Difference]: Finished difference. Result has 684 places, 683 transitions, 1508 flow [2024-11-22 18:00:21,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1504, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1508, PETRI_PLACES=684, PETRI_TRANSITIONS=683} [2024-11-22 18:00:21,556 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -114 predicate places. [2024-11-22 18:00:21,556 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 683 transitions, 1508 flow [2024-11-22 18:00:21,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 751.3333333333334) internal successors, (2254), 3 states have internal predecessors, (2254), 0 states have call successors, (0), 0 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-22 18:00:21,557 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:21,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:21,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-22 18:00:21,558 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 18:00:21,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash -592723375, now seen corresponding path program 1 times [2024-11-22 18:00:21,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:21,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457950359] [2024-11-22 18:00:21,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:21,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:22,168 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-22 18:00:22,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:22,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457950359] [2024-11-22 18:00:22,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457950359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:22,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:22,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:00:22,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763879136] [2024-11-22 18:00:22,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:22,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:00:22,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:22,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:00:22,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:00:22,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 728 out of 852 [2024-11-22 18:00:22,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 683 transitions, 1508 flow. Second operand has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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-22 18:00:22,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:22,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 728 of 852 [2024-11-22 18:00:22,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:25,734 INFO L124 PetriNetUnfolderBase]: 1569/10901 cut-off events. [2024-11-22 18:00:25,735 INFO L125 PetriNetUnfolderBase]: For 3362/3601 co-relation queries the response was YES. [2024-11-22 18:00:25,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15582 conditions, 10901 events. 1569/10901 cut-off events. For 3362/3601 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 96417 event pairs, 192 based on Foata normal form. 1/9982 useless extension candidates. Maximal degree in co-relation 15455. Up to 682 conditions per place. [2024-11-22 18:00:25,925 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 87 selfloop transitions, 5 changer transitions 0/726 dead transitions. [2024-11-22 18:00:25,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 688 places, 726 transitions, 1902 flow [2024-11-22 18:00:25,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:00:25,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:00:25,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4438 transitions. [2024-11-22 18:00:25,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8681533646322379 [2024-11-22 18:00:25,929 INFO L175 Difference]: Start difference. First operand has 684 places, 683 transitions, 1508 flow. Second operand 6 states and 4438 transitions. [2024-11-22 18:00:25,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 688 places, 726 transitions, 1902 flow [2024-11-22 18:00:25,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 686 places, 726 transitions, 1898 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 18:00:25,944 INFO L231 Difference]: Finished difference. Result has 686 places, 682 transitions, 1512 flow [2024-11-22 18:00:25,945 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1502, PETRI_DIFFERENCE_MINUEND_PLACES=681, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=677, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=686, PETRI_TRANSITIONS=682} [2024-11-22 18:00:25,946 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -112 predicate places. [2024-11-22 18:00:25,946 INFO L471 AbstractCegarLoop]: Abstraction has has 686 places, 682 transitions, 1512 flow [2024-11-22 18:00:25,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.0) internal successors, (4380), 6 states have internal predecessors, (4380), 0 states have call successors, (0), 0 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-22 18:00:25,947 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:25,947 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:00:25,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-22 18:00:25,947 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread3Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 18:00:25,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:25,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1013540003, now seen corresponding path program 1 times [2024-11-22 18:00:25,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:25,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119262628] [2024-11-22 18:00:25,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:25,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:25,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:26,619 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-22 18:00:26,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:26,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119262628] [2024-11-22 18:00:26,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119262628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:26,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:26,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 18:00:26,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103233657] [2024-11-22 18:00:26,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:26,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:00:26,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:26,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:00:26,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:00:26,971 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 729 out of 852 [2024-11-22 18:00:26,973 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 686 places, 682 transitions, 1512 flow. Second operand has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 0 states have call successors, (0), 0 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-22 18:00:26,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:26,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 729 of 852 [2024-11-22 18:00:26,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 18:00:30,629 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, 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_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, 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_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] 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][535], [Black: 894#true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), 594#L82true, Black: 931#(<= ~n_produce~0 0), Black: 939#(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: 937#(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: 912#true, 978#true, 759#L95-1true, 90#L57true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-22 18:00:30,629 INFO L294 olderBase$Statistics]: this new event has 519 ancestors and is cut-off event [2024-11-22 18:00:30,629 INFO L297 olderBase$Statistics]: existing Event has 471 ancestors and is cut-off event [2024-11-22 18:00:30,629 INFO L297 olderBase$Statistics]: existing Event has 519 ancestors and is cut-off event [2024-11-22 18:00:30,629 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-11-22 18:00:30,644 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, 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_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, 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_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] 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][535], [Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 837#(= |#race~state12~0| 0), Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(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: 937#(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: 912#true, 978#true, 759#L95-1true, 90#L57true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-22 18:00:30,645 INFO L294 olderBase$Statistics]: this new event has 520 ancestors and is cut-off event [2024-11-22 18:00:30,645 INFO L297 olderBase$Statistics]: existing Event has 389 ancestors and is cut-off event [2024-11-22 18:00:30,645 INFO L297 olderBase$Statistics]: existing Event has 520 ancestors and is cut-off event [2024-11-22 18:00:30,645 INFO L297 olderBase$Statistics]: existing Event has 472 ancestors and is cut-off event [2024-11-22 18:00:30,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2972] L52-->L57: Formula: (let ((.cse13 (* v_~front1~0_785 4)) (.cse14 (* v_~size1~0_505 4)) (.cse15 (* v_~state11~0_193 4))) (let ((.cse2 (not |v_thread1_#t~short2#1_386|)) (.cse1 (not |v_thread1_#t~short1#1_344|)) (.cse0 (+ v_~front1~0_785 v_~size1~0_505)) (.cse5 (+ .cse15 v_~produce~0.offset_113 1)) (.cse6 (+ 2 .cse15 v_~produce~0.offset_113)) (.cse11 (+ 3 .cse15 v_~produce~0.offset_113)) (.cse7 (+ .cse13 .cse14 v_~queue1~0.offset_453)) (.cse4 (select |v_#race_1773| v_~produce~0.base_113)) (.cse8 (+ .cse15 v_~produce~0.offset_113))) (and (or (and (< .cse0 0) .cse1) (and |v_thread1_#t~short1#1_344| (<= 0 .cse0))) (or (and (< v_~state11~0_193 0) .cse2) (and (<= 0 v_~state11~0_193) |v_thread1_#t~short2#1_386|)) (let ((.cse3 (= |v_#race~state11~0_447| 0))) (or (and (= |v_#race~n_produce~0_229| 0) (or (and (< v_~state11~0_193 v_~n_produce~0_66) |v_thread1_#t~short2#1_385|) (and (<= v_~n_produce~0_66 v_~state11~0_193) (not |v_thread1_#t~short2#1_385|))) .cse3 |v_thread1_#t~short2#1_386|) (and .cse3 (= |v_thread1_#t~short2#1_386| |v_thread1_#t~short2#1_385|) (= |v_#race~n_produce~0_229| |v_#race~n_produce~0_230|) .cse2))) (= |v_#race~front1~0_1606| 0) (not (= (ite |v_thread1_#t~short1#1_343| 1 0) 0)) (= (select .cse4 .cse5) 0) (= (select .cse4 .cse6) 0) (not (= (ite (= (select (select |v_#memory_int_449| v_~queue1~0.base_453) .cse7) (select (select |v_#memory_int_449| v_~produce~0.base_113) .cse8)) 1 0) 0)) (= |v_#race~state11~0_437| 0) (not (= (ite |v_thread1_#t~short2#1_385| 1 0) 0)) (let ((.cse9 (= |v_#race~front1~0_1640| 0)) (.cse10 (= |v_#race~size1~0_827| 0))) (or (and (= |v_thread1_#t~short1#1_343| |v_thread1_#t~short1#1_344|) (= |v_#race~n_queue~0_596| |v_#race~n_queue~0_595|) .cse9 .cse1 .cse10) (and (= |v_#race~n_queue~0_595| 0) |v_thread1_#t~short1#1_344| .cse9 .cse10 (or (and (not |v_thread1_#t~short1#1_343|) (<= v_~n_queue~0_174 .cse0)) (and |v_thread1_#t~short1#1_343| (< .cse0 v_~n_queue~0_174)))))) (= |v_#race~produce~0_172| 0) (= v_~size1~0_504 (+ v_~size1~0_505 1)) (= (select .cse4 .cse11) 0) (= |v_#race~queue1~0_976| 0) (= (let ((.cse12 (store |v_#race_1774| v_~queue1~0.base_453 (store (store (store (store (select |v_#race_1774| v_~queue1~0.base_453) .cse7 0) (+ .cse13 .cse14 v_~queue1~0.offset_453 1) 0) (+ 2 .cse13 .cse14 v_~queue1~0.offset_453) 0) (+ 3 .cse13 .cse14 v_~queue1~0.offset_453) 0)))) (store .cse12 v_~produce~0.base_113 (store (store (store (store (select .cse12 v_~produce~0.base_113) .cse8 0) .cse5 0) .cse6 0) .cse11 0))) |v_#race_1773|) (= (select .cse4 .cse8) 0)))) InVars {#race=|v_#race_1774|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_505, ~produce~0.base=v_~produce~0.base_113, ~queue1~0.base=v_~queue1~0.base_453, #race~n_queue~0=|v_#race~n_queue~0_596|, ~n_queue~0=v_~n_queue~0_174, #race~n_produce~0=|v_#race~n_produce~0_230|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~front1~0=v_~front1~0_785, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453} OutVars{#race~produce~0=|v_#race~produce~0_172|, #race~state11~0=|v_#race~state11~0_437|, thread1Thread1of1ForFork1_#t~short2#1=|v_thread1Thread1of1ForFork1_#t~short2#1_23|, ~produce~0.base=v_~produce~0.base_113, #race~size1~0=|v_#race~size1~0_813|, thread1Thread1of1ForFork1_#t~short1#1=|v_thread1Thread1of1ForFork1_#t~short1#1_31|, ~queue1~0.base=v_~queue1~0.base_453, #race~front1~0=|v_#race~front1~0_1606|, #race~n_queue~0=|v_#race~n_queue~0_595|, ~n_queue~0=v_~n_queue~0_174, ~front1~0=v_~front1~0_785, 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_1773|, thread1Thread1of1ForFork1_#t~mem4#1=|v_thread1Thread1of1ForFork1_#t~mem4#1_7|, ~state11~0=v_~state11~0_193, ~size1~0=v_~size1~0_504, 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_229|, #memory_int=|v_#memory_int_449|, ~n_produce~0=v_~n_produce~0_66, ~produce~0.offset=v_~produce~0.offset_113, ~queue1~0.offset=v_~queue1~0.offset_453, #race~queue1~0=|v_#race~queue1~0_976|} AuxVars[|v_thread1_#t~short2#1_386|, |v_thread1_#t~short2#1_385|, |v_#race~size1~0_827|, |v_thread1_#t~short1#1_343|, |v_thread1_#t~short1#1_344|, |v_#race~front1~0_1640|, |v_#race~state11~0_447|] 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][535], [Black: 894#true, 235#L85true, 955#(= |#race~produce~0| 0), 878#(= |#race~n_queue~0| 0), Black: 898#true, Black: 835#true, Black: 902#true, 896#(= |#race~consume~0| 0), 900#(= |#race~n2~0| 0), 914#(= |#race~update~0| 0), Black: 931#(<= ~n_produce~0 0), Black: 939#(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: 937#(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: 912#true, 978#true, 90#L57true, 759#L95-1true, 872#(= |#race~n_update~0| 0), 972#true, 890#(= |#race~n1~0| 0), Black: 953#true, Black: 922#true, 409#L135-4true, 860#(= |#race~n_produce~0| 0)]) [2024-11-22 18:00:30,773 INFO L294 olderBase$Statistics]: this new event has 530 ancestors and is cut-off event [2024-11-22 18:00:30,773 INFO L297 olderBase$Statistics]: existing Event has 482 ancestors and is cut-off event [2024-11-22 18:00:30,773 INFO L297 olderBase$Statistics]: existing Event has 530 ancestors and is cut-off event [2024-11-22 18:00:30,773 INFO L297 olderBase$Statistics]: existing Event has 431 ancestors and is cut-off event [2024-11-22 18:00:30,956 INFO L124 PetriNetUnfolderBase]: 2318/17388 cut-off events. [2024-11-22 18:00:30,956 INFO L125 PetriNetUnfolderBase]: For 4375/4526 co-relation queries the response was YES. [2024-11-22 18:00:31,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24187 conditions, 17388 events. 2318/17388 cut-off events. For 4375/4526 co-relation queries the response was YES. Maximal size of possible extension queue 167. Compared 180132 event pairs, 496 based on Foata normal form. 1/15828 useless extension candidates. Maximal degree in co-relation 24063. Up to 1506 conditions per place. [2024-11-22 18:00:31,141 INFO L140 encePairwiseOnDemand]: 846/852 looper letters, 86 selfloop transitions, 5 changer transitions 0/725 dead transitions. [2024-11-22 18:00:31,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 690 places, 725 transitions, 1904 flow [2024-11-22 18:00:31,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:00:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 18:00:31,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4443 transitions. [2024-11-22 18:00:31,144 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.869131455399061 [2024-11-22 18:00:31,144 INFO L175 Difference]: Start difference. First operand has 686 places, 682 transitions, 1512 flow. Second operand 6 states and 4443 transitions. [2024-11-22 18:00:31,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 690 places, 725 transitions, 1904 flow [2024-11-22 18:00:31,153 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 685 places, 725 transitions, 1894 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-22 18:00:31,160 INFO L231 Difference]: Finished difference. Result has 685 places, 681 transitions, 1510 flow [2024-11-22 18:00:31,161 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=852, PETRI_DIFFERENCE_MINUEND_FLOW=1500, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=676, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1510, PETRI_PLACES=685, PETRI_TRANSITIONS=681} [2024-11-22 18:00:31,162 INFO L277 CegarLoopForPetriNet]: 798 programPoint places, -113 predicate places. [2024-11-22 18:00:31,162 INFO L471 AbstractCegarLoop]: Abstraction has has 685 places, 681 transitions, 1510 flow [2024-11-22 18:00:31,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 730.6666666666666) internal successors, (4384), 6 states have internal predecessors, (4384), 0 states have call successors, (0), 0 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-22 18:00:31,163 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 18:00:31,163 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-22 18:00:31,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-22 18:00:31,164 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err21ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 230 more)] === [2024-11-22 18:00:31,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:00:31,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1679684832, now seen corresponding path program 1 times [2024-11-22 18:00:31,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:00:31,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525357517] [2024-11-22 18:00:31,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:00:31,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:00:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:00:31,242 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-22 18:00:31,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:00:31,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525357517] [2024-11-22 18:00:31,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525357517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:00:31,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:00:31,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:00:31,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144058229] [2024-11-22 18:00:31,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:00:31,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:00:31,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:00:31,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:00:31,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:00:31,268 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 750 out of 852 [2024-11-22 18:00:31,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 685 places, 681 transitions, 1510 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-22 18:00:31,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 18:00:31,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 750 of 852 [2024-11-22 18:00:31,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand