./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-word-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-subst.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 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:37:33,997 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:37:34,089 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:37:34,097 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:37:34,097 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:37:34,130 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:37:34,131 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:37:34,131 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:37:34,132 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:37:34,132 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:37:34,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:37:34,133 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:37:34,134 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:37:34,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:37:34,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:37:34,134 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:37:34,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:37:34,135 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:37:34,135 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:37:34,136 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:37:34,136 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:37:34,136 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:37:34,137 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:37:34,137 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:37:34,137 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:37:34,138 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:37:34,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:37:34,138 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:37:34,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:37:34,139 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:37:34,139 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:37:34,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:34,144 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:37:34,144 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:37:34,144 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:37:34,144 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:37:34,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:37:34,145 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:37:34,145 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:37:34,145 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:37:34,145 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:37:34,146 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 -> 1c6ecf58df9dd6f4f380af0d7ef563f293bde5430d47e04b9ba5ac44168fc198 [2024-11-10 14:37:34,376 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:37:34,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:37:34,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:37:34,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:37:34,409 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:37:34,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-11-10 14:37:35,862 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:37:36,077 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:37:36,077 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-subst.wvr.c [2024-11-10 14:37:36,085 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd95d92b/4b1deaebe18f438992c3cf9176e1f13e/FLAG7a96a93bc [2024-11-10 14:37:36,097 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6bd95d92b/4b1deaebe18f438992c3cf9176e1f13e [2024-11-10 14:37:36,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:37:36,103 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:37:36,104 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:36,104 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:37:36,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:37:36,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f81bbb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36, skipping insertion in model container [2024-11-10 14:37:36,112 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,134 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:37:36,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:36,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:37:36,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:37:36,490 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:37:36,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36 WrapperNode [2024-11-10 14:37:36,490 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:37:36,491 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:36,491 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:37:36,491 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:37:36,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,543 INFO L138 Inliner]: procedures = 24, calls = 31, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 245 [2024-11-10 14:37:36,543 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:37:36,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:37:36,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:37:36,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:37:36,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,557 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,592 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,603 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:37:36,613 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:37:36,613 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:37:36,613 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:37:36,614 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (1/1) ... [2024-11-10 14:37:36,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:37:36,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:37:36,668 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-10 14:37:36,675 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-10 14:37:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:37:36,723 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-10 14:37:36,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-10 14:37:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-10 14:37:36,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-10 14:37:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-10 14:37:36,724 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-10 14:37:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:37:36,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-10 14:37:36,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 14:37:36,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:37:36,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:37:36,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-10 14:37:36,727 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:37:36,899 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:37:36,901 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:37:37,688 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:37:37,689 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:37:37,725 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:37:37,725 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:37:37,725 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:37 BoogieIcfgContainer [2024-11-10 14:37:37,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:37:37,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:37:37,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:37:37,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:37:37,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:37:36" (1/3) ... [2024-11-10 14:37:37,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1887c6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:37, skipping insertion in model container [2024-11-10 14:37:37,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:37:36" (2/3) ... [2024-11-10 14:37:37,733 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1887c6cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:37:37, skipping insertion in model container [2024-11-10 14:37:37,733 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:37:37" (3/3) ... [2024-11-10 14:37:37,734 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-word-subst.wvr.c [2024-11-10 14:37:37,751 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:37:37,751 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2024-11-10 14:37:37,751 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:37:37,921 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-10 14:37:37,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 635 places, 658 transitions, 1337 flow [2024-11-10 14:37:38,307 INFO L124 PetriNetUnfolderBase]: 33/655 cut-off events. [2024-11-10 14:37:38,308 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:37:38,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 668 conditions, 655 events. 33/655 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1757 event pairs, 0 based on Foata normal form. 0/545 useless extension candidates. Maximal degree in co-relation 496. Up to 3 conditions per place. [2024-11-10 14:37:38,328 INFO L82 GeneralOperation]: Start removeDead. Operand has 635 places, 658 transitions, 1337 flow [2024-11-10 14:37:38,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 614 places, 635 transitions, 1288 flow [2024-11-10 14:37:38,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:37:38,361 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;@63e67756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:37:38,361 INFO L334 AbstractCegarLoop]: Starting to check reachability of 137 error locations. [2024-11-10 14:37:38,365 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:37:38,366 INFO L124 PetriNetUnfolderBase]: 0/29 cut-off events. [2024-11-10 14:37:38,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:37:38,366 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:38,367 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] [2024-11-10 14:37:38,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:38,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:38,374 INFO L85 PathProgramCache]: Analyzing trace with hash 734205952, now seen corresponding path program 1 times [2024-11-10 14:37:38,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:38,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404487030] [2024-11-10 14:37:38,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:38,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:38,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:38,605 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-10 14:37:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404487030] [2024-11-10 14:37:38,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404487030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:38,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:38,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725359774] [2024-11-10 14:37:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:38,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:38,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:38,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:38,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:38,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 658 [2024-11-10 14:37:38,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 635 transitions, 1288 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:38,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:38,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 658 [2024-11-10 14:37:38,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:39,088 INFO L124 PetriNetUnfolderBase]: 78/1521 cut-off events. [2024-11-10 14:37:39,088 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2024-11-10 14:37:39,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1608 conditions, 1521 events. 78/1521 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 9307 event pairs, 20 based on Foata normal form. 30/1252 useless extension candidates. Maximal degree in co-relation 1200. Up to 50 conditions per place. [2024-11-10 14:37:39,123 INFO L140 encePairwiseOnDemand]: 642/658 looper letters, 13 selfloop transitions, 2 changer transitions 7/621 dead transitions. [2024-11-10 14:37:39,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 615 places, 621 transitions, 1290 flow [2024-11-10 14:37:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1907 transitions. [2024-11-10 14:37:39,145 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9660587639311043 [2024-11-10 14:37:39,147 INFO L175 Difference]: Start difference. First operand has 614 places, 635 transitions, 1288 flow. Second operand 3 states and 1907 transitions. [2024-11-10 14:37:39,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 615 places, 621 transitions, 1290 flow [2024-11-10 14:37:39,157 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 621 transitions, 1278 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:37:39,170 INFO L231 Difference]: Finished difference. Result has 609 places, 614 transitions, 1238 flow [2024-11-10 14:37:39,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=619, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1238, PETRI_PLACES=609, PETRI_TRANSITIONS=614} [2024-11-10 14:37:39,177 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -5 predicate places. [2024-11-10 14:37:39,177 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 614 transitions, 1238 flow [2024-11-10 14:37:39,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:39,179 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:39,180 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] [2024-11-10 14:37:39,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:37:39,180 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:39,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash -514479634, now seen corresponding path program 1 times [2024-11-10 14:37:39,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:39,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106417713] [2024-11-10 14:37:39,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:39,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:39,255 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-10 14:37:39,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:39,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106417713] [2024-11-10 14:37:39,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106417713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:39,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:39,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:39,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832714320] [2024-11-10 14:37:39,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:39,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:39,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:39,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:39,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:39,303 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 658 [2024-11-10 14:37:39,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 614 transitions, 1238 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:39,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:39,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 658 [2024-11-10 14:37:39,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:39,573 INFO L124 PetriNetUnfolderBase]: 50/1057 cut-off events. [2024-11-10 14:37:39,574 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:37:39,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1108 conditions, 1057 events. 50/1057 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5218 event pairs, 12 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 1071. Up to 38 conditions per place. [2024-11-10 14:37:39,607 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 13 selfloop transitions, 2 changer transitions 0/613 dead transitions. [2024-11-10 14:37:39,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 603 places, 613 transitions, 1266 flow [2024-11-10 14:37:39,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-10 14:37:39,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594731509625126 [2024-11-10 14:37:39,612 INFO L175 Difference]: Start difference. First operand has 609 places, 614 transitions, 1238 flow. Second operand 3 states and 1894 transitions. [2024-11-10 14:37:39,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 603 places, 613 transitions, 1266 flow [2024-11-10 14:37:39,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 613 transitions, 1262 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:39,622 INFO L231 Difference]: Finished difference. Result has 601 places, 613 transitions, 1236 flow [2024-11-10 14:37:39,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1232, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1236, PETRI_PLACES=601, PETRI_TRANSITIONS=613} [2024-11-10 14:37:39,624 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -13 predicate places. [2024-11-10 14:37:39,625 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 613 transitions, 1236 flow [2024-11-10 14:37:39,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:39,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:39,627 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] [2024-11-10 14:37:39,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:37:39,627 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:39,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:39,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1033206636, now seen corresponding path program 1 times [2024-11-10 14:37:39,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261260897] [2024-11-10 14:37:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:39,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:39,682 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-10 14:37:39,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:39,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261260897] [2024-11-10 14:37:39,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261260897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:39,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:39,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:39,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843573556] [2024-11-10 14:37:39,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:39,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:39,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:39,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:39,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:39,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 658 [2024-11-10 14:37:39,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 613 transitions, 1236 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:39,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:39,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 658 [2024-11-10 14:37:39,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:40,010 INFO L124 PetriNetUnfolderBase]: 78/1488 cut-off events. [2024-11-10 14:37:40,011 INFO L125 PetriNetUnfolderBase]: For 13/17 co-relation queries the response was YES. [2024-11-10 14:37:40,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1549 conditions, 1488 events. 78/1488 cut-off events. For 13/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 8452 event pairs, 20 based on Foata normal form. 0/1209 useless extension candidates. Maximal degree in co-relation 1504. Up to 50 conditions per place. [2024-11-10 14:37:40,039 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 13 selfloop transitions, 2 changer transitions 0/612 dead transitions. [2024-11-10 14:37:40,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 602 places, 612 transitions, 1264 flow [2024-11-10 14:37:40,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:40,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-10 14:37:40,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594731509625126 [2024-11-10 14:37:40,046 INFO L175 Difference]: Start difference. First operand has 601 places, 613 transitions, 1236 flow. Second operand 3 states and 1894 transitions. [2024-11-10 14:37:40,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 602 places, 612 transitions, 1264 flow [2024-11-10 14:37:40,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 612 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:40,058 INFO L231 Difference]: Finished difference. Result has 600 places, 612 transitions, 1234 flow [2024-11-10 14:37:40,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1230, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1234, PETRI_PLACES=600, PETRI_TRANSITIONS=612} [2024-11-10 14:37:40,060 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -14 predicate places. [2024-11-10 14:37:40,060 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 612 transitions, 1234 flow [2024-11-10 14:37:40,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:40,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:40,062 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] [2024-11-10 14:37:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:37:40,062 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:40,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1890172180, now seen corresponding path program 1 times [2024-11-10 14:37:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286753944] [2024-11-10 14:37:40,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:40,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:40,125 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-10 14:37:40,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:40,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286753944] [2024-11-10 14:37:40,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286753944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:40,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:40,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:40,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690532732] [2024-11-10 14:37:40,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:40,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:40,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:40,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:40,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:40,165 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 658 [2024-11-10 14:37:40,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 612 transitions, 1234 flow. Second operand has 3 states, 3 states have (on average 626.3333333333334) internal successors, (1879), 3 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-10 14:37:40,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:40,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 658 [2024-11-10 14:37:40,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:40,474 INFO L124 PetriNetUnfolderBase]: 88/1789 cut-off events. [2024-11-10 14:37:40,474 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:37:40,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1859 conditions, 1789 events. 88/1789 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 11599 event pairs, 20 based on Foata normal form. 0/1451 useless extension candidates. Maximal degree in co-relation 1806. Up to 51 conditions per place. [2024-11-10 14:37:40,507 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 14 selfloop transitions, 2 changer transitions 0/611 dead transitions. [2024-11-10 14:37:40,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 611 transitions, 1264 flow [2024-11-10 14:37:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-10 14:37:40,512 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9584599797365755 [2024-11-10 14:37:40,512 INFO L175 Difference]: Start difference. First operand has 600 places, 612 transitions, 1234 flow. Second operand 3 states and 1892 transitions. [2024-11-10 14:37:40,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 611 transitions, 1264 flow [2024-11-10 14:37:40,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 611 transitions, 1260 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:40,522 INFO L231 Difference]: Finished difference. Result has 599 places, 611 transitions, 1232 flow [2024-11-10 14:37:40,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1228, PETRI_DIFFERENCE_MINUEND_PLACES=597, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=611, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=609, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1232, PETRI_PLACES=599, PETRI_TRANSITIONS=611} [2024-11-10 14:37:40,524 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -15 predicate places. [2024-11-10 14:37:40,524 INFO L471 AbstractCegarLoop]: Abstraction has has 599 places, 611 transitions, 1232 flow [2024-11-10 14:37:40,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.3333333333334) internal successors, (1879), 3 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-10 14:37:40,526 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:40,526 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:40,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:37:40,526 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:40,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:40,527 INFO L85 PathProgramCache]: Analyzing trace with hash -3490635, now seen corresponding path program 1 times [2024-11-10 14:37:40,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378786050] [2024-11-10 14:37:40,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:40,566 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-10 14:37:40,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:40,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378786050] [2024-11-10 14:37:40,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378786050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:40,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:40,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:40,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154425140] [2024-11-10 14:37:40,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:40,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:40,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:40,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:40,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:40,603 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 658 [2024-11-10 14:37:40,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 599 places, 611 transitions, 1232 flow. Second operand has 3 states, 3 states have (on average 626.3333333333334) internal successors, (1879), 3 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-10 14:37:40,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:40,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 658 [2024-11-10 14:37:40,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:40,800 INFO L124 PetriNetUnfolderBase]: 50/1092 cut-off events. [2024-11-10 14:37:40,801 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:37:40,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 1092 events. 50/1092 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5565 event pairs, 12 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 1083. Up to 39 conditions per place. [2024-11-10 14:37:40,825 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 14 selfloop transitions, 2 changer transitions 0/610 dead transitions. [2024-11-10 14:37:40,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 600 places, 610 transitions, 1262 flow [2024-11-10 14:37:40,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:40,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-10 14:37:40,829 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9584599797365755 [2024-11-10 14:37:40,830 INFO L175 Difference]: Start difference. First operand has 599 places, 611 transitions, 1232 flow. Second operand 3 states and 1892 transitions. [2024-11-10 14:37:40,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 600 places, 610 transitions, 1262 flow [2024-11-10 14:37:40,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 610 transitions, 1258 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:40,839 INFO L231 Difference]: Finished difference. Result has 598 places, 610 transitions, 1230 flow [2024-11-10 14:37:40,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1226, PETRI_DIFFERENCE_MINUEND_PLACES=596, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=610, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=608, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1230, PETRI_PLACES=598, PETRI_TRANSITIONS=610} [2024-11-10 14:37:40,842 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -16 predicate places. [2024-11-10 14:37:40,842 INFO L471 AbstractCegarLoop]: Abstraction has has 598 places, 610 transitions, 1230 flow [2024-11-10 14:37:40,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.3333333333334) internal successors, (1879), 3 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-10 14:37:40,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:40,844 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] [2024-11-10 14:37:40,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:37:40,844 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:40,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2128859751, now seen corresponding path program 1 times [2024-11-10 14:37:40,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:40,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17597014] [2024-11-10 14:37:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:40,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:40,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:40,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:40,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:40,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17597014] [2024-11-10 14:37:40,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17597014] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:40,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:40,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:40,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275095719] [2024-11-10 14:37:40,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:40,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:40,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:40,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:40,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:40,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 625 out of 658 [2024-11-10 14:37:40,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 598 places, 610 transitions, 1230 flow. Second operand has 3 states, 3 states have (on average 626.3333333333334) internal successors, (1879), 3 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-10 14:37:40,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:40,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 625 of 658 [2024-11-10 14:37:40,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:41,133 INFO L124 PetriNetUnfolderBase]: 48/869 cut-off events. [2024-11-10 14:37:41,134 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-10 14:37:41,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 931 conditions, 869 events. 48/869 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3760 event pairs, 20 based on Foata normal form. 0/731 useless extension candidates. Maximal degree in co-relation 862. Up to 51 conditions per place. [2024-11-10 14:37:41,151 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 14 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2024-11-10 14:37:41,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 609 transitions, 1260 flow [2024-11-10 14:37:41,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:41,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1892 transitions. [2024-11-10 14:37:41,157 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9584599797365755 [2024-11-10 14:37:41,157 INFO L175 Difference]: Start difference. First operand has 598 places, 610 transitions, 1230 flow. Second operand 3 states and 1892 transitions. [2024-11-10 14:37:41,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 609 transitions, 1260 flow [2024-11-10 14:37:41,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 609 transitions, 1256 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:41,169 INFO L231 Difference]: Finished difference. Result has 597 places, 609 transitions, 1228 flow [2024-11-10 14:37:41,170 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1224, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1228, PETRI_PLACES=597, PETRI_TRANSITIONS=609} [2024-11-10 14:37:41,172 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -17 predicate places. [2024-11-10 14:37:41,173 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 609 transitions, 1228 flow [2024-11-10 14:37:41,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.3333333333334) internal successors, (1879), 3 states have internal predecessors, (1879), 0 states have call successors, (0), 0 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-10 14:37:41,174 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:41,175 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-10 14:37:41,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:37:41,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:41,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:41,176 INFO L85 PathProgramCache]: Analyzing trace with hash 391616478, now seen corresponding path program 1 times [2024-11-10 14:37:41,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:41,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577173707] [2024-11-10 14:37:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:41,253 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-10 14:37:41,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577173707] [2024-11-10 14:37:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577173707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:41,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:41,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257017210] [2024-11-10 14:37:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:41,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:41,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:41,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:41,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:41,282 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 658 [2024-11-10 14:37:41,285 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 609 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 622.0) internal successors, (1866), 3 states have internal predecessors, (1866), 0 states have call successors, (0), 0 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-10 14:37:41,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:41,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 658 [2024-11-10 14:37:41,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:41,717 INFO L124 PetriNetUnfolderBase]: 166/2328 cut-off events. [2024-11-10 14:37:41,717 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2024-11-10 14:37:41,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2517 conditions, 2328 events. 166/2328 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 17896 event pairs, 64 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 2440. Up to 152 conditions per place. [2024-11-10 14:37:41,750 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 16 selfloop transitions, 1 changer transitions 0/604 dead transitions. [2024-11-10 14:37:41,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 604 transitions, 1252 flow [2024-11-10 14:37:41,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:41,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-10 14:37:41,754 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9549138804457954 [2024-11-10 14:37:41,755 INFO L175 Difference]: Start difference. First operand has 597 places, 609 transitions, 1228 flow. Second operand 3 states and 1885 transitions. [2024-11-10 14:37:41,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 604 transitions, 1252 flow [2024-11-10 14:37:41,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 592 places, 604 transitions, 1248 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:41,764 INFO L231 Difference]: Finished difference. Result has 592 places, 604 transitions, 1216 flow [2024-11-10 14:37:41,765 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1214, PETRI_DIFFERENCE_MINUEND_PLACES=590, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1216, PETRI_PLACES=592, PETRI_TRANSITIONS=604} [2024-11-10 14:37:41,765 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -22 predicate places. [2024-11-10 14:37:41,766 INFO L471 AbstractCegarLoop]: Abstraction has has 592 places, 604 transitions, 1216 flow [2024-11-10 14:37:41,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.0) internal successors, (1866), 3 states have internal predecessors, (1866), 0 states have call successors, (0), 0 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-10 14:37:41,767 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:41,767 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] [2024-11-10 14:37:41,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:37:41,767 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:41,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:41,768 INFO L85 PathProgramCache]: Analyzing trace with hash -2111713179, now seen corresponding path program 1 times [2024-11-10 14:37:41,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:41,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267939774] [2024-11-10 14:37:41,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:41,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:42,413 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-10 14:37:42,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:42,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267939774] [2024-11-10 14:37:42,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267939774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:42,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:42,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:37:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967629632] [2024-11-10 14:37:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:42,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:37:42,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:42,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:37:42,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:37:42,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 547 out of 658 [2024-11-10 14:37:42,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 592 places, 604 transitions, 1216 flow. Second operand has 6 states, 6 states have (on average 548.5) internal successors, (3291), 6 states have internal predecessors, (3291), 0 states have call successors, (0), 0 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-10 14:37:42,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:42,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 547 of 658 [2024-11-10 14:37:42,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:51,107 INFO L124 PetriNetUnfolderBase]: 12845/49437 cut-off events. [2024-11-10 14:37:51,108 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2024-11-10 14:37:51,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66918 conditions, 49437 events. 12845/49437 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1114. Compared 651213 event pairs, 10080 based on Foata normal form. 0/41104 useless extension candidates. Maximal degree in co-relation 66842. Up to 17156 conditions per place. [2024-11-10 14:37:51,609 INFO L140 encePairwiseOnDemand]: 640/658 looper letters, 78 selfloop transitions, 15 changer transitions 0/601 dead transitions. [2024-11-10 14:37:51,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 601 transitions, 1396 flow [2024-11-10 14:37:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:37:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:37:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3378 transitions. [2024-11-10 14:37:51,616 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8556231003039514 [2024-11-10 14:37:51,616 INFO L175 Difference]: Start difference. First operand has 592 places, 604 transitions, 1216 flow. Second operand 6 states and 3378 transitions. [2024-11-10 14:37:51,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 601 transitions, 1396 flow [2024-11-10 14:37:51,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 593 places, 601 transitions, 1395 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:51,626 INFO L231 Difference]: Finished difference. Result has 593 places, 601 transitions, 1239 flow [2024-11-10 14:37:51,627 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1239, PETRI_PLACES=593, PETRI_TRANSITIONS=601} [2024-11-10 14:37:51,628 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -21 predicate places. [2024-11-10 14:37:51,628 INFO L471 AbstractCegarLoop]: Abstraction has has 593 places, 601 transitions, 1239 flow [2024-11-10 14:37:51,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 548.5) internal successors, (3291), 6 states have internal predecessors, (3291), 0 states have call successors, (0), 0 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-10 14:37:51,630 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:51,630 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:37:51,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:37:51,631 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:51,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:51,631 INFO L85 PathProgramCache]: Analyzing trace with hash 851620469, now seen corresponding path program 1 times [2024-11-10 14:37:51,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:51,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763775854] [2024-11-10 14:37:51,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:51,686 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-10 14:37:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:51,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763775854] [2024-11-10 14:37:51,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763775854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:51,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:51,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:51,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467697856] [2024-11-10 14:37:51,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:51,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:51,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:51,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:51,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:51,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 658 [2024-11-10 14:37:51,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 593 places, 601 transitions, 1239 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:51,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:51,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 658 [2024-11-10 14:37:51,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:52,154 INFO L124 PetriNetUnfolderBase]: 88/1774 cut-off events. [2024-11-10 14:37:52,155 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:37:52,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1857 conditions, 1774 events. 88/1774 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 10597 event pairs, 20 based on Foata normal form. 0/1449 useless extension candidates. Maximal degree in co-relation 1809. Up to 50 conditions per place. [2024-11-10 14:37:52,185 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 13 selfloop transitions, 2 changer transitions 0/600 dead transitions. [2024-11-10 14:37:52,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 594 places, 600 transitions, 1267 flow [2024-11-10 14:37:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:52,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:52,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-10 14:37:52,190 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594731509625126 [2024-11-10 14:37:52,190 INFO L175 Difference]: Start difference. First operand has 593 places, 601 transitions, 1239 flow. Second operand 3 states and 1894 transitions. [2024-11-10 14:37:52,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 594 places, 600 transitions, 1267 flow [2024-11-10 14:37:52,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 600 transitions, 1237 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:37:52,201 INFO L231 Difference]: Finished difference. Result has 589 places, 600 transitions, 1211 flow [2024-11-10 14:37:52,202 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1207, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1211, PETRI_PLACES=589, PETRI_TRANSITIONS=600} [2024-11-10 14:37:52,203 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -25 predicate places. [2024-11-10 14:37:52,204 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 600 transitions, 1211 flow [2024-11-10 14:37:52,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:52,205 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:52,205 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] [2024-11-10 14:37:52,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:37:52,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash -698151761, now seen corresponding path program 1 times [2024-11-10 14:37:52,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:52,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008026791] [2024-11-10 14:37:52,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:52,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:52,252 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-10 14:37:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:52,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008026791] [2024-11-10 14:37:52,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008026791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:52,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:52,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:52,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601826852] [2024-11-10 14:37:52,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:52,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:52,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:52,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:52,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:52,286 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 658 [2024-11-10 14:37:52,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 600 transitions, 1211 flow. Second operand has 3 states, 3 states have (on average 622.0) internal successors, (1866), 3 states have internal predecessors, (1866), 0 states have call successors, (0), 0 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-10 14:37:52,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:52,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 658 [2024-11-10 14:37:52,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:52,744 INFO L124 PetriNetUnfolderBase]: 112/1701 cut-off events. [2024-11-10 14:37:52,745 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-11-10 14:37:52,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1701 events. 112/1701 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11010 event pairs, 32 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1743. Up to 101 conditions per place. [2024-11-10 14:37:52,783 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 16 selfloop transitions, 1 changer transitions 0/595 dead transitions. [2024-11-10 14:37:52,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 586 places, 595 transitions, 1235 flow [2024-11-10 14:37:52,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:52,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:52,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-10 14:37:52,792 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9549138804457954 [2024-11-10 14:37:52,793 INFO L175 Difference]: Start difference. First operand has 589 places, 600 transitions, 1211 flow. Second operand 3 states and 1885 transitions. [2024-11-10 14:37:52,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 586 places, 595 transitions, 1235 flow [2024-11-10 14:37:52,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 595 transitions, 1231 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:52,811 INFO L231 Difference]: Finished difference. Result has 584 places, 595 transitions, 1199 flow [2024-11-10 14:37:52,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1197, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=595, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=594, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1199, PETRI_PLACES=584, PETRI_TRANSITIONS=595} [2024-11-10 14:37:52,814 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -30 predicate places. [2024-11-10 14:37:52,814 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 595 transitions, 1199 flow [2024-11-10 14:37:52,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.0) internal successors, (1866), 3 states have internal predecessors, (1866), 0 states have call successors, (0), 0 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-10 14:37:52,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:52,817 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-10 14:37:52,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:37:52,817 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:52,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -208347562, now seen corresponding path program 1 times [2024-11-10 14:37:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:52,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251413110] [2024-11-10 14:37:52,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:52,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:52,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:52,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:52,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251413110] [2024-11-10 14:37:52,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251413110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:52,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:52,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:52,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64246187] [2024-11-10 14:37:52,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:52,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:52,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:52,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:52,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:52,902 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 658 [2024-11-10 14:37:52,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 595 transitions, 1199 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:52,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:52,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 658 [2024-11-10 14:37:52,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,114 INFO L124 PetriNetUnfolderBase]: 50/1068 cut-off events. [2024-11-10 14:37:53,115 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2024-11-10 14:37:53,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1119 conditions, 1068 events. 50/1068 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 4859 event pairs, 12 based on Foata normal form. 0/903 useless extension candidates. Maximal degree in co-relation 1042. Up to 38 conditions per place. [2024-11-10 14:37:53,131 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 13 selfloop transitions, 2 changer transitions 0/594 dead transitions. [2024-11-10 14:37:53,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 585 places, 594 transitions, 1227 flow [2024-11-10 14:37:53,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-10 14:37:53,137 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594731509625126 [2024-11-10 14:37:53,137 INFO L175 Difference]: Start difference. First operand has 584 places, 595 transitions, 1199 flow. Second operand 3 states and 1894 transitions. [2024-11-10 14:37:53,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 585 places, 594 transitions, 1227 flow [2024-11-10 14:37:53,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1226 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:53,148 INFO L231 Difference]: Finished difference. Result has 584 places, 594 transitions, 1200 flow [2024-11-10 14:37:53,149 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1196, PETRI_DIFFERENCE_MINUEND_PLACES=582, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=592, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1200, PETRI_PLACES=584, PETRI_TRANSITIONS=594} [2024-11-10 14:37:53,150 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -30 predicate places. [2024-11-10 14:37:53,150 INFO L471 AbstractCegarLoop]: Abstraction has has 584 places, 594 transitions, 1200 flow [2024-11-10 14:37:53,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:53,151 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,151 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-10 14:37:53,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:37:53,152 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1223597060, now seen corresponding path program 1 times [2024-11-10 14:37:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143289199] [2024-11-10 14:37:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,200 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-10 14:37:53,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143289199] [2024-11-10 14:37:53,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143289199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360468081] [2024-11-10 14:37:53,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 621 out of 658 [2024-11-10 14:37:53,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 584 places, 594 transitions, 1200 flow. Second operand has 3 states, 3 states have (on average 622.0) internal successors, (1866), 3 states have internal predecessors, (1866), 0 states have call successors, (0), 0 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-10 14:37:53,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 621 of 658 [2024-11-10 14:37:53,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,550 INFO L124 PetriNetUnfolderBase]: 173/2008 cut-off events. [2024-11-10 14:37:53,550 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2024-11-10 14:37:53,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2193 conditions, 2008 events. 173/2008 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13739 event pairs, 64 based on Foata normal form. 0/1699 useless extension candidates. Maximal degree in co-relation 2116. Up to 170 conditions per place. [2024-11-10 14:37:53,588 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 16 selfloop transitions, 1 changer transitions 0/589 dead transitions. [2024-11-10 14:37:53,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 581 places, 589 transitions, 1224 flow [2024-11-10 14:37:53,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1885 transitions. [2024-11-10 14:37:53,592 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9549138804457954 [2024-11-10 14:37:53,592 INFO L175 Difference]: Start difference. First operand has 584 places, 594 transitions, 1200 flow. Second operand 3 states and 1885 transitions. [2024-11-10 14:37:53,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 581 places, 589 transitions, 1224 flow [2024-11-10 14:37:53,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 589 transitions, 1220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:53,601 INFO L231 Difference]: Finished difference. Result has 579 places, 589 transitions, 1188 flow [2024-11-10 14:37:53,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1186, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=588, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1188, PETRI_PLACES=579, PETRI_TRANSITIONS=589} [2024-11-10 14:37:53,602 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -35 predicate places. [2024-11-10 14:37:53,603 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 589 transitions, 1188 flow [2024-11-10 14:37:53,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 622.0) internal successors, (1866), 3 states have internal predecessors, (1866), 0 states have call successors, (0), 0 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-10 14:37:53,604 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,604 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] [2024-11-10 14:37:53,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:37:53,605 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:53,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1474041242, now seen corresponding path program 1 times [2024-11-10 14:37:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757952197] [2024-11-10 14:37:53,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,652 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-10 14:37:53,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757952197] [2024-11-10 14:37:53,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757952197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046621717] [2024-11-10 14:37:53,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,678 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 626 out of 658 [2024-11-10 14:37:53,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 589 transitions, 1188 flow. Second operand has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:53,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 626 of 658 [2024-11-10 14:37:53,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:53,808 INFO L124 PetriNetUnfolderBase]: 48/840 cut-off events. [2024-11-10 14:37:53,808 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2024-11-10 14:37:53,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 840 events. 48/840 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3205 event pairs, 20 based on Foata normal form. 0/728 useless extension candidates. Maximal degree in co-relation 825. Up to 50 conditions per place. [2024-11-10 14:37:53,826 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 13 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2024-11-10 14:37:53,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 588 transitions, 1216 flow [2024-11-10 14:37:53,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:53,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:53,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1894 transitions. [2024-11-10 14:37:53,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9594731509625126 [2024-11-10 14:37:53,830 INFO L175 Difference]: Start difference. First operand has 579 places, 589 transitions, 1188 flow. Second operand 3 states and 1894 transitions. [2024-11-10 14:37:53,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 588 transitions, 1216 flow [2024-11-10 14:37:53,834 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 579 places, 588 transitions, 1215 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:37:53,839 INFO L231 Difference]: Finished difference. Result has 579 places, 588 transitions, 1189 flow [2024-11-10 14:37:53,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1185, PETRI_DIFFERENCE_MINUEND_PLACES=577, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1189, PETRI_PLACES=579, PETRI_TRANSITIONS=588} [2024-11-10 14:37:53,841 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -35 predicate places. [2024-11-10 14:37:53,841 INFO L471 AbstractCegarLoop]: Abstraction has has 579 places, 588 transitions, 1189 flow [2024-11-10 14:37:53,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 627.3333333333334) internal successors, (1882), 3 states have internal predecessors, (1882), 0 states have call successors, (0), 0 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-10 14:37:53,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:53,843 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] [2024-11-10 14:37:53,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:37:53,843 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:53,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:53,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1148884154, now seen corresponding path program 1 times [2024-11-10 14:37:53,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:53,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878183658] [2024-11-10 14:37:53,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:53,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:53,894 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-10 14:37:53,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:53,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878183658] [2024-11-10 14:37:53,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878183658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:53,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:53,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:53,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981050890] [2024-11-10 14:37:53,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:53,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:53,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:53,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:53,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:53,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 658 [2024-11-10 14:37:53,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 579 places, 588 transitions, 1189 flow. Second operand has 3 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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-10 14:37:53,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:53,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 658 [2024-11-10 14:37:53,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,296 INFO L124 PetriNetUnfolderBase]: 157/2223 cut-off events. [2024-11-10 14:37:54,296 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-10 14:37:54,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2389 conditions, 2223 events. 157/2223 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 16947 event pairs, 53 based on Foata normal form. 0/1872 useless extension candidates. Maximal degree in co-relation 2312. Up to 123 conditions per place. [2024-11-10 14:37:54,338 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 17 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2024-11-10 14:37:54,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 588 transitions, 1229 flow [2024-11-10 14:37:54,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1895 transitions. [2024-11-10 14:37:54,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9599797365754813 [2024-11-10 14:37:54,344 INFO L175 Difference]: Start difference. First operand has 579 places, 588 transitions, 1189 flow. Second operand 3 states and 1895 transitions. [2024-11-10 14:37:54,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 588 transitions, 1229 flow [2024-11-10 14:37:54,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 588 transitions, 1225 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:54,359 INFO L231 Difference]: Finished difference. Result has 576 places, 586 transitions, 1191 flow [2024-11-10 14:37:54,360 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1177, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1191, PETRI_PLACES=576, PETRI_TRANSITIONS=586} [2024-11-10 14:37:54,361 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -38 predicate places. [2024-11-10 14:37:54,361 INFO L471 AbstractCegarLoop]: Abstraction has has 576 places, 586 transitions, 1191 flow [2024-11-10 14:37:54,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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-10 14:37:54,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,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] [2024-11-10 14:37:54,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:37:54,364 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:54,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,364 INFO L85 PathProgramCache]: Analyzing trace with hash 271118171, now seen corresponding path program 1 times [2024-11-10 14:37:54,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121710152] [2024-11-10 14:37:54,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:37:54,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121710152] [2024-11-10 14:37:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121710152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956750045] [2024-11-10 14:37:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,458 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 658 [2024-11-10 14:37:54,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 576 places, 586 transitions, 1191 flow. Second operand has 3 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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-10 14:37:54,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 658 [2024-11-10 14:37:54,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:54,785 INFO L124 PetriNetUnfolderBase]: 106/1723 cut-off events. [2024-11-10 14:37:54,785 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-10 14:37:54,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1833 conditions, 1723 events. 106/1723 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11140 event pairs, 26 based on Foata normal form. 0/1476 useless extension candidates. Maximal degree in co-relation 1756. Up to 80 conditions per place. [2024-11-10 14:37:54,812 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 17 selfloop transitions, 2 changer transitions 0/586 dead transitions. [2024-11-10 14:37:54,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 586 transitions, 1231 flow [2024-11-10 14:37:54,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:54,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1895 transitions. [2024-11-10 14:37:54,817 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9599797365754813 [2024-11-10 14:37:54,817 INFO L175 Difference]: Start difference. First operand has 576 places, 586 transitions, 1191 flow. Second operand 3 states and 1895 transitions. [2024-11-10 14:37:54,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 586 transitions, 1231 flow [2024-11-10 14:37:54,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 586 transitions, 1231 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:54,828 INFO L231 Difference]: Finished difference. Result has 575 places, 584 transitions, 1197 flow [2024-11-10 14:37:54,829 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1183, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=582, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=580, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1197, PETRI_PLACES=575, PETRI_TRANSITIONS=584} [2024-11-10 14:37:54,829 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -39 predicate places. [2024-11-10 14:37:54,830 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 584 transitions, 1197 flow [2024-11-10 14:37:54,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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-10 14:37:54,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:54,831 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] [2024-11-10 14:37:54,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:37:54,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:54,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:54,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1379366598, now seen corresponding path program 1 times [2024-11-10 14:37:54,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:54,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784419630] [2024-11-10 14:37:54,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:54,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:54,890 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-10 14:37:54,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:54,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784419630] [2024-11-10 14:37:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784419630] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:54,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:54,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966931743] [2024-11-10 14:37:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:54,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:54,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:54,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:54,913 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 658 [2024-11-10 14:37:54,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 584 transitions, 1197 flow. Second operand has 3 states, 3 states have (on average 625.6666666666666) internal successors, (1877), 3 states have internal predecessors, (1877), 0 states have call successors, (0), 0 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-10 14:37:54,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:54,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 658 [2024-11-10 14:37:54,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:55,455 INFO L124 PetriNetUnfolderBase]: 218/2616 cut-off events. [2024-11-10 14:37:55,455 INFO L125 PetriNetUnfolderBase]: For 32/36 co-relation queries the response was YES. [2024-11-10 14:37:55,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 2616 events. 218/2616 cut-off events. For 32/36 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 21001 event pairs, 77 based on Foata normal form. 1/2257 useless extension candidates. Maximal degree in co-relation 2798. Up to 207 conditions per place. [2024-11-10 14:37:55,504 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 17 selfloop transitions, 2 changer transitions 0/584 dead transitions. [2024-11-10 14:37:55,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 573 places, 584 transitions, 1237 flow [2024-11-10 14:37:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:55,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:55,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1895 transitions. [2024-11-10 14:37:55,510 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9599797365754813 [2024-11-10 14:37:55,510 INFO L175 Difference]: Start difference. First operand has 575 places, 584 transitions, 1197 flow. Second operand 3 states and 1895 transitions. [2024-11-10 14:37:55,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 573 places, 584 transitions, 1237 flow [2024-11-10 14:37:55,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 584 transitions, 1237 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:55,521 INFO L231 Difference]: Finished difference. Result has 574 places, 582 transitions, 1203 flow [2024-11-10 14:37:55,522 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1189, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1203, PETRI_PLACES=574, PETRI_TRANSITIONS=582} [2024-11-10 14:37:55,523 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -40 predicate places. [2024-11-10 14:37:55,523 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 582 transitions, 1203 flow [2024-11-10 14:37:55,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 625.6666666666666) internal successors, (1877), 3 states have internal predecessors, (1877), 0 states have call successors, (0), 0 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-10 14:37:55,530 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:55,530 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] [2024-11-10 14:37:55,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:37:55,530 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:55,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1905023035, now seen corresponding path program 1 times [2024-11-10 14:37:55,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:55,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568638194] [2024-11-10 14:37:55,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:55,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:55,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:55,603 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-10 14:37:55,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:55,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568638194] [2024-11-10 14:37:55,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568638194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:55,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:55,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:55,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22687801] [2024-11-10 14:37:55,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:55,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:55,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:55,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:55,624 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 658 [2024-11-10 14:37:55,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 582 transitions, 1203 flow. Second operand has 3 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 0 states have call successors, (0), 0 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-10 14:37:55,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:55,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 658 [2024-11-10 14:37:55,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:55,993 INFO L124 PetriNetUnfolderBase]: 108/2060 cut-off events. [2024-11-10 14:37:55,993 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-11-10 14:37:56,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 2060 events. 108/2060 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 13512 event pairs, 7 based on Foata normal form. 0/1773 useless extension candidates. Maximal degree in co-relation 2091. Up to 33 conditions per place. [2024-11-10 14:37:56,022 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 13 selfloop transitions, 2 changer transitions 0/583 dead transitions. [2024-11-10 14:37:56,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 583 transitions, 1237 flow [2024-11-10 14:37:56,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:56,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:56,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1903 transitions. [2024-11-10 14:37:56,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96403242147923 [2024-11-10 14:37:56,027 INFO L175 Difference]: Start difference. First operand has 574 places, 582 transitions, 1203 flow. Second operand 3 states and 1903 transitions. [2024-11-10 14:37:56,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 583 transitions, 1237 flow [2024-11-10 14:37:56,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 583 transitions, 1237 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:56,038 INFO L231 Difference]: Finished difference. Result has 575 places, 581 transitions, 1205 flow [2024-11-10 14:37:56,039 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1205, PETRI_PLACES=575, PETRI_TRANSITIONS=581} [2024-11-10 14:37:56,039 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -39 predicate places. [2024-11-10 14:37:56,039 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 581 transitions, 1205 flow [2024-11-10 14:37:56,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 0 states have call successors, (0), 0 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-10 14:37:56,041 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:56,041 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] [2024-11-10 14:37:56,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:37:56,041 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:56,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:56,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1135853748, now seen corresponding path program 1 times [2024-11-10 14:37:56,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:56,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070886232] [2024-11-10 14:37:56,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:56,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:56,106 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-10 14:37:56,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:56,107 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070886232] [2024-11-10 14:37:56,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070886232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:56,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:56,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:37:56,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154559911] [2024-11-10 14:37:56,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:56,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:56,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:56,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:56,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:56,121 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 658 [2024-11-10 14:37:56,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 581 transitions, 1205 flow. Second operand has 3 states, 3 states have (on average 630.6666666666666) internal successors, (1892), 3 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-10 14:37:56,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:56,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 658 [2024-11-10 14:37:56,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:56,408 INFO L124 PetriNetUnfolderBase]: 88/1591 cut-off events. [2024-11-10 14:37:56,408 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2024-11-10 14:37:56,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1706 conditions, 1591 events. 88/1591 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10199 event pairs, 12 based on Foata normal form. 1/1375 useless extension candidates. Maximal degree in co-relation 1695. Up to 39 conditions per place. [2024-11-10 14:37:56,432 INFO L140 encePairwiseOnDemand]: 654/658 looper letters, 14 selfloop transitions, 3 changer transitions 0/584 dead transitions. [2024-11-10 14:37:56,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 577 places, 584 transitions, 1247 flow [2024-11-10 14:37:56,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:56,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:56,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1905 transitions. [2024-11-10 14:37:56,437 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650455927051672 [2024-11-10 14:37:56,437 INFO L175 Difference]: Start difference. First operand has 575 places, 581 transitions, 1205 flow. Second operand 3 states and 1905 transitions. [2024-11-10 14:37:56,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 577 places, 584 transitions, 1247 flow [2024-11-10 14:37:56,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 584 transitions, 1243 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:56,448 INFO L231 Difference]: Finished difference. Result has 577 places, 582 transitions, 1219 flow [2024-11-10 14:37:56,449 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1201, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=577, PETRI_TRANSITIONS=582} [2024-11-10 14:37:56,450 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -37 predicate places. [2024-11-10 14:37:56,450 INFO L471 AbstractCegarLoop]: Abstraction has has 577 places, 582 transitions, 1219 flow [2024-11-10 14:37:56,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 630.6666666666666) internal successors, (1892), 3 states have internal predecessors, (1892), 0 states have call successors, (0), 0 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-10 14:37:56,451 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:56,451 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] [2024-11-10 14:37:56,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:37:56,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:56,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1137171473, now seen corresponding path program 1 times [2024-11-10 14:37:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:56,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106991360] [2024-11-10 14:37:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:56,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:56,509 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-10 14:37:56,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:56,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106991360] [2024-11-10 14:37:56,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106991360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:56,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:56,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770033359] [2024-11-10 14:37:56,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:56,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:56,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:56,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:56,532 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 658 [2024-11-10 14:37:56,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 577 places, 582 transitions, 1219 flow. Second operand has 3 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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-10 14:37:56,534 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:56,534 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 658 [2024-11-10 14:37:56,534 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:57,017 INFO L124 PetriNetUnfolderBase]: 197/2616 cut-off events. [2024-11-10 14:37:57,017 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-11-10 14:37:57,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2910 conditions, 2616 events. 197/2616 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 19781 event pairs, 24 based on Foata normal form. 0/2270 useless extension candidates. Maximal degree in co-relation 2830. Up to 168 conditions per place. [2024-11-10 14:37:57,066 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 20 selfloop transitions, 2 changer transitions 0/585 dead transitions. [2024-11-10 14:37:57,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 585 transitions, 1274 flow [2024-11-10 14:37:57,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:57,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2024-11-10 14:37:57,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961499493414387 [2024-11-10 14:37:57,071 INFO L175 Difference]: Start difference. First operand has 577 places, 582 transitions, 1219 flow. Second operand 3 states and 1898 transitions. [2024-11-10 14:37:57,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 585 transitions, 1274 flow [2024-11-10 14:37:57,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 585 transitions, 1268 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:57,082 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1219 flow [2024-11-10 14:37:57,083 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1205, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2024-11-10 14:37:57,083 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -40 predicate places. [2024-11-10 14:37:57,084 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1219 flow [2024-11-10 14:37:57,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 625.3333333333334) internal successors, (1876), 3 states have internal predecessors, (1876), 0 states have call successors, (0), 0 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-10 14:37:57,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:57,085 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] [2024-11-10 14:37:57,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:37:57,085 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:57,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:57,086 INFO L85 PathProgramCache]: Analyzing trace with hash -17149781, now seen corresponding path program 1 times [2024-11-10 14:37:57,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:57,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688251772] [2024-11-10 14:37:57,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:57,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:57,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:57,155 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-10 14:37:57,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:57,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688251772] [2024-11-10 14:37:57,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688251772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:57,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:57,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:57,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161362373] [2024-11-10 14:37:57,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:57,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:57,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:57,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:57,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:57,182 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 658 [2024-11-10 14:37:57,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1219 flow. Second operand has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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-10 14:37:57,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:57,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 658 [2024-11-10 14:37:57,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:57,585 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][424], [690#(= |#race~count3~0| 0), 686#(= |#race~count2~0| 0), 658#(= |#race~n1~0| 0), 259#L125true, Black: 680#true, 676#(= |#race~n3~0| 0), 702#(= |#race~get1~0| 0), Black: 684#true, Black: 688#true, 682#(= |#race~count1~0| 0), 670#(= |#race~n2~0| 0), 704#true, 207#thread3ENTRYtrue, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 700#true]) [2024-11-10 14:37:57,585 INFO L294 olderBase$Statistics]: this new event has 263 ancestors and is cut-off event [2024-11-10 14:37:57,585 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-11-10 14:37:57,585 INFO L297 olderBase$Statistics]: existing Event has 291 ancestors and is cut-off event [2024-11-10 14:37:57,585 INFO L297 olderBase$Statistics]: existing Event has 260 ancestors and is cut-off event [2024-11-10 14:37:57,728 INFO L124 PetriNetUnfolderBase]: 169/2815 cut-off events. [2024-11-10 14:37:57,729 INFO L125 PetriNetUnfolderBase]: For 20/56 co-relation queries the response was YES. [2024-11-10 14:37:57,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 2815 events. 169/2815 cut-off events. For 20/56 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 20856 event pairs, 17 based on Foata normal form. 0/2418 useless extension candidates. Maximal degree in co-relation 2942. Up to 72 conditions per place. [2024-11-10 14:37:57,774 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 14 selfloop transitions, 2 changer transitions 0/581 dead transitions. [2024-11-10 14:37:57,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 581 transitions, 1255 flow [2024-11-10 14:37:57,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:57,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1901 transitions. [2024-11-10 14:37:57,778 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630192502532928 [2024-11-10 14:37:57,778 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1219 flow. Second operand 3 states and 1901 transitions. [2024-11-10 14:37:57,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 581 transitions, 1255 flow [2024-11-10 14:37:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 575 places, 581 transitions, 1255 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:37:57,789 INFO L231 Difference]: Finished difference. Result has 575 places, 579 transitions, 1221 flow [2024-11-10 14:37:57,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1217, PETRI_DIFFERENCE_MINUEND_PLACES=573, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1221, PETRI_PLACES=575, PETRI_TRANSITIONS=579} [2024-11-10 14:37:57,791 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -39 predicate places. [2024-11-10 14:37:57,791 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 579 transitions, 1221 flow [2024-11-10 14:37:57,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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-10 14:37:57,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:57,792 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] [2024-11-10 14:37:57,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:37:57,792 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:57,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:57,792 INFO L85 PathProgramCache]: Analyzing trace with hash 264095745, now seen corresponding path program 1 times [2024-11-10 14:37:57,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:57,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624434912] [2024-11-10 14:37:57,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:57,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:57,857 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-10 14:37:57,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:57,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624434912] [2024-11-10 14:37:57,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624434912] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:57,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:57,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:37:57,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246153634] [2024-11-10 14:37:57,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:57,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:37:57,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:57,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:37:57,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:37:57,877 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 658 [2024-11-10 14:37:57,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 579 transitions, 1221 flow. Second operand has 3 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 0 states have call successors, (0), 0 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-10 14:37:57,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:57,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 658 [2024-11-10 14:37:57,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:37:58,317 INFO L124 PetriNetUnfolderBase]: 147/2546 cut-off events. [2024-11-10 14:37:58,317 INFO L125 PetriNetUnfolderBase]: For 6/14 co-relation queries the response was YES. [2024-11-10 14:37:58,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2741 conditions, 2546 events. 147/2546 cut-off events. For 6/14 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 18172 event pairs, 10 based on Foata normal form. 0/2205 useless extension candidates. Maximal degree in co-relation 2703. Up to 44 conditions per place. [2024-11-10 14:37:58,372 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 13 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2024-11-10 14:37:58,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1255 flow [2024-11-10 14:37:58,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:37:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:37:58,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1903 transitions. [2024-11-10 14:37:58,377 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.96403242147923 [2024-11-10 14:37:58,377 INFO L175 Difference]: Start difference. First operand has 575 places, 579 transitions, 1221 flow. Second operand 3 states and 1903 transitions. [2024-11-10 14:37:58,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1255 flow [2024-11-10 14:37:58,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1251 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:37:58,390 INFO L231 Difference]: Finished difference. Result has 574 places, 578 transitions, 1219 flow [2024-11-10 14:37:58,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1219, PETRI_PLACES=574, PETRI_TRANSITIONS=578} [2024-11-10 14:37:58,392 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -40 predicate places. [2024-11-10 14:37:58,392 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 578 transitions, 1219 flow [2024-11-10 14:37:58,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 630.3333333333334) internal successors, (1891), 3 states have internal predecessors, (1891), 0 states have call successors, (0), 0 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-10 14:37:58,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:37:58,393 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] [2024-11-10 14:37:58,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-10 14:37:58,394 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:37:58,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:37:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash -991072779, now seen corresponding path program 1 times [2024-11-10 14:37:58,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:37:58,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582887836] [2024-11-10 14:37:58,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:37:58,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:37:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:37:58,695 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-10 14:37:58,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:37:58,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582887836] [2024-11-10 14:37:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582887836] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:37:58,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:37:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:37:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145937614] [2024-11-10 14:37:58,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:37:58,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:37:58,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:37:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:37:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:37:59,263 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 658 [2024-11-10 14:37:59,267 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 578 transitions, 1219 flow. Second operand has 8 states, 8 states have (on average 601.125) internal successors, (4809), 8 states have internal predecessors, (4809), 0 states have call successors, (0), 0 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-10 14:37:59,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:37:59,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 658 [2024-11-10 14:37:59,268 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:00,106 INFO L124 PetriNetUnfolderBase]: 234/3658 cut-off events. [2024-11-10 14:38:00,106 INFO L125 PetriNetUnfolderBase]: For 10/51 co-relation queries the response was YES. [2024-11-10 14:38:00,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4129 conditions, 3658 events. 234/3658 cut-off events. For 10/51 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 31255 event pairs, 43 based on Foata normal form. 3/3196 useless extension candidates. Maximal degree in co-relation 4076. Up to 154 conditions per place. [2024-11-10 14:38:00,171 INFO L140 encePairwiseOnDemand]: 643/658 looper letters, 70 selfloop transitions, 16 changer transitions 0/617 dead transitions. [2024-11-10 14:38:00,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 584 places, 617 transitions, 1485 flow [2024-11-10 14:38:00,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:38:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:38:00,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6653 transitions. [2024-11-10 14:38:00,180 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9191765681127383 [2024-11-10 14:38:00,180 INFO L175 Difference]: Start difference. First operand has 574 places, 578 transitions, 1219 flow. Second operand 11 states and 6653 transitions. [2024-11-10 14:38:00,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 584 places, 617 transitions, 1485 flow [2024-11-10 14:38:00,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 617 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:00,193 INFO L231 Difference]: Finished difference. Result has 587 places, 587 transitions, 1299 flow [2024-11-10 14:38:00,194 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1215, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=578, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1299, PETRI_PLACES=587, PETRI_TRANSITIONS=587} [2024-11-10 14:38:00,195 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -27 predicate places. [2024-11-10 14:38:00,195 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 587 transitions, 1299 flow [2024-11-10 14:38:00,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 601.125) internal successors, (4809), 8 states have internal predecessors, (4809), 0 states have call successors, (0), 0 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-10 14:38:00,196 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:00,196 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-10 14:38:00,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-10 14:38:00,197 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:00,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:00,198 INFO L85 PathProgramCache]: Analyzing trace with hash 241991898, now seen corresponding path program 1 times [2024-11-10 14:38:00,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:00,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721632723] [2024-11-10 14:38:00,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:00,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:00,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:00,261 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-10 14:38:00,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:00,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721632723] [2024-11-10 14:38:00,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721632723] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:00,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:00,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:00,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178730213] [2024-11-10 14:38:00,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:00,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:00,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:00,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:00,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:00,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 658 [2024-11-10 14:38:00,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 587 transitions, 1299 flow. Second operand has 3 states, 3 states have (on average 630.0) internal successors, (1890), 3 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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-10 14:38:00,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:00,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 658 [2024-11-10 14:38:00,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:00,799 INFO L124 PetriNetUnfolderBase]: 191/2434 cut-off events. [2024-11-10 14:38:00,800 INFO L125 PetriNetUnfolderBase]: For 80/145 co-relation queries the response was YES. [2024-11-10 14:38:00,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 2434 events. 191/2434 cut-off events. For 80/145 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 18720 event pairs, 44 based on Foata normal form. 0/2121 useless extension candidates. Maximal degree in co-relation 2730. Up to 165 conditions per place. [2024-11-10 14:38:00,842 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 14 selfloop transitions, 2 changer transitions 0/588 dead transitions. [2024-11-10 14:38:00,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 588 transitions, 1335 flow [2024-11-10 14:38:00,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:00,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1901 transitions. [2024-11-10 14:38:00,845 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630192502532928 [2024-11-10 14:38:00,845 INFO L175 Difference]: Start difference. First operand has 587 places, 587 transitions, 1299 flow. Second operand 3 states and 1901 transitions. [2024-11-10 14:38:00,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 588 transitions, 1335 flow [2024-11-10 14:38:00,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 588 transitions, 1331 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:00,857 INFO L231 Difference]: Finished difference. Result has 587 places, 586 transitions, 1297 flow [2024-11-10 14:38:00,857 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1297, PETRI_PLACES=587, PETRI_TRANSITIONS=586} [2024-11-10 14:38:00,858 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -27 predicate places. [2024-11-10 14:38:00,858 INFO L471 AbstractCegarLoop]: Abstraction has has 587 places, 586 transitions, 1297 flow [2024-11-10 14:38:00,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 630.0) internal successors, (1890), 3 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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-10 14:38:00,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:00,859 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] [2024-11-10 14:38:00,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-10 14:38:00,859 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:00,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:00,859 INFO L85 PathProgramCache]: Analyzing trace with hash -859077275, now seen corresponding path program 1 times [2024-11-10 14:38:00,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:00,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549147587] [2024-11-10 14:38:00,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:00,923 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-10 14:38:00,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:00,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549147587] [2024-11-10 14:38:00,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549147587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:00,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:00,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:38:00,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481604629] [2024-11-10 14:38:00,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:00,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:00,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:00,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:00,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:00,938 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 658 [2024-11-10 14:38:00,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 586 transitions, 1297 flow. Second operand has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 0 states have call successors, (0), 0 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-10 14:38:00,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:00,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 658 [2024-11-10 14:38:00,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:01,647 INFO L124 PetriNetUnfolderBase]: 296/3758 cut-off events. [2024-11-10 14:38:01,647 INFO L125 PetriNetUnfolderBase]: For 61/94 co-relation queries the response was YES. [2024-11-10 14:38:01,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4365 conditions, 3758 events. 296/3758 cut-off events. For 61/94 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 33103 event pairs, 72 based on Foata normal form. 0/3273 useless extension candidates. Maximal degree in co-relation 4277. Up to 224 conditions per place. [2024-11-10 14:38:01,734 INFO L140 encePairwiseOnDemand]: 654/658 looper letters, 14 selfloop transitions, 3 changer transitions 0/589 dead transitions. [2024-11-10 14:38:01,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 589 places, 589 transitions, 1339 flow [2024-11-10 14:38:01,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:01,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:01,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1905 transitions. [2024-11-10 14:38:01,738 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650455927051672 [2024-11-10 14:38:01,738 INFO L175 Difference]: Start difference. First operand has 587 places, 586 transitions, 1297 flow. Second operand 3 states and 1905 transitions. [2024-11-10 14:38:01,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 589 places, 589 transitions, 1339 flow [2024-11-10 14:38:01,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 587 places, 589 transitions, 1335 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:01,748 INFO L231 Difference]: Finished difference. Result has 589 places, 587 transitions, 1311 flow [2024-11-10 14:38:01,748 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=585, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=583, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1311, PETRI_PLACES=589, PETRI_TRANSITIONS=587} [2024-11-10 14:38:01,749 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -25 predicate places. [2024-11-10 14:38:01,749 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 587 transitions, 1311 flow [2024-11-10 14:38:01,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 631.0) internal successors, (1893), 3 states have internal predecessors, (1893), 0 states have call successors, (0), 0 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-10 14:38:01,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:01,750 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] [2024-11-10 14:38:01,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-10 14:38:01,750 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:01,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash -1026159839, now seen corresponding path program 1 times [2024-11-10 14:38:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:01,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926801745] [2024-11-10 14:38:01,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:01,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:01,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:01,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-10 14:38:01,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:01,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926801745] [2024-11-10 14:38:01,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926801745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:01,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:01,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 14:38:01,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72334461] [2024-11-10 14:38:01,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:01,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:01,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:01,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:01,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:01,818 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 629 out of 658 [2024-11-10 14:38:01,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 587 transitions, 1311 flow. Second operand has 3 states, 3 states have (on average 631.3333333333334) internal successors, (1894), 3 states have internal predecessors, (1894), 0 states have call successors, (0), 0 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-10 14:38:01,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:01,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 629 of 658 [2024-11-10 14:38:01,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:02,299 INFO L124 PetriNetUnfolderBase]: 256/3115 cut-off events. [2024-11-10 14:38:02,300 INFO L125 PetriNetUnfolderBase]: For 130/227 co-relation queries the response was YES. [2024-11-10 14:38:02,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3659 conditions, 3115 events. 256/3115 cut-off events. For 130/227 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 24669 event pairs, 66 based on Foata normal form. 0/2703 useless extension candidates. Maximal degree in co-relation 3570. Up to 240 conditions per place. [2024-11-10 14:38:02,352 INFO L140 encePairwiseOnDemand]: 654/658 looper letters, 14 selfloop transitions, 3 changer transitions 0/590 dead transitions. [2024-11-10 14:38:02,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 590 transitions, 1353 flow [2024-11-10 14:38:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1905 transitions. [2024-11-10 14:38:02,354 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9650455927051672 [2024-11-10 14:38:02,354 INFO L175 Difference]: Start difference. First operand has 589 places, 587 transitions, 1311 flow. Second operand 3 states and 1905 transitions. [2024-11-10 14:38:02,354 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 590 transitions, 1353 flow [2024-11-10 14:38:02,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 589 places, 590 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:02,362 INFO L231 Difference]: Finished difference. Result has 591 places, 588 transitions, 1323 flow [2024-11-10 14:38:02,362 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1305, PETRI_DIFFERENCE_MINUEND_PLACES=587, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1323, PETRI_PLACES=591, PETRI_TRANSITIONS=588} [2024-11-10 14:38:02,363 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -23 predicate places. [2024-11-10 14:38:02,363 INFO L471 AbstractCegarLoop]: Abstraction has has 591 places, 588 transitions, 1323 flow [2024-11-10 14:38:02,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 631.3333333333334) internal successors, (1894), 3 states have internal predecessors, (1894), 0 states have call successors, (0), 0 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-10 14:38:02,363 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:02,364 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:02,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-10 14:38:02,364 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:02,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:02,364 INFO L85 PathProgramCache]: Analyzing trace with hash -274019892, now seen corresponding path program 1 times [2024-11-10 14:38:02,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:02,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297356862] [2024-11-10 14:38:02,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:02,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:02,426 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-10 14:38:02,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:02,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297356862] [2024-11-10 14:38:02,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297356862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:02,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:02,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:02,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935023917] [2024-11-10 14:38:02,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:02,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:02,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:02,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:02,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 658 [2024-11-10 14:38:02,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 591 places, 588 transitions, 1323 flow. Second operand has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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-10 14:38:02,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:02,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 658 [2024-11-10 14:38:02,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:03,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][405], [690#(= |#race~count3~0| 0), 686#(= |#race~count2~0| 0), 658#(= |#race~n1~0| 0), Black: 740#(not |thread2Thread1of1ForFork2_#t~short10|), 259#L125true, Black: 745#(not |thread3Thread1of1ForFork1_#t~short19|), Black: 680#true, 676#(= |#race~n3~0| 0), 702#(= |#race~get1~0| 0), Black: 684#true, 682#(= |#race~count1~0| 0), Black: 688#true, 748#true, 670#(= |#race~n2~0| 0), 743#true, Black: 723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 207#thread3ENTRYtrue, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 715#(<= ~n1~0 0), Black: 721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 729#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 716#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), Black: 700#true]) [2024-11-10 14:38:03,307 INFO L294 olderBase$Statistics]: this new event has 288 ancestors and is cut-off event [2024-11-10 14:38:03,307 INFO L297 olderBase$Statistics]: existing Event has 310 ancestors and is cut-off event [2024-11-10 14:38:03,308 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-10 14:38:03,308 INFO L297 olderBase$Statistics]: existing Event has 279 ancestors and is cut-off event [2024-11-10 14:38:03,416 INFO L124 PetriNetUnfolderBase]: 307/4947 cut-off events. [2024-11-10 14:38:03,416 INFO L125 PetriNetUnfolderBase]: For 113/178 co-relation queries the response was YES. [2024-11-10 14:38:03,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5714 conditions, 4947 events. 307/4947 cut-off events. For 113/178 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 44088 event pairs, 29 based on Foata normal form. 0/4375 useless extension candidates. Maximal degree in co-relation 5624. Up to 131 conditions per place. [2024-11-10 14:38:03,494 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 14 selfloop transitions, 2 changer transitions 0/589 dead transitions. [2024-11-10 14:38:03,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 592 places, 589 transitions, 1359 flow [2024-11-10 14:38:03,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:03,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:03,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1901 transitions. [2024-11-10 14:38:03,498 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630192502532928 [2024-11-10 14:38:03,498 INFO L175 Difference]: Start difference. First operand has 591 places, 588 transitions, 1323 flow. Second operand 3 states and 1901 transitions. [2024-11-10 14:38:03,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 592 places, 589 transitions, 1359 flow [2024-11-10 14:38:03,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 590 places, 589 transitions, 1353 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:03,516 INFO L231 Difference]: Finished difference. Result has 590 places, 587 transitions, 1319 flow [2024-11-10 14:38:03,517 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1319, PETRI_PLACES=590, PETRI_TRANSITIONS=587} [2024-11-10 14:38:03,517 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -24 predicate places. [2024-11-10 14:38:03,517 INFO L471 AbstractCegarLoop]: Abstraction has has 590 places, 587 transitions, 1319 flow [2024-11-10 14:38:03,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 629.6666666666666) internal successors, (1889), 3 states have internal predecessors, (1889), 0 states have call successors, (0), 0 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-10 14:38:03,518 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:03,518 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] [2024-11-10 14:38:03,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-10 14:38:03,519 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:03,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:03,519 INFO L85 PathProgramCache]: Analyzing trace with hash -492788229, now seen corresponding path program 1 times [2024-11-10 14:38:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559245501] [2024-11-10 14:38:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:03,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:03,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:38:03,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:03,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559245501] [2024-11-10 14:38:03,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559245501] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:03,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:03,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:03,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094573608] [2024-11-10 14:38:03,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:03,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:03,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:03,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:03,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:04,203 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 658 [2024-11-10 14:38:04,208 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 590 places, 587 transitions, 1319 flow. Second operand has 8 states, 8 states have (on average 601.25) internal successors, (4810), 8 states have internal predecessors, (4810), 0 states have call successors, (0), 0 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-10 14:38:04,208 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:04,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 658 [2024-11-10 14:38:04,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:05,022 INFO L124 PetriNetUnfolderBase]: 279/3556 cut-off events. [2024-11-10 14:38:05,022 INFO L125 PetriNetUnfolderBase]: For 71/135 co-relation queries the response was YES. [2024-11-10 14:38:05,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4332 conditions, 3556 events. 279/3556 cut-off events. For 71/135 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 30492 event pairs, 60 based on Foata normal form. 6/3163 useless extension candidates. Maximal degree in co-relation 4247. Up to 199 conditions per place. [2024-11-10 14:38:05,084 INFO L140 encePairwiseOnDemand]: 641/658 looper letters, 69 selfloop transitions, 19 changer transitions 0/623 dead transitions. [2024-11-10 14:38:05,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 623 transitions, 1585 flow [2024-11-10 14:38:05,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:38:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:38:05,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7253 transitions. [2024-11-10 14:38:05,098 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9185663627152989 [2024-11-10 14:38:05,099 INFO L175 Difference]: Start difference. First operand has 590 places, 587 transitions, 1319 flow. Second operand 12 states and 7253 transitions. [2024-11-10 14:38:05,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 623 transitions, 1585 flow [2024-11-10 14:38:05,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 599 places, 623 transitions, 1581 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:05,111 INFO L231 Difference]: Finished difference. Result has 603 places, 592 transitions, 1395 flow [2024-11-10 14:38:05,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1315, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=587, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=569, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1395, PETRI_PLACES=603, PETRI_TRANSITIONS=592} [2024-11-10 14:38:05,112 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -11 predicate places. [2024-11-10 14:38:05,112 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 592 transitions, 1395 flow [2024-11-10 14:38:05,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 601.25) internal successors, (4810), 8 states have internal predecessors, (4810), 0 states have call successors, (0), 0 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-10 14:38:05,114 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:05,114 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] [2024-11-10 14:38:05,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-10 14:38:05,114 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:05,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1940820740, now seen corresponding path program 1 times [2024-11-10 14:38:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:05,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038985752] [2024-11-10 14:38:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:05,177 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-10 14:38:05,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:05,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038985752] [2024-11-10 14:38:05,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038985752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:05,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:05,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:05,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789764529] [2024-11-10 14:38:05,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:05,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:05,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:05,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:05,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:05,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 658 [2024-11-10 14:38:05,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 592 transitions, 1395 flow. Second operand has 3 states, 3 states have (on average 626.0) internal successors, (1878), 3 states have internal predecessors, (1878), 0 states have call successors, (0), 0 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-10 14:38:05,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:05,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 658 [2024-11-10 14:38:05,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:06,240 INFO L124 PetriNetUnfolderBase]: 309/4360 cut-off events. [2024-11-10 14:38:06,240 INFO L125 PetriNetUnfolderBase]: For 104/134 co-relation queries the response was YES. [2024-11-10 14:38:06,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5206 conditions, 4360 events. 309/4360 cut-off events. For 104/134 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 35994 event pairs, 39 based on Foata normal form. 1/3903 useless extension candidates. Maximal degree in co-relation 5109. Up to 250 conditions per place. [2024-11-10 14:38:06,318 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 20 selfloop transitions, 2 changer transitions 0/595 dead transitions. [2024-11-10 14:38:06,318 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 595 transitions, 1450 flow [2024-11-10 14:38:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:06,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:06,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1898 transitions. [2024-11-10 14:38:06,321 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.961499493414387 [2024-11-10 14:38:06,321 INFO L175 Difference]: Start difference. First operand has 603 places, 592 transitions, 1395 flow. Second operand 3 states and 1898 transitions. [2024-11-10 14:38:06,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 595 transitions, 1450 flow [2024-11-10 14:38:06,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 595 places, 595 transitions, 1433 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:38:06,330 INFO L231 Difference]: Finished difference. Result has 596 places, 590 transitions, 1384 flow [2024-11-10 14:38:06,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1370, PETRI_DIFFERENCE_MINUEND_PLACES=593, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1384, PETRI_PLACES=596, PETRI_TRANSITIONS=590} [2024-11-10 14:38:06,331 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -18 predicate places. [2024-11-10 14:38:06,331 INFO L471 AbstractCegarLoop]: Abstraction has has 596 places, 590 transitions, 1384 flow [2024-11-10 14:38:06,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 626.0) internal successors, (1878), 3 states have internal predecessors, (1878), 0 states have call successors, (0), 0 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-10 14:38:06,335 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:06,336 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] [2024-11-10 14:38:06,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-10 14:38:06,336 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:06,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:06,336 INFO L85 PathProgramCache]: Analyzing trace with hash 749037166, now seen corresponding path program 1 times [2024-11-10 14:38:06,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:06,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309083535] [2024-11-10 14:38:06,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:06,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:06,401 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-10 14:38:06,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:06,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309083535] [2024-11-10 14:38:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309083535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:06,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:06,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:06,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821618180] [2024-11-10 14:38:06,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:06,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:06,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:06,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:06,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:06,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 628 out of 658 [2024-11-10 14:38:06,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 596 places, 590 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 630.0) internal successors, (1890), 3 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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-10 14:38:06,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:06,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 628 of 658 [2024-11-10 14:38:06,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:07,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1659] thread3EXIT-->L127-5: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][532], [Black: 757#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 756#(<= ~n1~0 0), 690#(= |#race~count3~0| 0), Black: 770#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 658#(= |#race~n1~0| 0), 777#(= |#race~get2~0| 0), Black: 775#true, 779#true, 676#(= |#race~n3~0| 0), Black: 723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 715#(<= ~n1~0 0), Black: 721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 729#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 716#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), 686#(= |#race~count2~0| 0), Black: 740#(not |thread2Thread1of1ForFork2_#t~short10|), Black: 680#true, Black: 745#(not |thread3Thread1of1ForFork1_#t~short19|), Black: 684#true, 702#(= |#race~get1~0| 0), Black: 688#true, 682#(= |#race~count1~0| 0), 670#(= |#race~n2~0| 0), 294#L127-5true, 751#true, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 700#true]) [2024-11-10 14:38:07,160 INFO L294 olderBase$Statistics]: this new event has 307 ancestors and is cut-off event [2024-11-10 14:38:07,160 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-11-10 14:38:07,160 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-11-10 14:38:07,160 INFO L297 olderBase$Statistics]: existing Event has 329 ancestors and is cut-off event [2024-11-10 14:38:07,185 INFO L124 PetriNetUnfolderBase]: 244/2953 cut-off events. [2024-11-10 14:38:07,186 INFO L125 PetriNetUnfolderBase]: For 131/169 co-relation queries the response was YES. [2024-11-10 14:38:07,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3705 conditions, 2953 events. 244/2953 cut-off events. For 131/169 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 22549 event pairs, 43 based on Foata normal form. 2/2656 useless extension candidates. Maximal degree in co-relation 3607. Up to 209 conditions per place. [2024-11-10 14:38:07,238 INFO L140 encePairwiseOnDemand]: 655/658 looper letters, 14 selfloop transitions, 2 changer transitions 0/591 dead transitions. [2024-11-10 14:38:07,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 597 places, 591 transitions, 1420 flow [2024-11-10 14:38:07,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:07,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1901 transitions. [2024-11-10 14:38:07,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630192502532928 [2024-11-10 14:38:07,240 INFO L175 Difference]: Start difference. First operand has 596 places, 590 transitions, 1384 flow. Second operand 3 states and 1901 transitions. [2024-11-10 14:38:07,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 597 places, 591 transitions, 1420 flow [2024-11-10 14:38:07,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 597 places, 591 transitions, 1420 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:07,248 INFO L231 Difference]: Finished difference. Result has 597 places, 589 transitions, 1386 flow [2024-11-10 14:38:07,248 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1386, PETRI_PLACES=597, PETRI_TRANSITIONS=589} [2024-11-10 14:38:07,249 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -17 predicate places. [2024-11-10 14:38:07,249 INFO L471 AbstractCegarLoop]: Abstraction has has 597 places, 589 transitions, 1386 flow [2024-11-10 14:38:07,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 630.0) internal successors, (1890), 3 states have internal predecessors, (1890), 0 states have call successors, (0), 0 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-10 14:38:07,250 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:07,250 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] [2024-11-10 14:38:07,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-10 14:38:07,250 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:07,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1157209610, now seen corresponding path program 1 times [2024-11-10 14:38:07,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:07,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393263331] [2024-11-10 14:38:07,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:07,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:07,483 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-10 14:38:07,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:07,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393263331] [2024-11-10 14:38:07,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393263331] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:07,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:07,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:07,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166870563] [2024-11-10 14:38:07,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:07,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:07,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:07,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:07,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:08,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 658 [2024-11-10 14:38:08,063 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 597 places, 589 transitions, 1386 flow. Second operand has 8 states, 8 states have (on average 601.375) internal successors, (4811), 8 states have internal predecessors, (4811), 0 states have call successors, (0), 0 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-10 14:38:08,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:08,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 658 [2024-11-10 14:38:08,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:09,017 INFO L124 PetriNetUnfolderBase]: 521/5098 cut-off events. [2024-11-10 14:38:09,017 INFO L125 PetriNetUnfolderBase]: For 375/543 co-relation queries the response was YES. [2024-11-10 14:38:09,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6896 conditions, 5098 events. 521/5098 cut-off events. For 375/543 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 46697 event pairs, 175 based on Foata normal form. 22/4618 useless extension candidates. Maximal degree in co-relation 6795. Up to 684 conditions per place. [2024-11-10 14:38:09,105 INFO L140 encePairwiseOnDemand]: 643/658 looper letters, 66 selfloop transitions, 16 changer transitions 0/619 dead transitions. [2024-11-10 14:38:09,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 619 transitions, 1626 flow [2024-11-10 14:38:09,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:38:09,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:38:09,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6644 transitions. [2024-11-10 14:38:09,109 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9179331306990881 [2024-11-10 14:38:09,109 INFO L175 Difference]: Start difference. First operand has 597 places, 589 transitions, 1386 flow. Second operand 11 states and 6644 transitions. [2024-11-10 14:38:09,109 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 619 transitions, 1626 flow [2024-11-10 14:38:09,116 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 619 transitions, 1622 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:38:09,122 INFO L231 Difference]: Finished difference. Result has 610 places, 598 transitions, 1466 flow [2024-11-10 14:38:09,123 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1382, PETRI_DIFFERENCE_MINUEND_PLACES=595, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=589, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=575, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1466, PETRI_PLACES=610, PETRI_TRANSITIONS=598} [2024-11-10 14:38:09,123 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, -4 predicate places. [2024-11-10 14:38:09,123 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 598 transitions, 1466 flow [2024-11-10 14:38:09,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 601.375) internal successors, (4811), 8 states have internal predecessors, (4811), 0 states have call successors, (0), 0 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-10 14:38:09,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:09,125 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:09,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-10 14:38:09,125 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:09,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:09,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1886592556, now seen corresponding path program 1 times [2024-11-10 14:38:09,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:09,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896538199] [2024-11-10 14:38:09,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:09,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:38:09,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:09,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896538199] [2024-11-10 14:38:09,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896538199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:09,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:09,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:09,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474536255] [2024-11-10 14:38:09,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:09,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:09,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:09,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:09,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:09,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 658 [2024-11-10 14:38:09,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 598 transitions, 1466 flow. Second operand has 8 states, 8 states have (on average 601.25) internal successors, (4810), 8 states have internal predecessors, (4810), 0 states have call successors, (0), 0 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-10 14:38:09,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:09,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 658 [2024-11-10 14:38:09,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:10,872 INFO L124 PetriNetUnfolderBase]: 410/5908 cut-off events. [2024-11-10 14:38:10,872 INFO L125 PetriNetUnfolderBase]: For 244/316 co-relation queries the response was YES. [2024-11-10 14:38:10,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7741 conditions, 5908 events. 410/5908 cut-off events. For 244/316 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 55032 event pairs, 52 based on Foata normal form. 5/5412 useless extension candidates. Maximal degree in co-relation 7632. Up to 212 conditions per place. [2024-11-10 14:38:10,972 INFO L140 encePairwiseOnDemand]: 641/658 looper letters, 71 selfloop transitions, 24 changer transitions 0/632 dead transitions. [2024-11-10 14:38:10,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 621 places, 632 transitions, 1772 flow [2024-11-10 14:38:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:38:10,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:38:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7246 transitions. [2024-11-10 14:38:10,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9176798378926039 [2024-11-10 14:38:10,977 INFO L175 Difference]: Start difference. First operand has 610 places, 598 transitions, 1466 flow. Second operand 12 states and 7246 transitions. [2024-11-10 14:38:10,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 621 places, 632 transitions, 1772 flow [2024-11-10 14:38:10,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 620 places, 632 transitions, 1768 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:38:10,991 INFO L231 Difference]: Finished difference. Result has 624 places, 607 transitions, 1595 flow [2024-11-10 14:38:10,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=598, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1595, PETRI_PLACES=624, PETRI_TRANSITIONS=607} [2024-11-10 14:38:10,992 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 10 predicate places. [2024-11-10 14:38:10,992 INFO L471 AbstractCegarLoop]: Abstraction has has 624 places, 607 transitions, 1595 flow [2024-11-10 14:38:10,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 601.25) internal successors, (4810), 8 states have internal predecessors, (4810), 0 states have call successors, (0), 0 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-10 14:38:10,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:10,994 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:10,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-10 14:38:10,994 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:10,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:10,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1130819342, now seen corresponding path program 1 times [2024-11-10 14:38:10,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:10,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782861382] [2024-11-10 14:38:10,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:10,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:11,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:38:11,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:11,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782861382] [2024-11-10 14:38:11,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782861382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:11,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:11,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813164111] [2024-11-10 14:38:11,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:11,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:11,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:11,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:11,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:11,611 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 658 [2024-11-10 14:38:11,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 624 places, 607 transitions, 1595 flow. Second operand has 8 states, 8 states have (on average 601.375) internal successors, (4811), 8 states have internal predecessors, (4811), 0 states have call successors, (0), 0 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-10 14:38:11,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:11,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 658 [2024-11-10 14:38:11,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:13,568 INFO L124 PetriNetUnfolderBase]: 927/11354 cut-off events. [2024-11-10 14:38:13,568 INFO L125 PetriNetUnfolderBase]: For 887/1054 co-relation queries the response was YES. [2024-11-10 14:38:13,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15391 conditions, 11354 events. 927/11354 cut-off events. For 887/1054 co-relation queries the response was YES. Maximal size of possible extension queue 165. Compared 127169 event pairs, 171 based on Foata normal form. 18/10377 useless extension candidates. Maximal degree in co-relation 15276. Up to 506 conditions per place. [2024-11-10 14:38:13,783 INFO L140 encePairwiseOnDemand]: 641/658 looper letters, 67 selfloop transitions, 26 changer transitions 0/638 dead transitions. [2024-11-10 14:38:13,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 635 places, 638 transitions, 1902 flow [2024-11-10 14:38:13,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 14:38:13,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-10 14:38:13,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 7237 transitions. [2024-11-10 14:38:13,786 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9165400202634245 [2024-11-10 14:38:13,787 INFO L175 Difference]: Start difference. First operand has 624 places, 607 transitions, 1595 flow. Second operand 12 states and 7237 transitions. [2024-11-10 14:38:13,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 635 places, 638 transitions, 1902 flow [2024-11-10 14:38:13,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 638 transitions, 1885 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-10 14:38:13,803 INFO L231 Difference]: Finished difference. Result has 635 places, 622 transitions, 1752 flow [2024-11-10 14:38:13,803 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1578, PETRI_DIFFERENCE_MINUEND_PLACES=618, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1752, PETRI_PLACES=635, PETRI_TRANSITIONS=622} [2024-11-10 14:38:13,804 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 21 predicate places. [2024-11-10 14:38:13,804 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 622 transitions, 1752 flow [2024-11-10 14:38:13,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 601.375) internal successors, (4811), 8 states have internal predecessors, (4811), 0 states have call successors, (0), 0 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-10 14:38:13,805 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:13,805 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:13,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-10 14:38:13,805 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:13,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:13,806 INFO L85 PathProgramCache]: Analyzing trace with hash 1356685485, now seen corresponding path program 1 times [2024-11-10 14:38:13,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:13,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452610043] [2024-11-10 14:38:13,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:13,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:13,998 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 14:38:13,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:13,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452610043] [2024-11-10 14:38:13,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452610043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:13,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:13,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 14:38:13,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995083000] [2024-11-10 14:38:13,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:13,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 14:38:13,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:14,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 14:38:14,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-10 14:38:14,511 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 658 [2024-11-10 14:38:14,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 622 transitions, 1752 flow. Second operand has 8 states, 8 states have (on average 601.5) internal successors, (4812), 8 states have internal predecessors, (4812), 0 states have call successors, (0), 0 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-10 14:38:14,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:14,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 658 [2024-11-10 14:38:14,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:15,884 INFO L124 PetriNetUnfolderBase]: 722/6945 cut-off events. [2024-11-10 14:38:15,884 INFO L125 PetriNetUnfolderBase]: For 1308/1497 co-relation queries the response was YES. [2024-11-10 14:38:15,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10298 conditions, 6945 events. 722/6945 cut-off events. For 1308/1497 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 68273 event pairs, 221 based on Foata normal form. 0/6350 useless extension candidates. Maximal degree in co-relation 10173. Up to 856 conditions per place. [2024-11-10 14:38:16,007 INFO L140 encePairwiseOnDemand]: 642/658 looper letters, 69 selfloop transitions, 20 changer transitions 0/645 dead transitions. [2024-11-10 14:38:16,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 645 transitions, 2022 flow [2024-11-10 14:38:16,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-10 14:38:16,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-10 14:38:16,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6637 transitions. [2024-11-10 14:38:16,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9169660127106936 [2024-11-10 14:38:16,010 INFO L175 Difference]: Start difference. First operand has 635 places, 622 transitions, 1752 flow. Second operand 11 states and 6637 transitions. [2024-11-10 14:38:16,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 645 transitions, 2022 flow [2024-11-10 14:38:16,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 645 transitions, 2022 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:16,027 INFO L231 Difference]: Finished difference. Result has 648 places, 630 transitions, 1869 flow [2024-11-10 14:38:16,028 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1752, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1869, PETRI_PLACES=648, PETRI_TRANSITIONS=630} [2024-11-10 14:38:16,028 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 34 predicate places. [2024-11-10 14:38:16,029 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 630 transitions, 1869 flow [2024-11-10 14:38:16,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 601.5) internal successors, (4812), 8 states have internal predecessors, (4812), 0 states have call successors, (0), 0 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-10 14:38:16,029 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:16,030 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:16,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-10 14:38:16,030 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash 203566927, now seen corresponding path program 1 times [2024-11-10 14:38:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731784734] [2024-11-10 14:38:16,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:16,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:16,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:16,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731784734] [2024-11-10 14:38:16,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731784734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:16,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:16,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:16,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582970967] [2024-11-10 14:38:16,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:16,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:16,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:16,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:16,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:17,114 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 658 [2024-11-10 14:38:17,115 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 630 transitions, 1869 flow. Second operand has 6 states, 6 states have (on average 610.8333333333334) internal successors, (3665), 6 states have internal predecessors, (3665), 0 states have call successors, (0), 0 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-10 14:38:17,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:17,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 658 [2024-11-10 14:38:17,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:18,751 INFO L124 PetriNetUnfolderBase]: 655/9752 cut-off events. [2024-11-10 14:38:18,751 INFO L125 PetriNetUnfolderBase]: For 2184/2252 co-relation queries the response was YES. [2024-11-10 14:38:18,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13970 conditions, 9752 events. 655/9752 cut-off events. For 2184/2252 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 101439 event pairs, 42 based on Foata normal form. 10/9059 useless extension candidates. Maximal degree in co-relation 13839. Up to 282 conditions per place. [2024-11-10 14:38:18,944 INFO L140 encePairwiseOnDemand]: 650/658 looper letters, 42 selfloop transitions, 6 changer transitions 0/637 dead transitions. [2024-11-10 14:38:18,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 637 transitions, 1991 flow [2024-11-10 14:38:18,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:18,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3692 transitions. [2024-11-10 14:38:18,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351570415400202 [2024-11-10 14:38:18,947 INFO L175 Difference]: Start difference. First operand has 648 places, 630 transitions, 1869 flow. Second operand 6 states and 3692 transitions. [2024-11-10 14:38:18,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 637 transitions, 1991 flow [2024-11-10 14:38:18,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 637 transitions, 1970 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-10 14:38:18,978 INFO L231 Difference]: Finished difference. Result has 645 places, 629 transitions, 1867 flow [2024-11-10 14:38:18,979 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1844, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=628, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=622, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1867, PETRI_PLACES=645, PETRI_TRANSITIONS=629} [2024-11-10 14:38:18,979 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 31 predicate places. [2024-11-10 14:38:18,980 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 629 transitions, 1867 flow [2024-11-10 14:38:18,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 610.8333333333334) internal successors, (3665), 6 states have internal predecessors, (3665), 0 states have call successors, (0), 0 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-10 14:38:18,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:18,981 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:18,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-10 14:38:18,981 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:18,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:18,981 INFO L85 PathProgramCache]: Analyzing trace with hash 849458061, now seen corresponding path program 1 times [2024-11-10 14:38:18,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:18,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483707733] [2024-11-10 14:38:18,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:18,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:19,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:19,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:19,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483707733] [2024-11-10 14:38:19,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483707733] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:19,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:19,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679478167] [2024-11-10 14:38:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:19,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:19,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:19,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 658 [2024-11-10 14:38:19,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 629 transitions, 1867 flow. Second operand has 6 states, 6 states have (on average 611.0) internal successors, (3666), 6 states have internal predecessors, (3666), 0 states have call successors, (0), 0 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-10 14:38:19,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:19,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 658 [2024-11-10 14:38:19,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:21,872 INFO L124 PetriNetUnfolderBase]: 744/10605 cut-off events. [2024-11-10 14:38:21,872 INFO L125 PetriNetUnfolderBase]: For 2191/2312 co-relation queries the response was YES. [2024-11-10 14:38:21,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15128 conditions, 10605 events. 744/10605 cut-off events. For 2191/2312 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 112575 event pairs, 70 based on Foata normal form. 15/9823 useless extension candidates. Maximal degree in co-relation 14997. Up to 378 conditions per place. [2024-11-10 14:38:21,982 INFO L140 encePairwiseOnDemand]: 650/658 looper letters, 42 selfloop transitions, 6 changer transitions 0/636 dead transitions. [2024-11-10 14:38:21,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 636 transitions, 1989 flow [2024-11-10 14:38:21,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:21,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:21,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3692 transitions. [2024-11-10 14:38:21,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351570415400202 [2024-11-10 14:38:21,984 INFO L175 Difference]: Start difference. First operand has 645 places, 629 transitions, 1867 flow. Second operand 6 states and 3692 transitions. [2024-11-10 14:38:21,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 636 transitions, 1989 flow [2024-11-10 14:38:22,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 636 transitions, 1976 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 14:38:22,017 INFO L231 Difference]: Finished difference. Result has 645 places, 628 transitions, 1873 flow [2024-11-10 14:38:22,018 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1850, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=627, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=621, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1873, PETRI_PLACES=645, PETRI_TRANSITIONS=628} [2024-11-10 14:38:22,018 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 31 predicate places. [2024-11-10 14:38:22,018 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 628 transitions, 1873 flow [2024-11-10 14:38:22,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 611.0) internal successors, (3666), 6 states have internal predecessors, (3666), 0 states have call successors, (0), 0 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-10 14:38:22,019 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:22,019 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:22,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-10 14:38:22,020 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:22,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:22,020 INFO L85 PathProgramCache]: Analyzing trace with hash -950164685, now seen corresponding path program 1 times [2024-11-10 14:38:22,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:22,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677778310] [2024-11-10 14:38:22,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:22,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:22,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:22,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:22,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677778310] [2024-11-10 14:38:22,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677778310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:22,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:22,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:22,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645964218] [2024-11-10 14:38:22,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:22,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:22,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:22,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:22,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:23,135 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 658 [2024-11-10 14:38:23,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 628 transitions, 1873 flow. Second operand has 6 states, 6 states have (on average 610.8333333333334) internal successors, (3665), 6 states have internal predecessors, (3665), 0 states have call successors, (0), 0 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-10 14:38:23,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:23,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 658 [2024-11-10 14:38:23,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:24,922 INFO L124 PetriNetUnfolderBase]: 633/9651 cut-off events. [2024-11-10 14:38:24,922 INFO L125 PetriNetUnfolderBase]: For 2279/2347 co-relation queries the response was YES. [2024-11-10 14:38:25,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13904 conditions, 9651 events. 633/9651 cut-off events. For 2279/2347 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 99907 event pairs, 42 based on Foata normal form. 10/8999 useless extension candidates. Maximal degree in co-relation 13772. Up to 282 conditions per place. [2024-11-10 14:38:25,027 INFO L140 encePairwiseOnDemand]: 650/658 looper letters, 42 selfloop transitions, 6 changer transitions 0/634 dead transitions. [2024-11-10 14:38:25,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 648 places, 634 transitions, 1989 flow [2024-11-10 14:38:25,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:25,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3692 transitions. [2024-11-10 14:38:25,030 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351570415400202 [2024-11-10 14:38:25,030 INFO L175 Difference]: Start difference. First operand has 645 places, 628 transitions, 1873 flow. Second operand 6 states and 3692 transitions. [2024-11-10 14:38:25,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 648 places, 634 transitions, 1989 flow [2024-11-10 14:38:25,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 634 transitions, 1976 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 14:38:25,058 INFO L231 Difference]: Finished difference. Result has 644 places, 626 transitions, 1868 flow [2024-11-10 14:38:25,059 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1856, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1868, PETRI_PLACES=644, PETRI_TRANSITIONS=626} [2024-11-10 14:38:25,060 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 30 predicate places. [2024-11-10 14:38:25,060 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 626 transitions, 1868 flow [2024-11-10 14:38:25,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 610.8333333333334) internal successors, (3665), 6 states have internal predecessors, (3665), 0 states have call successors, (0), 0 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-10 14:38:25,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:25,061 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:25,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-10 14:38:25,061 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:25,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:25,062 INFO L85 PathProgramCache]: Analyzing trace with hash 285457166, now seen corresponding path program 1 times [2024-11-10 14:38:25,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:25,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480766721] [2024-11-10 14:38:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:25,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:25,122 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:25,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:25,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480766721] [2024-11-10 14:38:25,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480766721] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:25,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:25,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:25,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150655743] [2024-11-10 14:38:25,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:25,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:25,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:25,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:25,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:25,141 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 624 out of 658 [2024-11-10 14:38:25,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 626 transitions, 1868 flow. Second operand has 3 states, 3 states have (on average 625.6666666666666) internal successors, (1877), 3 states have internal predecessors, (1877), 0 states have call successors, (0), 0 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-10 14:38:25,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:25,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 624 of 658 [2024-11-10 14:38:25,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:27,032 INFO L124 PetriNetUnfolderBase]: 742/9696 cut-off events. [2024-11-10 14:38:27,032 INFO L125 PetriNetUnfolderBase]: For 1468/1488 co-relation queries the response was YES. [2024-11-10 14:38:27,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13223 conditions, 9696 events. 742/9696 cut-off events. For 1468/1488 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 97527 event pairs, 75 based on Foata normal form. 0/8973 useless extension candidates. Maximal degree in co-relation 13092. Up to 558 conditions per place. [2024-11-10 14:38:27,328 INFO L140 encePairwiseOnDemand]: 652/658 looper letters, 19 selfloop transitions, 2 changer transitions 0/628 dead transitions. [2024-11-10 14:38:27,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 642 places, 628 transitions, 1918 flow [2024-11-10 14:38:27,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:38:27,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:38:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1897 transitions. [2024-11-10 14:38:27,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9609929078014184 [2024-11-10 14:38:27,330 INFO L175 Difference]: Start difference. First operand has 644 places, 626 transitions, 1868 flow. Second operand 3 states and 1897 transitions. [2024-11-10 14:38:27,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 642 places, 628 transitions, 1918 flow [2024-11-10 14:38:27,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 637 places, 628 transitions, 1906 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-10 14:38:27,343 INFO L231 Difference]: Finished difference. Result has 638 places, 624 transitions, 1862 flow [2024-11-10 14:38:27,344 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1848, PETRI_DIFFERENCE_MINUEND_PLACES=635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1862, PETRI_PLACES=638, PETRI_TRANSITIONS=624} [2024-11-10 14:38:27,344 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 24 predicate places. [2024-11-10 14:38:27,344 INFO L471 AbstractCegarLoop]: Abstraction has has 638 places, 624 transitions, 1862 flow [2024-11-10 14:38:27,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 625.6666666666666) internal successors, (1877), 3 states have internal predecessors, (1877), 0 states have call successors, (0), 0 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-10 14:38:27,345 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:27,345 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:27,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-10 14:38:27,345 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread3Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:27,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:27,346 INFO L85 PathProgramCache]: Analyzing trace with hash -108328184, now seen corresponding path program 1 times [2024-11-10 14:38:27,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:27,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724305255] [2024-11-10 14:38:27,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:27,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:27,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724305255] [2024-11-10 14:38:27,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724305255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:27,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:27,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:27,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983854051] [2024-11-10 14:38:27,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:27,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:27,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:27,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:28,381 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 658 [2024-11-10 14:38:28,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 638 places, 624 transitions, 1862 flow. Second operand has 6 states, 6 states have (on average 611.1666666666666) internal successors, (3667), 6 states have internal predecessors, (3667), 0 states have call successors, (0), 0 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-10 14:38:28,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:28,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 658 [2024-11-10 14:38:28,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:29,699 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][602], [Black: 757#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 756#(<= ~n1~0 0), Black: 770#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 658#(= |#race~n1~0| 0), Black: 900#true, 906#(= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0), Black: 775#true, 676#(= |#race~n3~0| 0), 902#(= |#race~get3~0| 0), Black: 788#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 680#true, Black: 684#true, Black: 688#true, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 813#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 826#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 812#(<= ~n2~0 0), Black: 700#true, 690#(= |#race~count3~0| 0), 777#(= |#race~get2~0| 0), 259#L125true, 807#true, Black: 837#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 844#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 850#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), 61#L90-16true, Black: 836#(<= ~n3~0 0), Black: 842#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 715#(<= ~n1~0 0), Black: 721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 729#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 716#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), 686#(= |#race~count2~0| 0), Black: 740#(not |thread2Thread1of1ForFork2_#t~short10|), 831#true, Black: 745#(not |thread3Thread1of1ForFork1_#t~short19|), Black: 863#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 862#(<= ~n3~0 0), Black: 876#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 702#(= |#race~get1~0| 0), 682#(= |#race~count1~0| 0), Black: 885#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 670#(= |#race~n2~0| 0), 751#true, Black: 892#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0))]) [2024-11-10 14:38:29,699 INFO L294 olderBase$Statistics]: this new event has 363 ancestors and is cut-off event [2024-11-10 14:38:29,699 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:38:29,699 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2024-11-10 14:38:29,699 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2024-11-10 14:38:29,701 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][606], [Black: 757#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 756#(<= ~n1~0 0), Black: 770#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 658#(= |#race~n1~0| 0), Black: 900#true, Black: 775#true, 676#(= |#race~n3~0| 0), 902#(= |#race~get3~0| 0), Black: 788#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 680#true, Black: 684#true, Black: 688#true, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 813#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 826#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), 907#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0)), Black: 812#(<= ~n2~0 0), Black: 700#true, 690#(= |#race~count3~0| 0), 777#(= |#race~get2~0| 0), 259#L125true, 807#true, Black: 837#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 844#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 850#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 836#(<= ~n3~0 0), 505#L90-15true, Black: 842#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 715#(<= ~n1~0 0), Black: 721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 729#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 716#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), 686#(= |#race~count2~0| 0), Black: 740#(not |thread2Thread1of1ForFork2_#t~short10|), 831#true, Black: 745#(not |thread3Thread1of1ForFork1_#t~short19|), Black: 863#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 862#(<= ~n3~0 0), Black: 876#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 702#(= |#race~get1~0| 0), 682#(= |#race~count1~0| 0), Black: 885#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 670#(= |#race~n2~0| 0), 751#true, Black: 892#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0))]) [2024-11-10 14:38:29,701 INFO L294 olderBase$Statistics]: this new event has 364 ancestors and is cut-off event [2024-11-10 14:38:29,701 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:29,701 INFO L297 olderBase$Statistics]: existing Event has 333 ancestors and is cut-off event [2024-11-10 14:38:29,701 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-11-10 14:38:29,703 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][610], [Black: 757#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 756#(<= ~n1~0 0), Black: 770#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 658#(= |#race~n1~0| 0), Black: 900#true, Black: 775#true, 676#(= |#race~n3~0| 0), 902#(= |#race~get3~0| 0), Black: 788#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 680#true, Black: 684#true, 40#L90-14true, Black: 688#true, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 813#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 826#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 812#(<= ~n2~0 0), Black: 700#true, 690#(= |#race~count3~0| 0), 777#(= |#race~get2~0| 0), 259#L125true, 807#true, Black: 837#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 844#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 850#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 836#(<= ~n3~0 0), Black: 842#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 715#(<= ~n1~0 0), Black: 721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 729#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 716#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), 908#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0)), 686#(= |#race~count2~0| 0), Black: 740#(not |thread2Thread1of1ForFork2_#t~short10|), 831#true, Black: 745#(not |thread3Thread1of1ForFork1_#t~short19|), Black: 863#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 862#(<= ~n3~0 0), Black: 876#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 702#(= |#race~get1~0| 0), 682#(= |#race~count1~0| 0), Black: 885#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 670#(= |#race~n2~0| 0), 751#true, Black: 892#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0))]) [2024-11-10 14:38:29,703 INFO L294 olderBase$Statistics]: this new event has 365 ancestors and is cut-off event [2024-11-10 14:38:29,703 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:29,703 INFO L297 olderBase$Statistics]: existing Event has 365 ancestors and is cut-off event [2024-11-10 14:38:29,703 INFO L297 olderBase$Statistics]: existing Event has 334 ancestors and is cut-off event [2024-11-10 14:38:29,705 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][613], [Black: 757#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 756#(<= ~n1~0 0), Black: 770#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 658#(= |#race~n1~0| 0), Black: 900#true, Black: 775#true, 676#(= |#race~n3~0| 0), 902#(= |#race~get3~0| 0), 909#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 788#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 680#true, Black: 684#true, Black: 688#true, 547#L90-13true, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 813#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 826#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 812#(<= ~n2~0 0), Black: 700#true, 690#(= |#race~count3~0| 0), 777#(= |#race~get2~0| 0), 259#L125true, 807#true, Black: 837#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 844#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 850#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 836#(<= ~n3~0 0), Black: 842#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 715#(<= ~n1~0 0), Black: 721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 729#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 716#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), 686#(= |#race~count2~0| 0), Black: 740#(not |thread2Thread1of1ForFork2_#t~short10|), 831#true, Black: 745#(not |thread3Thread1of1ForFork1_#t~short19|), Black: 863#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 862#(<= ~n3~0 0), Black: 876#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 702#(= |#race~get1~0| 0), 682#(= |#race~count1~0| 0), Black: 885#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 670#(= |#race~n2~0| 0), 751#true, Black: 892#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0))]) [2024-11-10 14:38:29,705 INFO L294 olderBase$Statistics]: this new event has 366 ancestors and is cut-off event [2024-11-10 14:38:29,705 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2024-11-10 14:38:29,705 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-10 14:38:29,705 INFO L297 olderBase$Statistics]: existing Event has 366 ancestors and is cut-off event [2024-11-10 14:38:29,706 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1660] thread2EXIT-->L125: Formula: (and (= 0 v_thread2Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork2_thidvar0_4) (= 0 v_thread2Thread1of1ForFork2_thidvar1_4)) InVars {thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork2_thidvar2=v_thread2Thread1of1ForFork2_thidvar2_4, thread2Thread1of1ForFork2_thidvar1=v_thread2Thread1of1ForFork2_thidvar1_4, thread2Thread1of1ForFork2_thidvar0=v_thread2Thread1of1ForFork2_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][613], [Black: 757#(and (<= ~n1~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 756#(<= ~n1~0 0), Black: 770#(and (<= ~n1~0 0) (not |thread2Thread1of1ForFork2_#t~short10|) (= thread2Thread1of1ForFork2_~i~1 0)), 658#(= |#race~n1~0| 0), Black: 900#true, Black: 775#true, 676#(= |#race~n3~0| 0), 902#(= |#race~get3~0| 0), 909#(and (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) ~get2~0.offset 1)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 2 ~get2~0.offset)) 0) (= (select (select |#race| ~get2~0.base) (+ (* thread3Thread1of1ForFork1_~i~2 4) 3 ~get2~0.offset)) 0)), Black: 788#(and (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 787#(<= ~n2~0 0), Black: 795#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 801#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n2~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 793#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 680#true, Black: 684#true, Black: 688#true, Black: 697#(not |thread1Thread1of1ForFork0_#t~short1|), Black: 813#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0)), Black: 826#(and (= thread1Thread1of1ForFork0_~i~0 0) (<= ~n2~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 812#(<= ~n2~0 0), Black: 700#true, 690#(= |#race~count3~0| 0), 233#L90-12true, 777#(= |#race~get2~0| 0), 259#L125true, 807#true, Black: 837#(and (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 844#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 850#(and (not |thread2Thread1of1ForFork2_#t~short10|) (<= ~n3~0 0) (= thread2Thread1of1ForFork2_~i~1 0)), Black: 836#(<= ~n3~0 0), Black: 842#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 723#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 715#(<= ~n1~0 0), Black: 721#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 729#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0) (not |thread1Thread1of1ForFork0_#t~short1|)), Black: 716#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork0_~i~0 0)), 686#(= |#race~count2~0| 0), Black: 740#(not |thread2Thread1of1ForFork2_#t~short10|), 831#true, Black: 745#(not |thread3Thread1of1ForFork1_#t~short19|), Black: 863#(and (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), Black: 862#(<= ~n3~0 0), Black: 876#(and (not |thread3Thread1of1ForFork1_#t~short19|) (<= ~n3~0 0) (= thread3Thread1of1ForFork1_~i~2 0)), 702#(= |#race~get1~0| 0), 682#(= |#race~count1~0| 0), Black: 885#(and (= (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4) 1)) 0) (= (select (select |#race| ~get1~0.base) (+ 2 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= (select (select |#race| ~get1~0.base) (+ 3 ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))) 0) (= 0 (select (select |#race| ~get1~0.base) (+ ~get1~0.offset (* thread1Thread1of1ForFork0_~i~0 4))))), 670#(= |#race~n2~0| 0), 751#true, Black: 892#(and (= (select (select |#race| ~get1~0.base) (+ 2 (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) 3 ~get1~0.offset)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset 1)) 0) (= (select (select |#race| ~get1~0.base) (+ (* thread2Thread1of1ForFork2_~i~1 4) ~get1~0.offset)) 0))]) [2024-11-10 14:38:29,706 INFO L294 olderBase$Statistics]: this new event has 367 ancestors and is cut-off event [2024-11-10 14:38:29,707 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2024-11-10 14:38:29,707 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2024-11-10 14:38:29,707 INFO L297 olderBase$Statistics]: existing Event has 367 ancestors and is cut-off event [2024-11-10 14:38:29,716 INFO L124 PetriNetUnfolderBase]: 641/7003 cut-off events. [2024-11-10 14:38:29,716 INFO L125 PetriNetUnfolderBase]: For 2220/2508 co-relation queries the response was YES. [2024-11-10 14:38:29,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10598 conditions, 7003 events. 641/7003 cut-off events. For 2220/2508 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 67551 event pairs, 87 based on Foata normal form. 39/6632 useless extension candidates. Maximal degree in co-relation 10466. Up to 440 conditions per place. [2024-11-10 14:38:29,801 INFO L140 encePairwiseOnDemand]: 650/658 looper letters, 42 selfloop transitions, 6 changer transitions 0/631 dead transitions. [2024-11-10 14:38:29,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 641 places, 631 transitions, 1984 flow [2024-11-10 14:38:29,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:29,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:29,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3692 transitions. [2024-11-10 14:38:29,803 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351570415400202 [2024-11-10 14:38:29,803 INFO L175 Difference]: Start difference. First operand has 638 places, 624 transitions, 1862 flow. Second operand 6 states and 3692 transitions. [2024-11-10 14:38:29,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 641 places, 631 transitions, 1984 flow [2024-11-10 14:38:29,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 631 transitions, 1984 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-10 14:38:29,822 INFO L231 Difference]: Finished difference. Result has 642 places, 623 transitions, 1881 flow [2024-11-10 14:38:29,823 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1858, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=622, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=616, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1881, PETRI_PLACES=642, PETRI_TRANSITIONS=623} [2024-11-10 14:38:29,823 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 28 predicate places. [2024-11-10 14:38:29,823 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 623 transitions, 1881 flow [2024-11-10 14:38:29,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 611.1666666666666) internal successors, (3667), 6 states have internal predecessors, (3667), 0 states have call successors, (0), 0 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-10 14:38:29,824 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:29,824 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:38:29,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-10 14:38:29,825 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:29,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:29,825 INFO L85 PathProgramCache]: Analyzing trace with hash 737284593, now seen corresponding path program 1 times [2024-11-10 14:38:29,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:29,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517615517] [2024-11-10 14:38:29,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:29,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 14:38:30,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:30,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517615517] [2024-11-10 14:38:30,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517615517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:30,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:30,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:38:30,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163862400] [2024-11-10 14:38:30,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:30,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 14:38:30,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:30,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 14:38:30,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-10 14:38:30,856 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 608 out of 658 [2024-11-10 14:38:30,858 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 623 transitions, 1881 flow. Second operand has 6 states, 6 states have (on average 611.0) internal successors, (3666), 6 states have internal predecessors, (3666), 0 states have call successors, (0), 0 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-10 14:38:30,858 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:30,858 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 608 of 658 [2024-11-10 14:38:30,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:38:32,835 INFO L124 PetriNetUnfolderBase]: 785/11071 cut-off events. [2024-11-10 14:38:32,835 INFO L125 PetriNetUnfolderBase]: For 2559/2671 co-relation queries the response was YES. [2024-11-10 14:38:32,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16407 conditions, 11071 events. 785/11071 cut-off events. For 2559/2671 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 118679 event pairs, 72 based on Foata normal form. 17/10464 useless extension candidates. Maximal degree in co-relation 16273. Up to 417 conditions per place. [2024-11-10 14:38:32,995 INFO L140 encePairwiseOnDemand]: 650/658 looper letters, 42 selfloop transitions, 6 changer transitions 0/629 dead transitions. [2024-11-10 14:38:32,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 629 transitions, 1997 flow [2024-11-10 14:38:32,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 14:38:32,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-10 14:38:32,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3692 transitions. [2024-11-10 14:38:32,997 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9351570415400202 [2024-11-10 14:38:32,998 INFO L175 Difference]: Start difference. First operand has 642 places, 623 transitions, 1881 flow. Second operand 6 states and 3692 transitions. [2024-11-10 14:38:32,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 629 transitions, 1997 flow [2024-11-10 14:38:33,018 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 629 transitions, 1984 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-10 14:38:33,022 INFO L231 Difference]: Finished difference. Result has 641 places, 621 transitions, 1876 flow [2024-11-10 14:38:33,022 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=658, PETRI_DIFFERENCE_MINUEND_FLOW=1864, PETRI_DIFFERENCE_MINUEND_PLACES=636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=621, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1876, PETRI_PLACES=641, PETRI_TRANSITIONS=621} [2024-11-10 14:38:33,023 INFO L277 CegarLoopForPetriNet]: 614 programPoint places, 27 predicate places. [2024-11-10 14:38:33,023 INFO L471 AbstractCegarLoop]: Abstraction has has 641 places, 621 transitions, 1876 flow [2024-11-10 14:38:33,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 611.0) internal successors, (3666), 6 states have internal predecessors, (3666), 0 states have call successors, (0), 0 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-10 14:38:33,023 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:38:33,024 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] [2024-11-10 14:38:33,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-10 14:38:33,024 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err18ASSERT_VIOLATIONDATA_RACE, thread1Err17ASSERT_VIOLATIONDATA_RACE, thread1Err16ASSERT_VIOLATIONDATA_RACE, thread1Err13ASSERT_VIOLATIONDATA_RACE (and 133 more)] === [2024-11-10 14:38:33,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:38:33,024 INFO L85 PathProgramCache]: Analyzing trace with hash 121220274, now seen corresponding path program 1 times [2024-11-10 14:38:33,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:38:33,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053855581] [2024-11-10 14:38:33,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:38:33,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:38:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:38:33,259 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-10 14:38:33,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:38:33,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053855581] [2024-11-10 14:38:33,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053855581] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:38:33,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:38:33,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:38:33,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489422600] [2024-11-10 14:38:33,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:38:33,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:38:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:38:33,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:38:33,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:38:33,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 631 out of 658 [2024-11-10 14:38:33,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 641 places, 621 transitions, 1876 flow. Second operand has 3 states, 3 states have (on average 633.6666666666666) internal successors, (1901), 3 states have internal predecessors, (1901), 0 states have call successors, (0), 0 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-10 14:38:33,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:38:33,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 631 of 658 [2024-11-10 14:38:33,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand